java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_clnt.blast.02.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:52:32,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:52:32,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:52:32,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:52:32,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:52:32,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:52:32,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:52:32,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:52:32,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:52:32,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:52:32,114 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:52:32,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:52:32,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:52:32,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:52:32,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:52:32,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:52:32,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:52:32,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:52:32,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:52:32,134 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:52:32,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:52:32,139 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:52:32,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:52:32,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:52:32,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:52:32,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:52:32,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:52:32,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:52:32,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:52:32,153 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:52:32,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:52:32,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:52:32,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:52:32,156 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:52:32,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:52:32,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:52:32,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:52:32,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:52:32,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:52:32,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:52:32,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:52:32,162 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:52:32,177 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:52:32,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:52:32,177 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:52:32,177 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:52:32,178 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:52:32,178 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:52:32,179 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:52:32,179 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:52:32,179 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:52:32,179 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:52:32,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:52:32,180 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:52:32,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:52:32,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:52:32,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:52:32,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:52:32,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:52:32,181 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:52:32,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:52:32,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:52:32,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:52:32,182 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:52:32,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:52:32,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:52:32,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:52:32,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:52:32,183 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:52:32,183 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:52:32,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:52:32,184 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:52:32,216 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:52:32,231 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:52:32,235 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:52:32,236 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:52:32,237 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:52:32,238 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_clnt.blast.02.i.cil-1.c [2019-09-09 05:52:32,309 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0310e403b/22968ebb77604f02854a324f69a55b91/FLAGc91efb8d0 [2019-09-09 05:52:32,871 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:52:32,873 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_clnt.blast.02.i.cil-1.c [2019-09-09 05:52:32,902 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0310e403b/22968ebb77604f02854a324f69a55b91/FLAGc91efb8d0 [2019-09-09 05:52:33,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0310e403b/22968ebb77604f02854a324f69a55b91 [2019-09-09 05:52:33,105 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:52:33,106 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:52:33,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:52:33,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:52:33,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:52:33,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:52:33" (1/1) ... [2019-09-09 05:52:33,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3708f175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:33, skipping insertion in model container [2019-09-09 05:52:33,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:52:33" (1/1) ... [2019-09-09 05:52:33,123 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:52:33,207 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:52:33,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:52:33,849 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:52:34,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:52:34,075 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:52:34,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:34 WrapperNode [2019-09-09 05:52:34,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:52:34,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:52:34,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:52:34,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:52:34,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:34" (1/1) ... [2019-09-09 05:52:34,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:34" (1/1) ... [2019-09-09 05:52:34,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:34" (1/1) ... [2019-09-09 05:52:34,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:34" (1/1) ... [2019-09-09 05:52:34,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:34" (1/1) ... [2019-09-09 05:52:34,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:34" (1/1) ... [2019-09-09 05:52:34,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:34" (1/1) ... [2019-09-09 05:52:34,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:52:34,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:52:34,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:52:34,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:52:34,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2019-09-09 05:52:34,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:52:34,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:52:34,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-09 05:52:34,330 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-09 05:52:34,330 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:52:34,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-09 05:52:34,331 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-09 05:52:34,331 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-09 05:52:34,331 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-09 05:52:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:52:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-09 05:52:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:52:34,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:52:34,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:52:34,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:52:34,332 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-09 05:52:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-09 05:52:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-09 05:52:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-09 05:52:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-09 05:52:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-09 05:52:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-09 05:52:34,334 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:52:34,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-09 05:52:34,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-09 05:52:34,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-09 05:52:34,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-09 05:52:34,335 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-09 05:52:34,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-09 05:52:34,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:52:34,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-09 05:52:34,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-09 05:52:34,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-09 05:52:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:52:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-09 05:52:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-09 05:52:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-09 05:52:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-09 05:52:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-09 05:52:34,861 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:35,635 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-09 05:52:35,635 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-09 05:52:35,664 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:52:35,664 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:52:35,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:52:35 BoogieIcfgContainer [2019-09-09 05:52:35,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:52:35,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:52:35,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:52:35,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:52:35,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:52:33" (1/3) ... [2019-09-09 05:52:35,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5beed986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:52:35, skipping insertion in model container [2019-09-09 05:52:35,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:34" (2/3) ... [2019-09-09 05:52:35,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5beed986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:52:35, skipping insertion in model container [2019-09-09 05:52:35,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:52:35" (3/3) ... [2019-09-09 05:52:35,677 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2019-09-09 05:52:35,688 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:52:35,699 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:52:35,717 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:52:35,748 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:52:35,748 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:52:35,748 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:52:35,748 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:52:35,748 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:52:35,749 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:52:35,749 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:52:35,749 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:52:35,775 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2019-09-09 05:52:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-09 05:52:35,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:35,791 INFO L399 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] [2019-09-09 05:52:35,794 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:35,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:35,800 INFO L82 PathProgramCache]: Analyzing trace with hash 461476132, now seen corresponding path program 1 times [2019-09-09 05:52:35,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:35,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:35,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:35,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:35,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:52:36,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:36,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:52:36,188 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:36,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:52:36,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:52:36,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:52:36,211 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2019-09-09 05:52:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:36,352 INFO L93 Difference]: Finished difference Result 253 states and 413 transitions. [2019-09-09 05:52:36,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:52:36,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-09 05:52:36,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:36,378 INFO L225 Difference]: With dead ends: 253 [2019-09-09 05:52:36,379 INFO L226 Difference]: Without dead ends: 218 [2019-09-09 05:52:36,381 INFO L628 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 [2019-09-09 05:52:36,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-09 05:52:36,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2019-09-09 05:52:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-09-09 05:52:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 322 transitions. [2019-09-09 05:52:36,449 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 322 transitions. Word has length 30 [2019-09-09 05:52:36,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:36,450 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 322 transitions. [2019-09-09 05:52:36,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:52:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 322 transitions. [2019-09-09 05:52:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-09 05:52:36,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:36,453 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:52:36,454 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:36,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:36,454 INFO L82 PathProgramCache]: Analyzing trace with hash -359362032, now seen corresponding path program 1 times [2019-09-09 05:52:36,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:36,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:36,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:36,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:36,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:36,597 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:52:36,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:36,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:52:36,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:36,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:52:36,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:52:36,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:52:36,602 INFO L87 Difference]: Start difference. First operand 218 states and 322 transitions. Second operand 3 states. [2019-09-09 05:52:36,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:36,670 INFO L93 Difference]: Finished difference Result 318 states and 469 transitions. [2019-09-09 05:52:36,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:52:36,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-09 05:52:36,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:36,674 INFO L225 Difference]: With dead ends: 318 [2019-09-09 05:52:36,674 INFO L226 Difference]: Without dead ends: 318 [2019-09-09 05:52:36,675 INFO L628 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 [2019-09-09 05:52:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-09 05:52:36,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2019-09-09 05:52:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-09 05:52:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 469 transitions. [2019-09-09 05:52:36,709 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 469 transitions. Word has length 45 [2019-09-09 05:52:36,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:36,713 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 469 transitions. [2019-09-09 05:52:36,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:52:36,713 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 469 transitions. [2019-09-09 05:52:36,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:52:36,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:36,719 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-09 05:52:36,719 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:36,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:36,720 INFO L82 PathProgramCache]: Analyzing trace with hash 31651983, now seen corresponding path program 1 times [2019-09-09 05:52:36,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:36,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:36,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:36,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:36,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:36,906 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:36,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:36,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:36,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:36,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:36,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:36,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:36,909 INFO L87 Difference]: Start difference. First operand 318 states and 469 transitions. Second operand 4 states. [2019-09-09 05:52:37,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:37,478 INFO L93 Difference]: Finished difference Result 503 states and 745 transitions. [2019-09-09 05:52:37,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:37,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:52:37,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:37,483 INFO L225 Difference]: With dead ends: 503 [2019-09-09 05:52:37,483 INFO L226 Difference]: Without dead ends: 503 [2019-09-09 05:52:37,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-09-09 05:52:37,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 368. [2019-09-09 05:52:37,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-09 05:52:37,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 555 transitions. [2019-09-09 05:52:37,501 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 555 transitions. Word has length 63 [2019-09-09 05:52:37,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:37,502 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 555 transitions. [2019-09-09 05:52:37,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:37,502 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 555 transitions. [2019-09-09 05:52:37,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:52:37,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:37,506 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-09 05:52:37,506 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:37,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:37,506 INFO L82 PathProgramCache]: Analyzing trace with hash -102361523, now seen corresponding path program 1 times [2019-09-09 05:52:37,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:37,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:37,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:37,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:37,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:37,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:37,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:37,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:37,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:37,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:37,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:37,602 INFO L87 Difference]: Start difference. First operand 368 states and 555 transitions. Second operand 4 states. [2019-09-09 05:52:37,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:37,956 INFO L93 Difference]: Finished difference Result 453 states and 680 transitions. [2019-09-09 05:52:37,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:37,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:52:37,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:37,962 INFO L225 Difference]: With dead ends: 453 [2019-09-09 05:52:37,962 INFO L226 Difference]: Without dead ends: 453 [2019-09-09 05:52:37,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:37,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-09 05:52:37,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 408. [2019-09-09 05:52:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-09 05:52:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2019-09-09 05:52:37,981 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 63 [2019-09-09 05:52:37,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:37,983 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2019-09-09 05:52:37,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:37,983 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2019-09-09 05:52:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:52:37,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:37,989 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-09-09 05:52:37,989 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:37,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:37,990 INFO L82 PathProgramCache]: Analyzing trace with hash 976525712, now seen corresponding path program 1 times [2019-09-09 05:52:37,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:37,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:37,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:37,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:37,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:38,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:38,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:38,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:38,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:38,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:38,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:38,113 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 4 states. [2019-09-09 05:52:38,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:38,607 INFO L93 Difference]: Finished difference Result 535 states and 803 transitions. [2019-09-09 05:52:38,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:38,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-09 05:52:38,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:38,614 INFO L225 Difference]: With dead ends: 535 [2019-09-09 05:52:38,614 INFO L226 Difference]: Without dead ends: 535 [2019-09-09 05:52:38,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:38,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-09 05:52:38,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 410. [2019-09-09 05:52:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:52:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 625 transitions. [2019-09-09 05:52:38,626 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 625 transitions. Word has length 64 [2019-09-09 05:52:38,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:38,626 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 625 transitions. [2019-09-09 05:52:38,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:38,626 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 625 transitions. [2019-09-09 05:52:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-09 05:52:38,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:38,628 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:38,628 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:38,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:38,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1151289447, now seen corresponding path program 1 times [2019-09-09 05:52:38,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:38,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:38,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:38,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:38,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:38,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:38,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:38,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:38,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:38,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:38,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:38,715 INFO L87 Difference]: Start difference. First operand 410 states and 625 transitions. Second operand 4 states. [2019-09-09 05:52:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:39,158 INFO L93 Difference]: Finished difference Result 533 states and 799 transitions. [2019-09-09 05:52:39,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:39,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-09 05:52:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:39,163 INFO L225 Difference]: With dead ends: 533 [2019-09-09 05:52:39,164 INFO L226 Difference]: Without dead ends: 533 [2019-09-09 05:52:39,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:39,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-09 05:52:39,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2019-09-09 05:52:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:52:39,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 623 transitions. [2019-09-09 05:52:39,175 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 623 transitions. Word has length 77 [2019-09-09 05:52:39,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:39,175 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 623 transitions. [2019-09-09 05:52:39,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:39,176 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 623 transitions. [2019-09-09 05:52:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-09 05:52:39,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:39,178 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:52:39,178 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:39,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:39,178 INFO L82 PathProgramCache]: Analyzing trace with hash 42309001, now seen corresponding path program 1 times [2019-09-09 05:52:39,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:39,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:39,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:39,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:39,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:39,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:39,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:39,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:39,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:39,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:39,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:39,260 INFO L87 Difference]: Start difference. First operand 410 states and 623 transitions. Second operand 4 states. [2019-09-09 05:52:39,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:39,703 INFO L93 Difference]: Finished difference Result 533 states and 797 transitions. [2019-09-09 05:52:39,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:39,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-09 05:52:39,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:39,706 INFO L225 Difference]: With dead ends: 533 [2019-09-09 05:52:39,707 INFO L226 Difference]: Without dead ends: 533 [2019-09-09 05:52:39,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:39,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-09 05:52:39,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2019-09-09 05:52:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:52:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 621 transitions. [2019-09-09 05:52:39,735 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 621 transitions. Word has length 77 [2019-09-09 05:52:39,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:39,736 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 621 transitions. [2019-09-09 05:52:39,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:39,736 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 621 transitions. [2019-09-09 05:52:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-09 05:52:39,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:39,737 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:39,738 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:39,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:39,738 INFO L82 PathProgramCache]: Analyzing trace with hash 121930149, now seen corresponding path program 1 times [2019-09-09 05:52:39,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:39,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:39,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:39,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:39,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:39,808 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:39,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:39,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:39,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:39,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:39,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:39,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:39,810 INFO L87 Difference]: Start difference. First operand 410 states and 621 transitions. Second operand 4 states. [2019-09-09 05:52:40,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:40,114 INFO L93 Difference]: Finished difference Result 453 states and 674 transitions. [2019-09-09 05:52:40,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:40,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-09 05:52:40,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:40,118 INFO L225 Difference]: With dead ends: 453 [2019-09-09 05:52:40,118 INFO L226 Difference]: Without dead ends: 453 [2019-09-09 05:52:40,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:40,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-09 05:52:40,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2019-09-09 05:52:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:52:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 619 transitions. [2019-09-09 05:52:40,129 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 619 transitions. Word has length 77 [2019-09-09 05:52:40,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:40,129 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 619 transitions. [2019-09-09 05:52:40,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:40,129 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 619 transitions. [2019-09-09 05:52:40,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-09 05:52:40,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:40,131 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:52:40,131 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:40,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:40,132 INFO L82 PathProgramCache]: Analyzing trace with hash -987050297, now seen corresponding path program 1 times [2019-09-09 05:52:40,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:40,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:40,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:40,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:40,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:40,234 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:40,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:40,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:40,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:40,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:40,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:40,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:40,236 INFO L87 Difference]: Start difference. First operand 410 states and 619 transitions. Second operand 4 states. [2019-09-09 05:52:40,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:40,618 INFO L93 Difference]: Finished difference Result 453 states and 672 transitions. [2019-09-09 05:52:40,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:40,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-09 05:52:40,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:40,622 INFO L225 Difference]: With dead ends: 453 [2019-09-09 05:52:40,623 INFO L226 Difference]: Without dead ends: 453 [2019-09-09 05:52:40,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:40,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-09 05:52:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2019-09-09 05:52:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:52:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 617 transitions. [2019-09-09 05:52:40,641 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 617 transitions. Word has length 77 [2019-09-09 05:52:40,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:40,641 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 617 transitions. [2019-09-09 05:52:40,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 617 transitions. [2019-09-09 05:52:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-09 05:52:40,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:40,648 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2019-09-09 05:52:40,649 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:40,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:40,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1365972106, now seen corresponding path program 1 times [2019-09-09 05:52:40,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:40,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:40,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:40,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:40,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:40,742 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:40,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:40,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:40,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:40,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:40,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:40,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:40,745 INFO L87 Difference]: Start difference. First operand 410 states and 617 transitions. Second operand 4 states. [2019-09-09 05:52:41,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:41,171 INFO L93 Difference]: Finished difference Result 533 states and 791 transitions. [2019-09-09 05:52:41,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:41,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-09 05:52:41,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:41,175 INFO L225 Difference]: With dead ends: 533 [2019-09-09 05:52:41,175 INFO L226 Difference]: Without dead ends: 533 [2019-09-09 05:52:41,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:41,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-09 05:52:41,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2019-09-09 05:52:41,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:52:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 615 transitions. [2019-09-09 05:52:41,186 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 615 transitions. Word has length 78 [2019-09-09 05:52:41,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:41,187 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 615 transitions. [2019-09-09 05:52:41,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:41,187 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2019-09-09 05:52:41,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-09 05:52:41,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:41,189 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2019-09-09 05:52:41,189 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:41,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:41,190 INFO L82 PathProgramCache]: Analyzing trace with hash -479395060, now seen corresponding path program 1 times [2019-09-09 05:52:41,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:41,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:41,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:41,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:41,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:41,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:41,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:41,283 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:41,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:41,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:41,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:41,284 INFO L87 Difference]: Start difference. First operand 410 states and 615 transitions. Second operand 4 states. [2019-09-09 05:52:41,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:41,588 INFO L93 Difference]: Finished difference Result 453 states and 668 transitions. [2019-09-09 05:52:41,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:41,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-09 05:52:41,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:41,590 INFO L225 Difference]: With dead ends: 453 [2019-09-09 05:52:41,590 INFO L226 Difference]: Without dead ends: 453 [2019-09-09 05:52:41,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:41,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-09 05:52:41,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2019-09-09 05:52:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:52:41,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 613 transitions. [2019-09-09 05:52:41,599 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 613 transitions. Word has length 78 [2019-09-09 05:52:41,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:41,600 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 613 transitions. [2019-09-09 05:52:41,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:41,600 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 613 transitions. [2019-09-09 05:52:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:52:41,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:41,602 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2019-09-09 05:52:41,602 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:41,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:41,602 INFO L82 PathProgramCache]: Analyzing trace with hash -493563964, now seen corresponding path program 1 times [2019-09-09 05:52:41,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:41,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:41,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:41,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:41,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:41,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:41,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:41,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:41,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:41,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:41,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:41,675 INFO L87 Difference]: Start difference. First operand 410 states and 613 transitions. Second operand 4 states. [2019-09-09 05:52:42,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:42,099 INFO L93 Difference]: Finished difference Result 533 states and 787 transitions. [2019-09-09 05:52:42,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:42,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-09 05:52:42,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:42,103 INFO L225 Difference]: With dead ends: 533 [2019-09-09 05:52:42,103 INFO L226 Difference]: Without dead ends: 533 [2019-09-09 05:52:42,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:42,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-09 05:52:42,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2019-09-09 05:52:42,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:52:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 611 transitions. [2019-09-09 05:52:42,113 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 611 transitions. Word has length 79 [2019-09-09 05:52:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:42,113 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 611 transitions. [2019-09-09 05:52:42,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 611 transitions. [2019-09-09 05:52:42,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:52:42,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:42,115 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:52:42,115 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:42,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:42,116 INFO L82 PathProgramCache]: Analyzing trace with hash -565290761, now seen corresponding path program 1 times [2019-09-09 05:52:42,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:42,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:42,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:42,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:42,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:42,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:42,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:52:42,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:42,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:52:42,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:52:42,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:52:42,177 INFO L87 Difference]: Start difference. First operand 410 states and 611 transitions. Second operand 3 states. [2019-09-09 05:52:42,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:42,211 INFO L93 Difference]: Finished difference Result 559 states and 836 transitions. [2019-09-09 05:52:42,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:52:42,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-09 05:52:42,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:42,215 INFO L225 Difference]: With dead ends: 559 [2019-09-09 05:52:42,215 INFO L226 Difference]: Without dead ends: 559 [2019-09-09 05:52:42,215 INFO L628 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 [2019-09-09 05:52:42,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-09 05:52:42,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2019-09-09 05:52:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-09 05:52:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 836 transitions. [2019-09-09 05:52:42,228 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 836 transitions. Word has length 79 [2019-09-09 05:52:42,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:42,229 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 836 transitions. [2019-09-09 05:52:42,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:52:42,229 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 836 transitions. [2019-09-09 05:52:42,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-09 05:52:42,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:42,231 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:52:42,231 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:42,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:42,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2029348694, now seen corresponding path program 1 times [2019-09-09 05:52:42,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:42,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:42,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:42,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:42,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:42,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:42,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:42,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:42,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:42,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:42,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:42,296 INFO L87 Difference]: Start difference. First operand 559 states and 836 transitions. Second operand 4 states. [2019-09-09 05:52:42,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:42,780 INFO L93 Difference]: Finished difference Result 744 states and 1098 transitions. [2019-09-09 05:52:42,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:42,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-09 05:52:42,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:42,784 INFO L225 Difference]: With dead ends: 744 [2019-09-09 05:52:42,784 INFO L226 Difference]: Without dead ends: 744 [2019-09-09 05:52:42,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:42,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-09-09 05:52:42,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 559. [2019-09-09 05:52:42,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-09 05:52:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 833 transitions. [2019-09-09 05:52:42,797 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 833 transitions. Word has length 83 [2019-09-09 05:52:42,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:42,797 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 833 transitions. [2019-09-09 05:52:42,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:42,797 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 833 transitions. [2019-09-09 05:52:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-09 05:52:42,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:42,799 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:52:42,799 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:42,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:42,800 INFO L82 PathProgramCache]: Analyzing trace with hash -20039148, now seen corresponding path program 1 times [2019-09-09 05:52:42,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:42,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:42,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:42,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:42,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-09 05:52:42,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:42,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:52:42,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:42,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:52:42,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:52:42,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:52:42,862 INFO L87 Difference]: Start difference. First operand 559 states and 833 transitions. Second operand 3 states. [2019-09-09 05:52:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:42,891 INFO L93 Difference]: Finished difference Result 708 states and 1058 transitions. [2019-09-09 05:52:42,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:52:42,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-09 05:52:42,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:42,897 INFO L225 Difference]: With dead ends: 708 [2019-09-09 05:52:42,897 INFO L226 Difference]: Without dead ends: 708 [2019-09-09 05:52:42,897 INFO L628 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 [2019-09-09 05:52:42,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-09-09 05:52:42,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2019-09-09 05:52:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-09-09 05:52:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1058 transitions. [2019-09-09 05:52:42,915 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1058 transitions. Word has length 83 [2019-09-09 05:52:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:42,915 INFO L475 AbstractCegarLoop]: Abstraction has 708 states and 1058 transitions. [2019-09-09 05:52:42,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:52:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1058 transitions. [2019-09-09 05:52:42,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:52:42,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:42,919 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:42,919 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:42,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:42,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1988056367, now seen corresponding path program 1 times [2019-09-09 05:52:42,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:42,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:42,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:42,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:42,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:52:43,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:43,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:52:43,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:43,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:52:43,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:52:43,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:52:43,045 INFO L87 Difference]: Start difference. First operand 708 states and 1058 transitions. Second operand 6 states. [2019-09-09 05:52:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:43,601 INFO L93 Difference]: Finished difference Result 790 states and 1178 transitions. [2019-09-09 05:52:43,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:52:43,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2019-09-09 05:52:43,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:43,611 INFO L225 Difference]: With dead ends: 790 [2019-09-09 05:52:43,611 INFO L226 Difference]: Without dead ends: 790 [2019-09-09 05:52:43,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:52:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-09-09 05:52:43,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 716. [2019-09-09 05:52:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-09-09 05:52:43,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1071 transitions. [2019-09-09 05:52:43,628 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1071 transitions. Word has length 104 [2019-09-09 05:52:43,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:43,628 INFO L475 AbstractCegarLoop]: Abstraction has 716 states and 1071 transitions. [2019-09-09 05:52:43,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:52:43,628 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1071 transitions. [2019-09-09 05:52:43,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:52:43,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:43,631 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:43,631 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:43,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:43,632 INFO L82 PathProgramCache]: Analyzing trace with hash 853686630, now seen corresponding path program 1 times [2019-09-09 05:52:43,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:43,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:43,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:43,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:43,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:52:43,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:43,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:52:43,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:43,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:52:43,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:52:43,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:52:43,738 INFO L87 Difference]: Start difference. First operand 716 states and 1071 transitions. Second operand 6 states. [2019-09-09 05:52:44,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:44,264 INFO L93 Difference]: Finished difference Result 787 states and 1174 transitions. [2019-09-09 05:52:44,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:52:44,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-09 05:52:44,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:44,269 INFO L225 Difference]: With dead ends: 787 [2019-09-09 05:52:44,269 INFO L226 Difference]: Without dead ends: 787 [2019-09-09 05:52:44,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:52:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-09-09 05:52:44,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 717. [2019-09-09 05:52:44,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-09 05:52:44,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1072 transitions. [2019-09-09 05:52:44,284 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1072 transitions. Word has length 105 [2019-09-09 05:52:44,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:44,285 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1072 transitions. [2019-09-09 05:52:44,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:52:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1072 transitions. [2019-09-09 05:52:44,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-09 05:52:44,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:44,287 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:44,288 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:44,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:44,288 INFO L82 PathProgramCache]: Analyzing trace with hash 748535367, now seen corresponding path program 1 times [2019-09-09 05:52:44,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:44,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:44,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:44,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:44,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-09 05:52:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-09 05:52:45,326 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-09 05:52:45,396 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967296 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2019-09-09 05:52:45,398 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967294 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2019-09-09 05:52:45,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:52:45 BoogieIcfgContainer [2019-09-09 05:52:45,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:52:45,539 INFO L168 Benchmark]: Toolchain (without parser) took 12431.66 ms. Allocated memory was 141.6 MB in the beginning and 385.4 MB in the end (delta: 243.8 MB). Free memory was 87.3 MB in the beginning and 337.4 MB in the end (delta: -250.2 MB). Peak memory consumption was 211.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:52:45,541 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 141.6 MB. Free memory was 107.7 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:52:45,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 970.52 ms. Allocated memory was 141.6 MB in the beginning and 202.4 MB in the end (delta: 60.8 MB). Free memory was 87.0 MB in the beginning and 159.5 MB in the end (delta: -72.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2019-09-09 05:52:45,543 INFO L168 Benchmark]: Boogie Preprocessor took 165.98 ms. Allocated memory is still 202.4 MB. Free memory was 159.5 MB in the beginning and 152.2 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:52:45,544 INFO L168 Benchmark]: RCFGBuilder took 1423.15 ms. Allocated memory was 202.4 MB in the beginning and 230.2 MB in the end (delta: 27.8 MB). Free memory was 152.2 MB in the beginning and 175.2 MB in the end (delta: -23.1 MB). Peak memory consumption was 79.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:52:45,546 INFO L168 Benchmark]: TraceAbstraction took 9867.16 ms. Allocated memory was 230.2 MB in the beginning and 385.4 MB in the end (delta: 155.2 MB). Free memory was 175.2 MB in the beginning and 337.4 MB in the end (delta: -162.2 MB). Peak memory consumption was 211.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:52:45,557 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 141.6 MB. Free memory was 107.7 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 970.52 ms. Allocated memory was 141.6 MB in the beginning and 202.4 MB in the end (delta: 60.8 MB). Free memory was 87.0 MB in the beginning and 159.5 MB in the end (delta: -72.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 165.98 ms. Allocated memory is still 202.4 MB. Free memory was 159.5 MB in the beginning and 152.2 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1423.15 ms. Allocated memory was 202.4 MB in the beginning and 230.2 MB in the end (delta: 27.8 MB). Free memory was 152.2 MB in the beginning and 175.2 MB in the end (delta: -23.1 MB). Peak memory consumption was 79.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9867.16 ms. Allocated memory was 230.2 MB in the beginning and 385.4 MB in the end (delta: 155.2 MB). Free memory was 175.2 MB in the beginning and 337.4 MB in the end (delta: -162.2 MB). Peak memory consumption was 211.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967296 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967294 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1643]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1338. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=4294967337, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={-3:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1074] CALL ssl3_connect(s) VAL [init=1, s={-1:0}, SSLv3_client_data={-3:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int *tmp___0 = __VERIFIER_nondet_pointer() ; [L1090] int tmp___1 = __VERIFIER_nondet_int() ; [L1091] int tmp___2 = __VERIFIER_nondet_int() ; [L1092] int tmp___3 = __VERIFIER_nondet_int() ; [L1093] int tmp___4 = __VERIFIER_nondet_int() ; [L1094] int tmp___5 = __VERIFIER_nondet_int() ; [L1095] int tmp___6 = __VERIFIER_nondet_int() ; [L1096] int tmp___7 = __VERIFIER_nondet_int() ; [L1097] int tmp___8 = __VERIFIER_nondet_int() ; [L1098] long tmp___9 = __VERIFIER_nondet_long() ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->hit=__VERIFIER_nondet_int () [L1104] s->state = 12292 [L1105] tmp = __VERIFIER_nondet_int() [L1106] cb = (void (*)())((void *)0) [L1107] ret = -1 [L1108] skip = 0 [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->info_callback={4294967290:7}, skip=0, SSLv3_client_data={-3:0}, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=12292, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1249] EXPR s->version VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->version=3, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->init_buf={-4294967295:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1274] COND FALSE !(! tmp___4) VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1280] COND FALSE !(! tmp___5) [L1286] s->state = 4368 [L1287] EXPR s->ctx [L1287] EXPR (s->ctx)->stats.sess_connect [L1287] (s->ctx)->stats.sess_connect += 1 [L1288] s->init_num = 0 VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={4294967290:7}, (s->s3)->tmp.reuse_message=4294967323, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->s3={1:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND TRUE s->state == 4368 [L1292] s->shutdown = 0 [L1293] ret = __VERIFIER_nondet_int() [L1294] COND TRUE blastFlag == 0 [L1295] blastFlag = 1 VAL [={4294967290:7}, blastFlag=1, init=1, ret=11, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1303] COND FALSE !(ret <= 0) [L1308] s->state = 4384 [L1309] s->init_num = 0 [L1310] EXPR s->bbio [L1310] EXPR s->wbio VAL [={4294967290:7}, blastFlag=1, init=1, ret=11, s={-1:0}, s={-1:0}, s->bbio={2:2}, s->wbio={2:2}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1310] COND FALSE !((unsigned long )s->bbio != (unsigned long )s->wbio) [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={4294967290:7}, (s->s3)->tmp.reuse_message=4294967323, blastFlag=1, init=1, ret=11, s={-1:0}, s={-1:0}, s->s3={1:0}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={4294967290:7}, blastFlag=1, init=1, ret=11, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={4294967290:7}, blastFlag=1, init=1, ret=11, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=11, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=11, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=11, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=11, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=11, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=11, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=11, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=11, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND TRUE s->state == 4384 [L1318] ret = __VERIFIER_nondet_int() [L1319] COND TRUE blastFlag == 1 [L1320] blastFlag = 2 VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1324] COND FALSE !(ret <= 0) [L1329] s->hit VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->hit=0, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1329] COND FALSE !(s->hit) [L1332] s->state = 4400 VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1334] s->init_num = 0 VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={4294967290:7}, (s->s3)->tmp.reuse_message=4294967323, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->s3={1:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND TRUE s->state == 4400 [L1338] EXPR s->s3 [L1338] EXPR (s->s3)->tmp.new_cipher [L1338] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={4294967290:7}, ((s->s3)->tmp.new_cipher)->algorithms=4294967334, (s->s3)->tmp.new_cipher={4294967314:2}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->s3={1:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1338] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 2 [L1343] blastFlag = 3 VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1347] COND FALSE !(ret <= 0) VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1353] s->state = 4416 [L1354] s->init_num = 0 VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={4294967290:7}, (s->s3)->tmp.reuse_message=4294967323, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->s3={1:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1166] COND TRUE s->state == 4416 [L1358] ret = __VERIFIER_nondet_int() [L1359] COND TRUE blastFlag == 3 [L1360] blastFlag = 4 VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1364] COND FALSE !(ret <= 0) [L1369] s->state = 4432 [L1370] s->init_num = 0 VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1371] COND FALSE !(! tmp___6) VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={4294967290:7}, (s->s3)->tmp.reuse_message=4294967323, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->s3={1:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1172] COND TRUE s->state == 4432 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 4 VAL [={4294967290:7}, blastFlag=4, init=1, ret=2, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1643] __VERIFIER_error() VAL [={4294967290:7}, blastFlag=4, init=1, ret=2, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 167 locations, 1 error locations. UNSAFE Result, 9.7s OverallTime, 18 OverallIterations, 6 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3615 SDtfs, 1985 SDslu, 4743 SDs, 0 SdLazy, 2894 SolverSat, 145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 13 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=717occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 1255 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1380 NumberOfCodeBlocks, 1380 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1245 ConstructedInterpolants, 0 QuantifiedInterpolants, 274211 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 863/863 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...