/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:24:33,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:24:33,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:24:33,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:24:33,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:24:33,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:24:33,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:24:33,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:24:33,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:24:33,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:24:33,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:24:33,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:24:33,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:24:33,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:24:33,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:24:33,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:24:33,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:24:33,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:24:33,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:24:33,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:24:33,495 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:24:33,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:24:33,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:24:33,497 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:24:33,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:24:33,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:24:33,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:24:33,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:24:33,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:24:33,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:24:33,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:24:33,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:24:33,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:24:33,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:24:33,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:24:33,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:24:33,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:24:33,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:24:33,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:24:33,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:24:33,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:24:33,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:24:33,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 15:24:33,548 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:24:33,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:24:33,549 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:24:33,549 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:24:33,550 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:24:33,550 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:24:33,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:24:33,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:24:33,550 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:24:33,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:24:33,551 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:24:33,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:24:33,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:24:33,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:24:33,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:24:33,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:24:33,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:24:33,552 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:24:33,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:24:33,552 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:24:33,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:24:33,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:24:33,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:24:33,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:24:33,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:24:33,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:24:33,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:24:33,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:24:33,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:24:33,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:24:33,554 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:24:33,554 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:24:33,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:24:33,554 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 15:24:33,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:24:33,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:24:33,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:24:33,760 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:24:33,761 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:24:33,762 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-1.c [2022-04-27 15:24:33,807 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785d05362/9bed9977646e42ea88cc283343a7dd79/FLAG812e04130 [2022-04-27 15:24:34,253 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:24:34,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-1.c [2022-04-27 15:24:34,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785d05362/9bed9977646e42ea88cc283343a7dd79/FLAG812e04130 [2022-04-27 15:24:34,293 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785d05362/9bed9977646e42ea88cc283343a7dd79 [2022-04-27 15:24:34,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:24:34,296 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:24:34,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:24:34,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:24:34,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:24:34,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:24:34" (1/1) ... [2022-04-27 15:24:34,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59fc6fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:34, skipping insertion in model container [2022-04-27 15:24:34,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:24:34" (1/1) ... [2022-04-27 15:24:34,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:24:34,369 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:24:34,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-1.c[65397,65410] [2022-04-27 15:24:34,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:24:34,676 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:24:34,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-1.c[65397,65410] [2022-04-27 15:24:34,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:24:34,820 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:24:34,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:34 WrapperNode [2022-04-27 15:24:34,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:24:34,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:24:34,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:24:34,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:24:34,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:34" (1/1) ... [2022-04-27 15:24:34,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:34" (1/1) ... [2022-04-27 15:24:34,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:34" (1/1) ... [2022-04-27 15:24:34,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:34" (1/1) ... [2022-04-27 15:24:34,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:34" (1/1) ... [2022-04-27 15:24:34,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:34" (1/1) ... [2022-04-27 15:24:34,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:34" (1/1) ... [2022-04-27 15:24:34,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:24:34,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:24:34,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:24:34,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:24:34,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:34" (1/1) ... [2022-04-27 15:24:34,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:24:34,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:24:34,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 15:24:34,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 15:24:35,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:24:35,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:24:35,000 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:24:35,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-27 15:24:35,002 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-27 15:24:35,002 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:24:35,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-27 15:24:35,003 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-27 15:24:35,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-27 15:24:35,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-27 15:24:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:24:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:24:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:24:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:24:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-27 15:24:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-27 15:24:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:24:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-27 15:24:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-27 15:24:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-27 15:24:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-27 15:24:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-27 15:24:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-27 15:24:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-27 15:24:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-27 15:24:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-27 15:24:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:24:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-27 15:24:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:24:35,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-27 15:24:35,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:24:35,005 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-27 15:24:35,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-27 15:24:35,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:24:35,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:24:35,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:24:35,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-27 15:24:35,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-27 15:24:35,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-27 15:24:35,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-27 15:24:35,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:24:35,172 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:24:35,174 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:24:36,777 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-27 15:24:37,162 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-27 15:24:37,163 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-27 15:24:37,171 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:24:37,177 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:24:37,177 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:24:37,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:24:37 BoogieIcfgContainer [2022-04-27 15:24:37,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:24:37,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:24:37,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:24:37,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:24:37,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:24:34" (1/3) ... [2022-04-27 15:24:37,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@849c940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:24:37, skipping insertion in model container [2022-04-27 15:24:37,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:34" (2/3) ... [2022-04-27 15:24:37,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@849c940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:24:37, skipping insertion in model container [2022-04-27 15:24:37,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:24:37" (3/3) ... [2022-04-27 15:24:37,184 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.c [2022-04-27 15:24:37,193 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:24:37,193 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:24:37,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:24:37,235 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70b0e670, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2a687c90 [2022-04-27 15:24:37,235 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:24:37,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:24:37,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:24:37,252 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:24:37,253 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:24:37,253 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:24:37,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:24:37,258 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-27 15:24:37,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:24:37,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943579004] [2022-04-27 15:24:37,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:24:37,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:24:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:24:37,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:24:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:24:37,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-27 15:24:37,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-27 15:24:37,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-27 15:24:37,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:24:37,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-27 15:24:37,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-27 15:24:37,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-27 15:24:37,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-27 15:24:37,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {141#true} is VALID [2022-04-27 15:24:37,778 INFO L272 TraceCheckUtils]: 6: Hoare triple {141#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {141#true} is VALID [2022-04-27 15:24:37,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:37,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:37,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:37,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:37,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:37,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {147#(= 12292 |ssl3_connect_#t~mem49|)} is VALID [2022-04-27 15:24:37,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {147#(= 12292 |ssl3_connect_#t~mem49|)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:37,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {142#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:37,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {142#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:37,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {142#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:37,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {142#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:37,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {142#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:37,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {142#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:37,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {142#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:37,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {142#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:37,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {142#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:37,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {142#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:37,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {142#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:37,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {142#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:37,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-27 15:24:37,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {142#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142#false} is VALID [2022-04-27 15:24:37,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 4 == ~blastFlag~0; {142#false} is VALID [2022-04-27 15:24:37,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-27 15:24:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:24:37,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:24:37,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943579004] [2022-04-27 15:24:37,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943579004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:24:37,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:24:37,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:24:37,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231315084] [2022-04-27 15:24:37,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:24:37,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 15:24:37,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:24:37,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:37,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:24:37,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:24:37,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:24:37,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:24:37,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:24:37,863 INFO L87 Difference]: Start difference. First operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:39,902 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:24:40,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:24:40,934 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-27 15:24:40,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:24:40,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 15:24:40,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:24:40,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-27 15:24:40,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:40,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-27 15:24:40,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-27 15:24:41,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:24:41,280 INFO L225 Difference]: With dead ends: 267 [2022-04-27 15:24:41,280 INFO L226 Difference]: Without dead ends: 122 [2022-04-27 15:24:41,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:24:41,285 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:24:41,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 555 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 320 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:24:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-27 15:24:41,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-27 15:24:41,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:24:41,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:41,316 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:41,317 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:41,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:24:41,322 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-27 15:24:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-27 15:24:41,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:24:41,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:24:41,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-27 15:24:41,324 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-27 15:24:41,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:24:41,329 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-27 15:24:41,329 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-27 15:24:41,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:24:41,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:24:41,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:24:41,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:24:41,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:41,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-27 15:24:41,336 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-27 15:24:41,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:24:41,336 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-27 15:24:41,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-27 15:24:41,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 15:24:41,337 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:24:41,338 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-27 15:24:41,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:24:41,338 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:24:41,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:24:41,338 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-27 15:24:41,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:24:41,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389775626] [2022-04-27 15:24:41,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:24:41,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:24:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:24:41,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:24:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:24:41,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {861#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {855#true} is VALID [2022-04-27 15:24:41,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {855#true} assume true; {855#true} is VALID [2022-04-27 15:24:41,581 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {855#true} {855#true} #593#return; {855#true} is VALID [2022-04-27 15:24:41,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {855#true} call ULTIMATE.init(); {861#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:24:41,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {861#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {855#true} is VALID [2022-04-27 15:24:41,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#true} assume true; {855#true} is VALID [2022-04-27 15:24:41,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#true} {855#true} #593#return; {855#true} is VALID [2022-04-27 15:24:41,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#true} call #t~ret158 := main(); {855#true} is VALID [2022-04-27 15:24:41,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {855#true} is VALID [2022-04-27 15:24:41,582 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {855#true} is VALID [2022-04-27 15:24:41,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {855#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !false; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem49;havoc #t~mem49; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 36 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !false; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,596 INFO L290 TraceCheckUtils]: 35: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem62;havoc #t~mem62; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,598 INFO L290 TraceCheckUtils]: 41: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:24:41,598 INFO L290 TraceCheckUtils]: 42: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {856#false} is VALID [2022-04-27 15:24:41,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {856#false} assume !false; {856#false} is VALID [2022-04-27 15:24:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 15:24:41,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:24:41,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389775626] [2022-04-27 15:24:41,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389775626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:24:41,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:24:41,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:24:41,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699446354] [2022-04-27 15:24:41,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:24:41,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-27 15:24:41,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:24:41,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:41,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:24:41,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:24:41,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:24:41,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:24:41,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:24:41,647 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:43,666 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:24:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:24:44,232 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2022-04-27 15:24:44,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:24:44,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-27 15:24:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:24:44,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-27 15:24:44,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-27 15:24:44,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-27 15:24:44,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:24:44,588 INFO L225 Difference]: With dead ends: 327 [2022-04-27 15:24:44,589 INFO L226 Difference]: Without dead ends: 222 [2022-04-27 15:24:44,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:24:44,590 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 124 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:24:44,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 319 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 15:24:44,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-27 15:24:44,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-04-27 15:24:44,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:24:44,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:44,600 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:44,600 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:44,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:24:44,606 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-27 15:24:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-27 15:24:44,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:24:44,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:24:44,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-27 15:24:44,608 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-27 15:24:44,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:24:44,614 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-27 15:24:44,614 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-27 15:24:44,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:24:44,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:24:44,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:24:44,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:24:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:44,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2022-04-27 15:24:44,621 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 44 [2022-04-27 15:24:44,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:24:44,621 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2022-04-27 15:24:44,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-27 15:24:44,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 15:24:44,622 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:24:44,622 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:24:44,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:24:44,622 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:24:44,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:24:44,623 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 1 times [2022-04-27 15:24:44,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:24:44,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463465751] [2022-04-27 15:24:44,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:24:44,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:24:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:24:44,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:24:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:24:44,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {1959#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {1952#true} is VALID [2022-04-27 15:24:44,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {1952#true} assume true; {1952#true} is VALID [2022-04-27 15:24:44,851 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1952#true} {1952#true} #593#return; {1952#true} is VALID [2022-04-27 15:24:44,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {1952#true} call ULTIMATE.init(); {1959#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:24:44,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {1959#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {1952#true} is VALID [2022-04-27 15:24:44,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {1952#true} assume true; {1952#true} is VALID [2022-04-27 15:24:44,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1952#true} {1952#true} #593#return; {1952#true} is VALID [2022-04-27 15:24:44,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {1952#true} call #t~ret158 := main(); {1952#true} is VALID [2022-04-27 15:24:44,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {1952#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {1952#true} is VALID [2022-04-27 15:24:44,853 INFO L272 TraceCheckUtils]: 6: Hoare triple {1952#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1952#true} is VALID [2022-04-27 15:24:44,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {1952#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:24:44,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {1952#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {1952#true} is VALID [2022-04-27 15:24:44,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {1952#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {1952#true} is VALID [2022-04-27 15:24:44,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {1952#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1952#true} is VALID [2022-04-27 15:24:44,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {1952#true} assume !false; {1952#true} is VALID [2022-04-27 15:24:44,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {1952#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:24:44,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {1952#true} assume 12292 == #t~mem49;havoc #t~mem49; {1952#true} is VALID [2022-04-27 15:24:44,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {1952#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {1952#true} is VALID [2022-04-27 15:24:44,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {1952#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:24:44,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {1952#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {1952#true} is VALID [2022-04-27 15:24:44,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {1952#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:24:44,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {1952#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:24:44,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {1952#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {1952#true} is VALID [2022-04-27 15:24:44,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {1952#true} assume !(0 == ~tmp___4~0); {1952#true} is VALID [2022-04-27 15:24:44,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {1952#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:24:44,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {1952#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {1952#true} is VALID [2022-04-27 15:24:44,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {1952#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1952#true} is VALID [2022-04-27 15:24:44,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {1952#true} ~skip~0 := 0; {1952#true} is VALID [2022-04-27 15:24:44,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {1952#true} assume !false; {1952#true} is VALID [2022-04-27 15:24:44,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {1952#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:24:44,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {1952#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:24:44,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {1952#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:24:44,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {1952#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:24:44,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {1952#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:24:44,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {1952#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:24:44,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {1952#true} assume 4368 == #t~mem54;havoc #t~mem54; {1952#true} is VALID [2022-04-27 15:24:44,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {1952#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {1952#true} is VALID [2022-04-27 15:24:44,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {1952#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {1952#true} is VALID [2022-04-27 15:24:44,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {1952#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:44,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:44,874 INFO L290 TraceCheckUtils]: 37: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:44,874 INFO L290 TraceCheckUtils]: 38: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:44,874 INFO L290 TraceCheckUtils]: 39: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:44,875 INFO L290 TraceCheckUtils]: 40: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:44,876 INFO L290 TraceCheckUtils]: 41: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:44,876 INFO L290 TraceCheckUtils]: 42: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:44,876 INFO L290 TraceCheckUtils]: 43: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:44,877 INFO L290 TraceCheckUtils]: 44: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:44,877 INFO L290 TraceCheckUtils]: 45: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:44,877 INFO L290 TraceCheckUtils]: 46: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:44,878 INFO L290 TraceCheckUtils]: 47: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:44,878 INFO L290 TraceCheckUtils]: 48: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1958#(= |ssl3_connect_#t~mem56| 4384)} is VALID [2022-04-27 15:24:44,878 INFO L290 TraceCheckUtils]: 49: Hoare triple {1958#(= |ssl3_connect_#t~mem56| 4384)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-27 15:24:44,878 INFO L290 TraceCheckUtils]: 50: Hoare triple {1953#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-27 15:24:44,879 INFO L290 TraceCheckUtils]: 51: Hoare triple {1953#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-27 15:24:44,879 INFO L290 TraceCheckUtils]: 52: Hoare triple {1953#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-27 15:24:44,879 INFO L290 TraceCheckUtils]: 53: Hoare triple {1953#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-27 15:24:44,879 INFO L290 TraceCheckUtils]: 54: Hoare triple {1953#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-27 15:24:44,879 INFO L290 TraceCheckUtils]: 55: Hoare triple {1953#false} assume 4432 == #t~mem62;havoc #t~mem62; {1953#false} is VALID [2022-04-27 15:24:44,879 INFO L290 TraceCheckUtils]: 56: Hoare triple {1953#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {1953#false} is VALID [2022-04-27 15:24:44,879 INFO L290 TraceCheckUtils]: 57: Hoare triple {1953#false} assume 4 == ~blastFlag~0; {1953#false} is VALID [2022-04-27 15:24:44,879 INFO L290 TraceCheckUtils]: 58: Hoare triple {1953#false} assume !false; {1953#false} is VALID [2022-04-27 15:24:44,881 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 15:24:44,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:24:44,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463465751] [2022-04-27 15:24:44,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463465751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:24:44,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:24:44,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:24:44,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874207570] [2022-04-27 15:24:44,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:24:44,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-27 15:24:44,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:24:44,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:44,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:24:44,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:24:44,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:24:44,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:24:44,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:24:44,929 INFO L87 Difference]: Start difference. First operand 222 states and 326 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:46,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:24:47,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:24:47,987 INFO L93 Difference]: Finished difference Result 363 states and 539 transitions. [2022-04-27 15:24:47,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:24:47,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-27 15:24:47,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:24:47,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-27 15:24:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-27 15:24:47,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 388 transitions. [2022-04-27 15:24:48,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:24:48,262 INFO L225 Difference]: With dead ends: 363 [2022-04-27 15:24:48,262 INFO L226 Difference]: Without dead ends: 258 [2022-04-27 15:24:48,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:24:48,266 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 33 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:24:48,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 486 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 360 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:24:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-04-27 15:24:48,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 240. [2022-04-27 15:24:48,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:24:48,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:48,280 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:48,281 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:48,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:24:48,286 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2022-04-27 15:24:48,287 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2022-04-27 15:24:48,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:24:48,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:24:48,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 258 states. [2022-04-27 15:24:48,289 INFO L87 Difference]: Start difference. First operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 258 states. [2022-04-27 15:24:48,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:24:48,294 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2022-04-27 15:24:48,294 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2022-04-27 15:24:48,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:24:48,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:24:48,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:24:48,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:24:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 356 transitions. [2022-04-27 15:24:48,301 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 356 transitions. Word has length 59 [2022-04-27 15:24:48,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:24:48,301 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 356 transitions. [2022-04-27 15:24:48,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2022-04-27 15:24:48,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-27 15:24:48,302 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:24:48,302 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:24:48,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:24:48,302 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:24:48,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:24:48,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 2 times [2022-04-27 15:24:48,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:24:48,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784219995] [2022-04-27 15:24:48,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:24:48,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:24:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:24:48,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:24:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:24:48,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {3191#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {3184#true} is VALID [2022-04-27 15:24:48,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-27 15:24:48,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3184#true} {3184#true} #593#return; {3184#true} is VALID [2022-04-27 15:24:48,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {3184#true} call ULTIMATE.init(); {3191#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:24:48,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {3191#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {3184#true} is VALID [2022-04-27 15:24:48,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-27 15:24:48,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3184#true} {3184#true} #593#return; {3184#true} is VALID [2022-04-27 15:24:48,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {3184#true} call #t~ret158 := main(); {3184#true} is VALID [2022-04-27 15:24:48,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {3184#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {3184#true} is VALID [2022-04-27 15:24:48,498 INFO L272 TraceCheckUtils]: 6: Hoare triple {3184#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {3184#true} is VALID [2022-04-27 15:24:48,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {3184#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3184#true} is VALID [2022-04-27 15:24:48,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {3184#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {3184#true} is VALID [2022-04-27 15:24:48,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {3184#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {3184#true} is VALID [2022-04-27 15:24:48,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {3184#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3184#true} is VALID [2022-04-27 15:24:48,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {3184#true} assume !false; {3184#true} is VALID [2022-04-27 15:24:48,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {3184#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3184#true} is VALID [2022-04-27 15:24:48,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {3184#true} assume 12292 == #t~mem49;havoc #t~mem49; {3184#true} is VALID [2022-04-27 15:24:48,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {3184#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {3184#true} is VALID [2022-04-27 15:24:48,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {3184#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {3184#true} is VALID [2022-04-27 15:24:48,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {3184#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3184#true} is VALID [2022-04-27 15:24:48,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {3184#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {3184#true} is VALID [2022-04-27 15:24:48,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {3184#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {3184#true} is VALID [2022-04-27 15:24:48,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {3184#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {3184#true} is VALID [2022-04-27 15:24:48,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {3184#true} assume !(0 == ~tmp___4~0); {3184#true} is VALID [2022-04-27 15:24:48,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {3184#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {3184#true} is VALID [2022-04-27 15:24:48,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {3184#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {3184#true} is VALID [2022-04-27 15:24:48,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {3184#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {3184#true} is VALID [2022-04-27 15:24:48,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {3184#true} ~skip~0 := 0; {3184#true} is VALID [2022-04-27 15:24:48,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {3184#true} assume !false; {3184#true} is VALID [2022-04-27 15:24:48,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {3184#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3184#true} is VALID [2022-04-27 15:24:48,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {3184#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3184#true} is VALID [2022-04-27 15:24:48,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {3184#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3184#true} is VALID [2022-04-27 15:24:48,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {3184#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3184#true} is VALID [2022-04-27 15:24:48,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {3184#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3184#true} is VALID [2022-04-27 15:24:48,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {3184#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3184#true} is VALID [2022-04-27 15:24:48,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {3184#true} assume 4368 == #t~mem54;havoc #t~mem54; {3184#true} is VALID [2022-04-27 15:24:48,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {3184#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {3184#true} is VALID [2022-04-27 15:24:48,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {3184#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {3184#true} is VALID [2022-04-27 15:24:48,502 INFO L290 TraceCheckUtils]: 35: Hoare triple {3184#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:48,502 INFO L290 TraceCheckUtils]: 36: Hoare triple {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:48,503 INFO L290 TraceCheckUtils]: 37: Hoare triple {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:48,503 INFO L290 TraceCheckUtils]: 38: Hoare triple {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:48,503 INFO L290 TraceCheckUtils]: 39: Hoare triple {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:48,504 INFO L290 TraceCheckUtils]: 40: Hoare triple {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:48,504 INFO L290 TraceCheckUtils]: 41: Hoare triple {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3190#(= |ssl3_connect_#t~mem49| 4384)} is VALID [2022-04-27 15:24:48,504 INFO L290 TraceCheckUtils]: 42: Hoare triple {3190#(= |ssl3_connect_#t~mem49| 4384)} assume 12292 == #t~mem49;havoc #t~mem49; {3185#false} is VALID [2022-04-27 15:24:48,504 INFO L290 TraceCheckUtils]: 43: Hoare triple {3185#false} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {3185#false} is VALID [2022-04-27 15:24:48,505 INFO L290 TraceCheckUtils]: 44: Hoare triple {3185#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {3185#false} is VALID [2022-04-27 15:24:48,505 INFO L290 TraceCheckUtils]: 45: Hoare triple {3185#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3185#false} is VALID [2022-04-27 15:24:48,505 INFO L290 TraceCheckUtils]: 46: Hoare triple {3185#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {3185#false} is VALID [2022-04-27 15:24:48,505 INFO L290 TraceCheckUtils]: 47: Hoare triple {3185#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {3185#false} is VALID [2022-04-27 15:24:48,505 INFO L290 TraceCheckUtils]: 48: Hoare triple {3185#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {3185#false} is VALID [2022-04-27 15:24:48,505 INFO L290 TraceCheckUtils]: 49: Hoare triple {3185#false} assume !(0 == ~tmp___4~0); {3185#false} is VALID [2022-04-27 15:24:48,505 INFO L290 TraceCheckUtils]: 50: Hoare triple {3185#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {3185#false} is VALID [2022-04-27 15:24:48,505 INFO L290 TraceCheckUtils]: 51: Hoare triple {3185#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {3185#false} is VALID [2022-04-27 15:24:48,505 INFO L290 TraceCheckUtils]: 52: Hoare triple {3185#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {3185#false} is VALID [2022-04-27 15:24:48,505 INFO L290 TraceCheckUtils]: 53: Hoare triple {3185#false} ~skip~0 := 0; {3185#false} is VALID [2022-04-27 15:24:48,505 INFO L290 TraceCheckUtils]: 54: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-04-27 15:24:48,505 INFO L290 TraceCheckUtils]: 55: Hoare triple {3185#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-27 15:24:48,506 INFO L290 TraceCheckUtils]: 56: Hoare triple {3185#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-27 15:24:48,508 INFO L290 TraceCheckUtils]: 57: Hoare triple {3185#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-27 15:24:48,508 INFO L290 TraceCheckUtils]: 58: Hoare triple {3185#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-27 15:24:48,508 INFO L290 TraceCheckUtils]: 59: Hoare triple {3185#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-27 15:24:48,509 INFO L290 TraceCheckUtils]: 60: Hoare triple {3185#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-27 15:24:48,509 INFO L290 TraceCheckUtils]: 61: Hoare triple {3185#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-27 15:24:48,509 INFO L290 TraceCheckUtils]: 62: Hoare triple {3185#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-27 15:24:48,509 INFO L290 TraceCheckUtils]: 63: Hoare triple {3185#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-27 15:24:48,509 INFO L290 TraceCheckUtils]: 64: Hoare triple {3185#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-27 15:24:48,509 INFO L290 TraceCheckUtils]: 65: Hoare triple {3185#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-27 15:24:48,509 INFO L290 TraceCheckUtils]: 66: Hoare triple {3185#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-27 15:24:48,510 INFO L290 TraceCheckUtils]: 67: Hoare triple {3185#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-27 15:24:48,510 INFO L290 TraceCheckUtils]: 68: Hoare triple {3185#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-27 15:24:48,510 INFO L290 TraceCheckUtils]: 69: Hoare triple {3185#false} assume 4432 == #t~mem62;havoc #t~mem62; {3185#false} is VALID [2022-04-27 15:24:48,511 INFO L290 TraceCheckUtils]: 70: Hoare triple {3185#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {3185#false} is VALID [2022-04-27 15:24:48,511 INFO L290 TraceCheckUtils]: 71: Hoare triple {3185#false} assume 4 == ~blastFlag~0; {3185#false} is VALID [2022-04-27 15:24:48,511 INFO L290 TraceCheckUtils]: 72: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-04-27 15:24:48,511 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 15:24:48,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:24:48,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784219995] [2022-04-27 15:24:48,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784219995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:24:48,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:24:48,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:24:48,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743207710] [2022-04-27 15:24:48,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:24:48,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-27 15:24:48,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:24:48,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:48,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:24:48,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:24:48,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:24:48,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:24:48,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:24:48,572 INFO L87 Difference]: Start difference. First operand 240 states and 356 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:50,610 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:24:51,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:24:51,518 INFO L93 Difference]: Finished difference Result 380 states and 567 transitions. [2022-04-27 15:24:51,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:24:51,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-27 15:24:51,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:24:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-27 15:24:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-27 15:24:51,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 386 transitions. [2022-04-27 15:24:51,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 386 edges. 386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:24:51,825 INFO L225 Difference]: With dead ends: 380 [2022-04-27 15:24:51,825 INFO L226 Difference]: Without dead ends: 257 [2022-04-27 15:24:51,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:24:51,826 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 39 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:24:51,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 486 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 353 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:24:51,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-27 15:24:51,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 240. [2022-04-27 15:24:51,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:24:51,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:51,843 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:51,843 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:51,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:24:51,849 INFO L93 Difference]: Finished difference Result 257 states and 378 transitions. [2022-04-27 15:24:51,849 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2022-04-27 15:24:51,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:24:51,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:24:51,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-27 15:24:51,851 INFO L87 Difference]: Start difference. First operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-27 15:24:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:24:51,855 INFO L93 Difference]: Finished difference Result 257 states and 378 transitions. [2022-04-27 15:24:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2022-04-27 15:24:51,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:24:51,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:24:51,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:24:51,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:24:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 355 transitions. [2022-04-27 15:24:51,860 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 355 transitions. Word has length 73 [2022-04-27 15:24:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:24:51,860 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 355 transitions. [2022-04-27 15:24:51,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 355 transitions. [2022-04-27 15:24:51,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-27 15:24:51,861 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:24:51,861 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:24:51,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:24:51,861 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:24:51,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:24:51,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 1 times [2022-04-27 15:24:51,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:24:51,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047560937] [2022-04-27 15:24:51,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:24:51,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:24:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:24:52,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:24:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:24:52,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {4438#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {4431#true} is VALID [2022-04-27 15:24:52,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {4431#true} assume true; {4431#true} is VALID [2022-04-27 15:24:52,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4431#true} {4431#true} #593#return; {4431#true} is VALID [2022-04-27 15:24:52,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {4431#true} call ULTIMATE.init(); {4438#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:24:52,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {4438#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {4431#true} is VALID [2022-04-27 15:24:52,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {4431#true} assume true; {4431#true} is VALID [2022-04-27 15:24:52,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4431#true} {4431#true} #593#return; {4431#true} is VALID [2022-04-27 15:24:52,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {4431#true} call #t~ret158 := main(); {4431#true} is VALID [2022-04-27 15:24:52,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {4431#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {4431#true} is VALID [2022-04-27 15:24:52,051 INFO L272 TraceCheckUtils]: 6: Hoare triple {4431#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4431#true} is VALID [2022-04-27 15:24:52,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {4431#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4431#true} is VALID [2022-04-27 15:24:52,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {4431#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {4431#true} is VALID [2022-04-27 15:24:52,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {4431#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {4431#true} is VALID [2022-04-27 15:24:52,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {4431#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4431#true} is VALID [2022-04-27 15:24:52,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {4431#true} assume !false; {4431#true} is VALID [2022-04-27 15:24:52,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {4431#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4431#true} is VALID [2022-04-27 15:24:52,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {4431#true} assume 12292 == #t~mem49;havoc #t~mem49; {4431#true} is VALID [2022-04-27 15:24:52,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {4431#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {4431#true} is VALID [2022-04-27 15:24:52,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {4431#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4431#true} is VALID [2022-04-27 15:24:52,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {4431#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4431#true} is VALID [2022-04-27 15:24:52,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {4431#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4431#true} is VALID [2022-04-27 15:24:52,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {4431#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4431#true} is VALID [2022-04-27 15:24:52,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {4431#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4431#true} is VALID [2022-04-27 15:24:52,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {4431#true} assume !(0 == ~tmp___4~0); {4431#true} is VALID [2022-04-27 15:24:52,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {4431#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4431#true} is VALID [2022-04-27 15:24:52,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {4431#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4431#true} is VALID [2022-04-27 15:24:52,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {4431#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4431#true} is VALID [2022-04-27 15:24:52,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {4431#true} ~skip~0 := 0; {4431#true} is VALID [2022-04-27 15:24:52,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {4431#true} assume !false; {4431#true} is VALID [2022-04-27 15:24:52,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {4431#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4431#true} is VALID [2022-04-27 15:24:52,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {4431#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4431#true} is VALID [2022-04-27 15:24:52,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {4431#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4431#true} is VALID [2022-04-27 15:24:52,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {4431#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4431#true} is VALID [2022-04-27 15:24:52,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {4431#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4431#true} is VALID [2022-04-27 15:24:52,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {4431#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4431#true} is VALID [2022-04-27 15:24:52,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {4431#true} assume 4368 == #t~mem54;havoc #t~mem54; {4431#true} is VALID [2022-04-27 15:24:52,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {4431#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {4431#true} is VALID [2022-04-27 15:24:52,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {4431#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4431#true} is VALID [2022-04-27 15:24:52,061 INFO L290 TraceCheckUtils]: 35: Hoare triple {4431#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:24:52,061 INFO L290 TraceCheckUtils]: 36: Hoare triple {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:24:52,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:24:52,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:24:52,062 INFO L290 TraceCheckUtils]: 39: Hoare triple {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:24:52,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:24:52,063 INFO L290 TraceCheckUtils]: 41: Hoare triple {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:24:52,063 INFO L290 TraceCheckUtils]: 42: Hoare triple {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4437#(not (= |ssl3_connect_#t~mem50| 16384))} is VALID [2022-04-27 15:24:52,064 INFO L290 TraceCheckUtils]: 43: Hoare triple {4437#(not (= |ssl3_connect_#t~mem50| 16384))} assume 16384 == #t~mem50;havoc #t~mem50; {4432#false} is VALID [2022-04-27 15:24:52,064 INFO L290 TraceCheckUtils]: 44: Hoare triple {4432#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4432#false} is VALID [2022-04-27 15:24:52,064 INFO L290 TraceCheckUtils]: 45: Hoare triple {4432#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4432#false} is VALID [2022-04-27 15:24:52,064 INFO L290 TraceCheckUtils]: 46: Hoare triple {4432#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4432#false} is VALID [2022-04-27 15:24:52,064 INFO L290 TraceCheckUtils]: 47: Hoare triple {4432#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4432#false} is VALID [2022-04-27 15:24:52,064 INFO L290 TraceCheckUtils]: 48: Hoare triple {4432#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4432#false} is VALID [2022-04-27 15:24:52,064 INFO L290 TraceCheckUtils]: 49: Hoare triple {4432#false} assume !(0 == ~tmp___4~0); {4432#false} is VALID [2022-04-27 15:24:52,064 INFO L290 TraceCheckUtils]: 50: Hoare triple {4432#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4432#false} is VALID [2022-04-27 15:24:52,064 INFO L290 TraceCheckUtils]: 51: Hoare triple {4432#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4432#false} is VALID [2022-04-27 15:24:52,065 INFO L290 TraceCheckUtils]: 52: Hoare triple {4432#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4432#false} is VALID [2022-04-27 15:24:52,065 INFO L290 TraceCheckUtils]: 53: Hoare triple {4432#false} ~skip~0 := 0; {4432#false} is VALID [2022-04-27 15:24:52,065 INFO L290 TraceCheckUtils]: 54: Hoare triple {4432#false} assume !false; {4432#false} is VALID [2022-04-27 15:24:52,065 INFO L290 TraceCheckUtils]: 55: Hoare triple {4432#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-27 15:24:52,065 INFO L290 TraceCheckUtils]: 56: Hoare triple {4432#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-27 15:24:52,065 INFO L290 TraceCheckUtils]: 57: Hoare triple {4432#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-27 15:24:52,065 INFO L290 TraceCheckUtils]: 58: Hoare triple {4432#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-27 15:24:52,065 INFO L290 TraceCheckUtils]: 59: Hoare triple {4432#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-27 15:24:52,065 INFO L290 TraceCheckUtils]: 60: Hoare triple {4432#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-27 15:24:52,065 INFO L290 TraceCheckUtils]: 61: Hoare triple {4432#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-27 15:24:52,065 INFO L290 TraceCheckUtils]: 62: Hoare triple {4432#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-27 15:24:52,065 INFO L290 TraceCheckUtils]: 63: Hoare triple {4432#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-27 15:24:52,065 INFO L290 TraceCheckUtils]: 64: Hoare triple {4432#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-27 15:24:52,065 INFO L290 TraceCheckUtils]: 65: Hoare triple {4432#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-27 15:24:52,066 INFO L290 TraceCheckUtils]: 66: Hoare triple {4432#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-27 15:24:52,066 INFO L290 TraceCheckUtils]: 67: Hoare triple {4432#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-27 15:24:52,066 INFO L290 TraceCheckUtils]: 68: Hoare triple {4432#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-27 15:24:52,066 INFO L290 TraceCheckUtils]: 69: Hoare triple {4432#false} assume 4432 == #t~mem62;havoc #t~mem62; {4432#false} is VALID [2022-04-27 15:24:52,066 INFO L290 TraceCheckUtils]: 70: Hoare triple {4432#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {4432#false} is VALID [2022-04-27 15:24:52,066 INFO L290 TraceCheckUtils]: 71: Hoare triple {4432#false} assume 4 == ~blastFlag~0; {4432#false} is VALID [2022-04-27 15:24:52,066 INFO L290 TraceCheckUtils]: 72: Hoare triple {4432#false} assume !false; {4432#false} is VALID [2022-04-27 15:24:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 15:24:52,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:24:52,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047560937] [2022-04-27 15:24:52,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047560937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:24:52,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:24:52,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:24:52,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850865378] [2022-04-27 15:24:52,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:24:52,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-27 15:24:52,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:24:52,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:52,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:24:52,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:24:52,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:24:52,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:24:52,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:24:52,121 INFO L87 Difference]: Start difference. First operand 240 states and 355 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:54,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:24:55,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:24:55,089 INFO L93 Difference]: Finished difference Result 647 states and 966 transitions. [2022-04-27 15:24:55,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:24:55,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-27 15:24:55,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:24:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-27 15:24:55,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-27 15:24:55,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-27 15:24:55,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:24:55,416 INFO L225 Difference]: With dead ends: 647 [2022-04-27 15:24:55,417 INFO L226 Difference]: Without dead ends: 423 [2022-04-27 15:24:55,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:24:55,423 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 119 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:24:55,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:24:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-04-27 15:24:55,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 264. [2022-04-27 15:24:55,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:24:55,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 423 states. Second operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:55,442 INFO L74 IsIncluded]: Start isIncluded. First operand 423 states. Second operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:55,443 INFO L87 Difference]: Start difference. First operand 423 states. Second operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:55,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:24:55,451 INFO L93 Difference]: Finished difference Result 423 states and 628 transitions. [2022-04-27 15:24:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 628 transitions. [2022-04-27 15:24:55,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:24:55,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:24:55,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 423 states. [2022-04-27 15:24:55,452 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 423 states. [2022-04-27 15:24:55,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:24:55,462 INFO L93 Difference]: Finished difference Result 423 states and 628 transitions. [2022-04-27 15:24:55,462 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 628 transitions. [2022-04-27 15:24:55,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:24:55,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:24:55,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:24:55,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:24:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 390 transitions. [2022-04-27 15:24:55,469 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 390 transitions. Word has length 73 [2022-04-27 15:24:55,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:24:55,469 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 390 transitions. [2022-04-27 15:24:55,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 390 transitions. [2022-04-27 15:24:55,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-27 15:24:55,470 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:24:55,470 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:24:55,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:24:55,470 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:24:55,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:24:55,470 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 1 times [2022-04-27 15:24:55,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:24:55,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065483151] [2022-04-27 15:24:55,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:24:55,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:24:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:24:55,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:24:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:24:55,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {6356#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {6349#true} is VALID [2022-04-27 15:24:55,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {6349#true} assume true; {6349#true} is VALID [2022-04-27 15:24:55,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6349#true} {6349#true} #593#return; {6349#true} is VALID [2022-04-27 15:24:55,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {6349#true} call ULTIMATE.init(); {6356#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:24:55,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {6356#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {6349#true} is VALID [2022-04-27 15:24:55,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {6349#true} assume true; {6349#true} is VALID [2022-04-27 15:24:55,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6349#true} {6349#true} #593#return; {6349#true} is VALID [2022-04-27 15:24:55,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {6349#true} call #t~ret158 := main(); {6349#true} is VALID [2022-04-27 15:24:55,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {6349#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {6349#true} is VALID [2022-04-27 15:24:55,638 INFO L272 TraceCheckUtils]: 6: Hoare triple {6349#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {6349#true} is VALID [2022-04-27 15:24:55,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {6349#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {6349#true} is VALID [2022-04-27 15:24:55,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {6349#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {6349#true} is VALID [2022-04-27 15:24:55,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {6349#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {6349#true} is VALID [2022-04-27 15:24:55,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {6349#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6349#true} is VALID [2022-04-27 15:24:55,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {6349#true} assume !false; {6349#true} is VALID [2022-04-27 15:24:55,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {6349#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6349#true} is VALID [2022-04-27 15:24:55,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {6349#true} assume 12292 == #t~mem49;havoc #t~mem49; {6349#true} is VALID [2022-04-27 15:24:55,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {6349#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {6349#true} is VALID [2022-04-27 15:24:55,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {6349#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {6349#true} is VALID [2022-04-27 15:24:55,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {6349#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6349#true} is VALID [2022-04-27 15:24:55,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {6349#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {6349#true} is VALID [2022-04-27 15:24:55,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {6349#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {6349#true} is VALID [2022-04-27 15:24:55,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {6349#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {6349#true} is VALID [2022-04-27 15:24:55,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {6349#true} assume !(0 == ~tmp___4~0); {6349#true} is VALID [2022-04-27 15:24:55,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {6349#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {6349#true} is VALID [2022-04-27 15:24:55,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {6349#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {6349#true} is VALID [2022-04-27 15:24:55,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {6349#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {6349#true} is VALID [2022-04-27 15:24:55,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {6349#true} ~skip~0 := 0; {6349#true} is VALID [2022-04-27 15:24:55,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {6349#true} assume !false; {6349#true} is VALID [2022-04-27 15:24:55,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {6349#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6349#true} is VALID [2022-04-27 15:24:55,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {6349#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6349#true} is VALID [2022-04-27 15:24:55,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {6349#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6349#true} is VALID [2022-04-27 15:24:55,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {6349#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6349#true} is VALID [2022-04-27 15:24:55,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {6349#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6349#true} is VALID [2022-04-27 15:24:55,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {6349#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6349#true} is VALID [2022-04-27 15:24:55,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {6349#true} assume 4368 == #t~mem54;havoc #t~mem54; {6349#true} is VALID [2022-04-27 15:24:55,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {6349#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {6349#true} is VALID [2022-04-27 15:24:55,642 INFO L290 TraceCheckUtils]: 34: Hoare triple {6349#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {6349#true} is VALID [2022-04-27 15:24:55,643 INFO L290 TraceCheckUtils]: 35: Hoare triple {6349#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:55,643 INFO L290 TraceCheckUtils]: 36: Hoare triple {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:55,644 INFO L290 TraceCheckUtils]: 37: Hoare triple {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:55,644 INFO L290 TraceCheckUtils]: 38: Hoare triple {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:55,644 INFO L290 TraceCheckUtils]: 39: Hoare triple {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:55,644 INFO L290 TraceCheckUtils]: 40: Hoare triple {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:55,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:55,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:55,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6355#(= |ssl3_connect_#t~mem51| 4384)} is VALID [2022-04-27 15:24:55,650 INFO L290 TraceCheckUtils]: 44: Hoare triple {6355#(= |ssl3_connect_#t~mem51| 4384)} assume 4096 == #t~mem51;havoc #t~mem51; {6350#false} is VALID [2022-04-27 15:24:55,650 INFO L290 TraceCheckUtils]: 45: Hoare triple {6350#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {6350#false} is VALID [2022-04-27 15:24:55,650 INFO L290 TraceCheckUtils]: 46: Hoare triple {6350#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6350#false} is VALID [2022-04-27 15:24:55,650 INFO L290 TraceCheckUtils]: 47: Hoare triple {6350#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {6350#false} is VALID [2022-04-27 15:24:55,650 INFO L290 TraceCheckUtils]: 48: Hoare triple {6350#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {6350#false} is VALID [2022-04-27 15:24:55,650 INFO L290 TraceCheckUtils]: 49: Hoare triple {6350#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {6350#false} is VALID [2022-04-27 15:24:55,650 INFO L290 TraceCheckUtils]: 50: Hoare triple {6350#false} assume !(0 == ~tmp___4~0); {6350#false} is VALID [2022-04-27 15:24:55,650 INFO L290 TraceCheckUtils]: 51: Hoare triple {6350#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {6350#false} is VALID [2022-04-27 15:24:55,650 INFO L290 TraceCheckUtils]: 52: Hoare triple {6350#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {6350#false} is VALID [2022-04-27 15:24:55,650 INFO L290 TraceCheckUtils]: 53: Hoare triple {6350#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {6350#false} is VALID [2022-04-27 15:24:55,651 INFO L290 TraceCheckUtils]: 54: Hoare triple {6350#false} ~skip~0 := 0; {6350#false} is VALID [2022-04-27 15:24:55,651 INFO L290 TraceCheckUtils]: 55: Hoare triple {6350#false} assume !false; {6350#false} is VALID [2022-04-27 15:24:55,651 INFO L290 TraceCheckUtils]: 56: Hoare triple {6350#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-27 15:24:55,651 INFO L290 TraceCheckUtils]: 57: Hoare triple {6350#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-27 15:24:55,651 INFO L290 TraceCheckUtils]: 58: Hoare triple {6350#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-27 15:24:55,651 INFO L290 TraceCheckUtils]: 59: Hoare triple {6350#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-27 15:24:55,651 INFO L290 TraceCheckUtils]: 60: Hoare triple {6350#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-27 15:24:55,651 INFO L290 TraceCheckUtils]: 61: Hoare triple {6350#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-27 15:24:55,651 INFO L290 TraceCheckUtils]: 62: Hoare triple {6350#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-27 15:24:55,651 INFO L290 TraceCheckUtils]: 63: Hoare triple {6350#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-27 15:24:55,651 INFO L290 TraceCheckUtils]: 64: Hoare triple {6350#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-27 15:24:55,651 INFO L290 TraceCheckUtils]: 65: Hoare triple {6350#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-27 15:24:55,651 INFO L290 TraceCheckUtils]: 66: Hoare triple {6350#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-27 15:24:55,651 INFO L290 TraceCheckUtils]: 67: Hoare triple {6350#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-27 15:24:55,652 INFO L290 TraceCheckUtils]: 68: Hoare triple {6350#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-27 15:24:55,652 INFO L290 TraceCheckUtils]: 69: Hoare triple {6350#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-27 15:24:55,652 INFO L290 TraceCheckUtils]: 70: Hoare triple {6350#false} assume 4432 == #t~mem62;havoc #t~mem62; {6350#false} is VALID [2022-04-27 15:24:55,652 INFO L290 TraceCheckUtils]: 71: Hoare triple {6350#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {6350#false} is VALID [2022-04-27 15:24:55,652 INFO L290 TraceCheckUtils]: 72: Hoare triple {6350#false} assume 4 == ~blastFlag~0; {6350#false} is VALID [2022-04-27 15:24:55,653 INFO L290 TraceCheckUtils]: 73: Hoare triple {6350#false} assume !false; {6350#false} is VALID [2022-04-27 15:24:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 15:24:55,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:24:55,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065483151] [2022-04-27 15:24:55,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065483151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:24:55,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:24:55,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:24:55,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312722494] [2022-04-27 15:24:55,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:24:55,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-27 15:24:55,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:24:55,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:55,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:24:55,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:24:55,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:24:55,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:24:55,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:24:55,710 INFO L87 Difference]: Start difference. First operand 264 states and 390 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:57,736 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:24:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:24:58,676 INFO L93 Difference]: Finished difference Result 416 states and 617 transitions. [2022-04-27 15:24:58,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:24:58,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-27 15:24:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:24:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-27 15:24:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-27 15:24:58,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 384 transitions. [2022-04-27 15:24:58,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:24:58,954 INFO L225 Difference]: With dead ends: 416 [2022-04-27 15:24:58,954 INFO L226 Difference]: Without dead ends: 281 [2022-04-27 15:24:58,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:24:58,955 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 35 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:24:58,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 482 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 351 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:24:58,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-27 15:24:58,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 264. [2022-04-27 15:24:58,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:24:58,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:58,960 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:58,961 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:58,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:24:58,965 INFO L93 Difference]: Finished difference Result 281 states and 412 transitions. [2022-04-27 15:24:58,965 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 412 transitions. [2022-04-27 15:24:58,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:24:58,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:24:58,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-27 15:24:58,966 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-27 15:24:58,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:24:58,971 INFO L93 Difference]: Finished difference Result 281 states and 412 transitions. [2022-04-27 15:24:58,971 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 412 transitions. [2022-04-27 15:24:58,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:24:58,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:24:58,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:24:58,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:24:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 389 transitions. [2022-04-27 15:24:58,976 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 389 transitions. Word has length 74 [2022-04-27 15:24:58,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:24:58,976 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 389 transitions. [2022-04-27 15:24:58,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 389 transitions. [2022-04-27 15:24:58,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-27 15:24:58,978 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:24:58,978 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:24:58,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:24:58,978 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:24:58,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:24:58,979 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 1 times [2022-04-27 15:24:58,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:24:58,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668409728] [2022-04-27 15:24:58,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:24:58,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:24:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:24:59,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:24:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:24:59,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {7716#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {7709#true} is VALID [2022-04-27 15:24:59,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {7709#true} assume true; {7709#true} is VALID [2022-04-27 15:24:59,148 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7709#true} {7709#true} #593#return; {7709#true} is VALID [2022-04-27 15:24:59,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {7709#true} call ULTIMATE.init(); {7716#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:24:59,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {7716#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {7709#true} is VALID [2022-04-27 15:24:59,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {7709#true} assume true; {7709#true} is VALID [2022-04-27 15:24:59,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7709#true} {7709#true} #593#return; {7709#true} is VALID [2022-04-27 15:24:59,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {7709#true} call #t~ret158 := main(); {7709#true} is VALID [2022-04-27 15:24:59,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {7709#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {7709#true} is VALID [2022-04-27 15:24:59,152 INFO L272 TraceCheckUtils]: 6: Hoare triple {7709#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7709#true} is VALID [2022-04-27 15:24:59,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {7709#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7709#true} is VALID [2022-04-27 15:24:59,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {7709#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {7709#true} is VALID [2022-04-27 15:24:59,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {7709#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {7709#true} is VALID [2022-04-27 15:24:59,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {7709#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7709#true} is VALID [2022-04-27 15:24:59,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {7709#true} assume !false; {7709#true} is VALID [2022-04-27 15:24:59,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {7709#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7709#true} is VALID [2022-04-27 15:24:59,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {7709#true} assume 12292 == #t~mem49;havoc #t~mem49; {7709#true} is VALID [2022-04-27 15:24:59,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {7709#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {7709#true} is VALID [2022-04-27 15:24:59,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {7709#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7709#true} is VALID [2022-04-27 15:24:59,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {7709#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7709#true} is VALID [2022-04-27 15:24:59,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {7709#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7709#true} is VALID [2022-04-27 15:24:59,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {7709#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7709#true} is VALID [2022-04-27 15:24:59,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {7709#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7709#true} is VALID [2022-04-27 15:24:59,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {7709#true} assume !(0 == ~tmp___4~0); {7709#true} is VALID [2022-04-27 15:24:59,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {7709#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7709#true} is VALID [2022-04-27 15:24:59,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {7709#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7709#true} is VALID [2022-04-27 15:24:59,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {7709#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7709#true} is VALID [2022-04-27 15:24:59,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {7709#true} ~skip~0 := 0; {7709#true} is VALID [2022-04-27 15:24:59,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {7709#true} assume !false; {7709#true} is VALID [2022-04-27 15:24:59,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {7709#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7709#true} is VALID [2022-04-27 15:24:59,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {7709#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7709#true} is VALID [2022-04-27 15:24:59,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {7709#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7709#true} is VALID [2022-04-27 15:24:59,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {7709#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7709#true} is VALID [2022-04-27 15:24:59,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {7709#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7709#true} is VALID [2022-04-27 15:24:59,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {7709#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7709#true} is VALID [2022-04-27 15:24:59,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {7709#true} assume 4368 == #t~mem54;havoc #t~mem54; {7709#true} is VALID [2022-04-27 15:24:59,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {7709#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {7709#true} is VALID [2022-04-27 15:24:59,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {7709#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7709#true} is VALID [2022-04-27 15:24:59,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {7709#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:59,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:59,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:59,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:59,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:59,158 INFO L290 TraceCheckUtils]: 40: Hoare triple {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:59,158 INFO L290 TraceCheckUtils]: 41: Hoare triple {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:59,158 INFO L290 TraceCheckUtils]: 42: Hoare triple {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:59,159 INFO L290 TraceCheckUtils]: 43: Hoare triple {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:59,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7715#(= |ssl3_connect_#t~mem52| 4384)} is VALID [2022-04-27 15:24:59,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {7715#(= |ssl3_connect_#t~mem52| 4384)} assume 20480 == #t~mem52;havoc #t~mem52; {7710#false} is VALID [2022-04-27 15:24:59,159 INFO L290 TraceCheckUtils]: 46: Hoare triple {7710#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7710#false} is VALID [2022-04-27 15:24:59,159 INFO L290 TraceCheckUtils]: 47: Hoare triple {7710#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7710#false} is VALID [2022-04-27 15:24:59,160 INFO L290 TraceCheckUtils]: 48: Hoare triple {7710#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7710#false} is VALID [2022-04-27 15:24:59,160 INFO L290 TraceCheckUtils]: 49: Hoare triple {7710#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7710#false} is VALID [2022-04-27 15:24:59,160 INFO L290 TraceCheckUtils]: 50: Hoare triple {7710#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7710#false} is VALID [2022-04-27 15:24:59,160 INFO L290 TraceCheckUtils]: 51: Hoare triple {7710#false} assume !(0 == ~tmp___4~0); {7710#false} is VALID [2022-04-27 15:24:59,160 INFO L290 TraceCheckUtils]: 52: Hoare triple {7710#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7710#false} is VALID [2022-04-27 15:24:59,160 INFO L290 TraceCheckUtils]: 53: Hoare triple {7710#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7710#false} is VALID [2022-04-27 15:24:59,160 INFO L290 TraceCheckUtils]: 54: Hoare triple {7710#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7710#false} is VALID [2022-04-27 15:24:59,160 INFO L290 TraceCheckUtils]: 55: Hoare triple {7710#false} ~skip~0 := 0; {7710#false} is VALID [2022-04-27 15:24:59,160 INFO L290 TraceCheckUtils]: 56: Hoare triple {7710#false} assume !false; {7710#false} is VALID [2022-04-27 15:24:59,160 INFO L290 TraceCheckUtils]: 57: Hoare triple {7710#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-27 15:24:59,160 INFO L290 TraceCheckUtils]: 58: Hoare triple {7710#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-27 15:24:59,161 INFO L290 TraceCheckUtils]: 59: Hoare triple {7710#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-27 15:24:59,161 INFO L290 TraceCheckUtils]: 60: Hoare triple {7710#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-27 15:24:59,161 INFO L290 TraceCheckUtils]: 61: Hoare triple {7710#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-27 15:24:59,161 INFO L290 TraceCheckUtils]: 62: Hoare triple {7710#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-27 15:24:59,161 INFO L290 TraceCheckUtils]: 63: Hoare triple {7710#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-27 15:24:59,161 INFO L290 TraceCheckUtils]: 64: Hoare triple {7710#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-27 15:24:59,161 INFO L290 TraceCheckUtils]: 65: Hoare triple {7710#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-27 15:24:59,161 INFO L290 TraceCheckUtils]: 66: Hoare triple {7710#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-27 15:24:59,161 INFO L290 TraceCheckUtils]: 67: Hoare triple {7710#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-27 15:24:59,161 INFO L290 TraceCheckUtils]: 68: Hoare triple {7710#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-27 15:24:59,161 INFO L290 TraceCheckUtils]: 69: Hoare triple {7710#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-27 15:24:59,161 INFO L290 TraceCheckUtils]: 70: Hoare triple {7710#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-27 15:24:59,161 INFO L290 TraceCheckUtils]: 71: Hoare triple {7710#false} assume 4432 == #t~mem62;havoc #t~mem62; {7710#false} is VALID [2022-04-27 15:24:59,161 INFO L290 TraceCheckUtils]: 72: Hoare triple {7710#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {7710#false} is VALID [2022-04-27 15:24:59,161 INFO L290 TraceCheckUtils]: 73: Hoare triple {7710#false} assume 4 == ~blastFlag~0; {7710#false} is VALID [2022-04-27 15:24:59,161 INFO L290 TraceCheckUtils]: 74: Hoare triple {7710#false} assume !false; {7710#false} is VALID [2022-04-27 15:24:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 15:24:59,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:24:59,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668409728] [2022-04-27 15:24:59,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668409728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:24:59,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:24:59,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:24:59,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136494945] [2022-04-27 15:24:59,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:24:59,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-27 15:24:59,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:24:59,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:59,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:24:59,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:24:59,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:24:59,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:24:59,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:24:59,225 INFO L87 Difference]: Start difference. First operand 264 states and 389 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:01,249 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:02,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:02,231 INFO L93 Difference]: Finished difference Result 416 states and 615 transitions. [2022-04-27 15:25:02,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:02,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-27 15:25:02,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:02,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-27 15:25:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-27 15:25:02,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 383 transitions. [2022-04-27 15:25:02,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:02,496 INFO L225 Difference]: With dead ends: 416 [2022-04-27 15:25:02,496 INFO L226 Difference]: Without dead ends: 281 [2022-04-27 15:25:02,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:02,497 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 33 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:02,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 480 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:25:02,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-27 15:25:02,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 264. [2022-04-27 15:25:02,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:02,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:02,505 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:02,505 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:02,511 INFO L93 Difference]: Finished difference Result 281 states and 411 transitions. [2022-04-27 15:25:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 411 transitions. [2022-04-27 15:25:02,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:02,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:02,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-27 15:25:02,512 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-27 15:25:02,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:02,517 INFO L93 Difference]: Finished difference Result 281 states and 411 transitions. [2022-04-27 15:25:02,517 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 411 transitions. [2022-04-27 15:25:02,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:02,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:02,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:02,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:02,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:02,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 388 transitions. [2022-04-27 15:25:02,523 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 388 transitions. Word has length 75 [2022-04-27 15:25:02,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:02,523 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 388 transitions. [2022-04-27 15:25:02,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 388 transitions. [2022-04-27 15:25:02,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-27 15:25:02,524 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:02,524 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:02,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:25:02,525 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:02,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:02,525 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 1 times [2022-04-27 15:25:02,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:02,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041808764] [2022-04-27 15:25:02,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:02,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:02,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:02,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {9076#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {9069#true} is VALID [2022-04-27 15:25:02,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {9069#true} assume true; {9069#true} is VALID [2022-04-27 15:25:02,679 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9069#true} {9069#true} #593#return; {9069#true} is VALID [2022-04-27 15:25:02,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {9069#true} call ULTIMATE.init(); {9076#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:25:02,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {9076#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {9069#true} is VALID [2022-04-27 15:25:02,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {9069#true} assume true; {9069#true} is VALID [2022-04-27 15:25:02,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9069#true} {9069#true} #593#return; {9069#true} is VALID [2022-04-27 15:25:02,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {9069#true} call #t~ret158 := main(); {9069#true} is VALID [2022-04-27 15:25:02,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {9069#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {9069#true} is VALID [2022-04-27 15:25:02,681 INFO L272 TraceCheckUtils]: 6: Hoare triple {9069#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {9069#true} is VALID [2022-04-27 15:25:02,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {9069#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9069#true} is VALID [2022-04-27 15:25:02,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {9069#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {9069#true} is VALID [2022-04-27 15:25:02,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {9069#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {9069#true} is VALID [2022-04-27 15:25:02,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {9069#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9069#true} is VALID [2022-04-27 15:25:02,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {9069#true} assume !false; {9069#true} is VALID [2022-04-27 15:25:02,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {9069#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9069#true} is VALID [2022-04-27 15:25:02,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {9069#true} assume 12292 == #t~mem49;havoc #t~mem49; {9069#true} is VALID [2022-04-27 15:25:02,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {9069#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {9069#true} is VALID [2022-04-27 15:25:02,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {9069#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9069#true} is VALID [2022-04-27 15:25:02,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {9069#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9069#true} is VALID [2022-04-27 15:25:02,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {9069#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9069#true} is VALID [2022-04-27 15:25:02,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {9069#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9069#true} is VALID [2022-04-27 15:25:02,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {9069#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9069#true} is VALID [2022-04-27 15:25:02,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {9069#true} assume !(0 == ~tmp___4~0); {9069#true} is VALID [2022-04-27 15:25:02,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {9069#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9069#true} is VALID [2022-04-27 15:25:02,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {9069#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9069#true} is VALID [2022-04-27 15:25:02,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {9069#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9069#true} is VALID [2022-04-27 15:25:02,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {9069#true} ~skip~0 := 0; {9069#true} is VALID [2022-04-27 15:25:02,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {9069#true} assume !false; {9069#true} is VALID [2022-04-27 15:25:02,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {9069#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9069#true} is VALID [2022-04-27 15:25:02,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {9069#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9069#true} is VALID [2022-04-27 15:25:02,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {9069#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9069#true} is VALID [2022-04-27 15:25:02,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {9069#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9069#true} is VALID [2022-04-27 15:25:02,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {9069#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9069#true} is VALID [2022-04-27 15:25:02,682 INFO L290 TraceCheckUtils]: 31: Hoare triple {9069#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9069#true} is VALID [2022-04-27 15:25:02,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {9069#true} assume 4368 == #t~mem54;havoc #t~mem54; {9069#true} is VALID [2022-04-27 15:25:02,682 INFO L290 TraceCheckUtils]: 33: Hoare triple {9069#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {9069#true} is VALID [2022-04-27 15:25:02,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {9069#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9069#true} is VALID [2022-04-27 15:25:02,684 INFO L290 TraceCheckUtils]: 35: Hoare triple {9069#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:02,684 INFO L290 TraceCheckUtils]: 36: Hoare triple {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:02,684 INFO L290 TraceCheckUtils]: 37: Hoare triple {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:02,684 INFO L290 TraceCheckUtils]: 38: Hoare triple {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:02,685 INFO L290 TraceCheckUtils]: 39: Hoare triple {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:02,685 INFO L290 TraceCheckUtils]: 40: Hoare triple {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:02,685 INFO L290 TraceCheckUtils]: 41: Hoare triple {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:02,685 INFO L290 TraceCheckUtils]: 42: Hoare triple {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:02,685 INFO L290 TraceCheckUtils]: 43: Hoare triple {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:02,686 INFO L290 TraceCheckUtils]: 44: Hoare triple {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:02,686 INFO L290 TraceCheckUtils]: 45: Hoare triple {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9075#(not (= |ssl3_connect_#t~mem53| 4099))} is VALID [2022-04-27 15:25:02,686 INFO L290 TraceCheckUtils]: 46: Hoare triple {9075#(not (= |ssl3_connect_#t~mem53| 4099))} assume 4099 == #t~mem53;havoc #t~mem53; {9070#false} is VALID [2022-04-27 15:25:02,686 INFO L290 TraceCheckUtils]: 47: Hoare triple {9070#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9070#false} is VALID [2022-04-27 15:25:02,686 INFO L290 TraceCheckUtils]: 48: Hoare triple {9070#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9070#false} is VALID [2022-04-27 15:25:02,687 INFO L290 TraceCheckUtils]: 49: Hoare triple {9070#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9070#false} is VALID [2022-04-27 15:25:02,687 INFO L290 TraceCheckUtils]: 50: Hoare triple {9070#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9070#false} is VALID [2022-04-27 15:25:02,687 INFO L290 TraceCheckUtils]: 51: Hoare triple {9070#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9070#false} is VALID [2022-04-27 15:25:02,687 INFO L290 TraceCheckUtils]: 52: Hoare triple {9070#false} assume !(0 == ~tmp___4~0); {9070#false} is VALID [2022-04-27 15:25:02,687 INFO L290 TraceCheckUtils]: 53: Hoare triple {9070#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9070#false} is VALID [2022-04-27 15:25:02,687 INFO L290 TraceCheckUtils]: 54: Hoare triple {9070#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9070#false} is VALID [2022-04-27 15:25:02,687 INFO L290 TraceCheckUtils]: 55: Hoare triple {9070#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9070#false} is VALID [2022-04-27 15:25:02,687 INFO L290 TraceCheckUtils]: 56: Hoare triple {9070#false} ~skip~0 := 0; {9070#false} is VALID [2022-04-27 15:25:02,687 INFO L290 TraceCheckUtils]: 57: Hoare triple {9070#false} assume !false; {9070#false} is VALID [2022-04-27 15:25:02,687 INFO L290 TraceCheckUtils]: 58: Hoare triple {9070#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-27 15:25:02,687 INFO L290 TraceCheckUtils]: 59: Hoare triple {9070#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-27 15:25:02,687 INFO L290 TraceCheckUtils]: 60: Hoare triple {9070#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-27 15:25:02,687 INFO L290 TraceCheckUtils]: 61: Hoare triple {9070#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-27 15:25:02,687 INFO L290 TraceCheckUtils]: 62: Hoare triple {9070#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-27 15:25:02,687 INFO L290 TraceCheckUtils]: 63: Hoare triple {9070#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-27 15:25:02,687 INFO L290 TraceCheckUtils]: 64: Hoare triple {9070#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-27 15:25:02,688 INFO L290 TraceCheckUtils]: 65: Hoare triple {9070#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-27 15:25:02,688 INFO L290 TraceCheckUtils]: 66: Hoare triple {9070#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-27 15:25:02,688 INFO L290 TraceCheckUtils]: 67: Hoare triple {9070#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-27 15:25:02,688 INFO L290 TraceCheckUtils]: 68: Hoare triple {9070#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-27 15:25:02,688 INFO L290 TraceCheckUtils]: 69: Hoare triple {9070#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-27 15:25:02,688 INFO L290 TraceCheckUtils]: 70: Hoare triple {9070#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-27 15:25:02,688 INFO L290 TraceCheckUtils]: 71: Hoare triple {9070#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-27 15:25:02,688 INFO L290 TraceCheckUtils]: 72: Hoare triple {9070#false} assume 4432 == #t~mem62;havoc #t~mem62; {9070#false} is VALID [2022-04-27 15:25:02,688 INFO L290 TraceCheckUtils]: 73: Hoare triple {9070#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {9070#false} is VALID [2022-04-27 15:25:02,688 INFO L290 TraceCheckUtils]: 74: Hoare triple {9070#false} assume 4 == ~blastFlag~0; {9070#false} is VALID [2022-04-27 15:25:02,688 INFO L290 TraceCheckUtils]: 75: Hoare triple {9070#false} assume !false; {9070#false} is VALID [2022-04-27 15:25:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 15:25:02,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:02,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041808764] [2022-04-27 15:25:02,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041808764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:02,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:02,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:02,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063407954] [2022-04-27 15:25:02,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:02,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-27 15:25:02,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:02,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:02,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:02,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:02,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:02,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:02,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:02,740 INFO L87 Difference]: Start difference. First operand 264 states and 388 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:04,763 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:05,735 INFO L93 Difference]: Finished difference Result 671 states and 994 transitions. [2022-04-27 15:25:05,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:05,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-27 15:25:05,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-27 15:25:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:05,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-27 15:25:05,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-27 15:25:06,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:06,083 INFO L225 Difference]: With dead ends: 671 [2022-04-27 15:25:06,083 INFO L226 Difference]: Without dead ends: 423 [2022-04-27 15:25:06,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:06,084 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 115 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:06,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:25:06,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-04-27 15:25:06,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 270. [2022-04-27 15:25:06,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:06,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 423 states. Second operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:06,097 INFO L74 IsIncluded]: Start isIncluded. First operand 423 states. Second operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:06,098 INFO L87 Difference]: Start difference. First operand 423 states. Second operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:06,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:06,106 INFO L93 Difference]: Finished difference Result 423 states and 623 transitions. [2022-04-27 15:25:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 623 transitions. [2022-04-27 15:25:06,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:06,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:06,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 423 states. [2022-04-27 15:25:06,108 INFO L87 Difference]: Start difference. First operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 423 states. [2022-04-27 15:25:06,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:06,115 INFO L93 Difference]: Finished difference Result 423 states and 623 transitions. [2022-04-27 15:25:06,115 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 623 transitions. [2022-04-27 15:25:06,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:06,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:06,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:06,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:06,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 397 transitions. [2022-04-27 15:25:06,120 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 397 transitions. Word has length 76 [2022-04-27 15:25:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:06,120 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 397 transitions. [2022-04-27 15:25:06,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 397 transitions. [2022-04-27 15:25:06,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-27 15:25:06,121 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:06,121 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:25:06,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:25:06,121 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:06,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:06,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1188358039, now seen corresponding path program 1 times [2022-04-27 15:25:06,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:06,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978462336] [2022-04-27 15:25:06,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:06,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:06,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:06,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {11025#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {11019#true} is VALID [2022-04-27 15:25:06,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {11019#true} assume true; {11019#true} is VALID [2022-04-27 15:25:06,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11019#true} {11019#true} #593#return; {11019#true} is VALID [2022-04-27 15:25:06,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {11019#true} call ULTIMATE.init(); {11025#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:25:06,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {11025#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {11019#true} is VALID [2022-04-27 15:25:06,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {11019#true} assume true; {11019#true} is VALID [2022-04-27 15:25:06,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11019#true} {11019#true} #593#return; {11019#true} is VALID [2022-04-27 15:25:06,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {11019#true} call #t~ret158 := main(); {11019#true} is VALID [2022-04-27 15:25:06,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {11019#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {11019#true} is VALID [2022-04-27 15:25:06,257 INFO L272 TraceCheckUtils]: 6: Hoare triple {11019#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11019#true} is VALID [2022-04-27 15:25:06,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {11019#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {11019#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {11019#true} is VALID [2022-04-27 15:25:06,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {11019#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {11019#true} is VALID [2022-04-27 15:25:06,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {11019#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11019#true} is VALID [2022-04-27 15:25:06,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {11019#true} assume !false; {11019#true} is VALID [2022-04-27 15:25:06,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {11019#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {11019#true} assume 12292 == #t~mem49;havoc #t~mem49; {11019#true} is VALID [2022-04-27 15:25:06,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {11019#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {11019#true} is VALID [2022-04-27 15:25:06,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {11019#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {11019#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11019#true} is VALID [2022-04-27 15:25:06,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {11019#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {11019#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {11019#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11019#true} is VALID [2022-04-27 15:25:06,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {11019#true} assume !(0 == ~tmp___4~0); {11019#true} is VALID [2022-04-27 15:25:06,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {11019#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {11019#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {11019#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11019#true} is VALID [2022-04-27 15:25:06,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {11019#true} ~skip~0 := 0; {11019#true} is VALID [2022-04-27 15:25:06,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {11019#true} assume !false; {11019#true} is VALID [2022-04-27 15:25:06,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {11019#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {11019#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {11019#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {11019#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {11019#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {11019#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,259 INFO L290 TraceCheckUtils]: 32: Hoare triple {11019#true} assume 4368 == #t~mem54;havoc #t~mem54; {11019#true} is VALID [2022-04-27 15:25:06,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {11019#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {11019#true} is VALID [2022-04-27 15:25:06,259 INFO L290 TraceCheckUtils]: 34: Hoare triple {11019#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11019#true} is VALID [2022-04-27 15:25:06,259 INFO L290 TraceCheckUtils]: 35: Hoare triple {11019#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,259 INFO L290 TraceCheckUtils]: 36: Hoare triple {11019#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {11019#true} is VALID [2022-04-27 15:25:06,259 INFO L290 TraceCheckUtils]: 37: Hoare triple {11019#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,259 INFO L290 TraceCheckUtils]: 38: Hoare triple {11019#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11019#true} is VALID [2022-04-27 15:25:06,259 INFO L290 TraceCheckUtils]: 39: Hoare triple {11019#true} ~skip~0 := 0; {11019#true} is VALID [2022-04-27 15:25:06,259 INFO L290 TraceCheckUtils]: 40: Hoare triple {11019#true} assume !false; {11019#true} is VALID [2022-04-27 15:25:06,259 INFO L290 TraceCheckUtils]: 41: Hoare triple {11019#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,259 INFO L290 TraceCheckUtils]: 42: Hoare triple {11019#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,259 INFO L290 TraceCheckUtils]: 43: Hoare triple {11019#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,259 INFO L290 TraceCheckUtils]: 44: Hoare triple {11019#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,260 INFO L290 TraceCheckUtils]: 45: Hoare triple {11019#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,260 INFO L290 TraceCheckUtils]: 46: Hoare triple {11019#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,260 INFO L290 TraceCheckUtils]: 47: Hoare triple {11019#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,260 INFO L290 TraceCheckUtils]: 48: Hoare triple {11019#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-27 15:25:06,260 INFO L290 TraceCheckUtils]: 49: Hoare triple {11019#true} assume 4384 == #t~mem56;havoc #t~mem56; {11019#true} is VALID [2022-04-27 15:25:06,260 INFO L290 TraceCheckUtils]: 50: Hoare triple {11019#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {11019#true} is VALID [2022-04-27 15:25:06,260 INFO L290 TraceCheckUtils]: 51: Hoare triple {11019#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,261 INFO L290 TraceCheckUtils]: 52: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,261 INFO L290 TraceCheckUtils]: 53: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,261 INFO L290 TraceCheckUtils]: 54: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,261 INFO L290 TraceCheckUtils]: 55: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,261 INFO L290 TraceCheckUtils]: 56: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,262 INFO L290 TraceCheckUtils]: 57: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,262 INFO L290 TraceCheckUtils]: 58: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,262 INFO L290 TraceCheckUtils]: 59: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,262 INFO L290 TraceCheckUtils]: 60: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,263 INFO L290 TraceCheckUtils]: 61: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,263 INFO L290 TraceCheckUtils]: 62: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,263 INFO L290 TraceCheckUtils]: 63: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,263 INFO L290 TraceCheckUtils]: 64: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,264 INFO L290 TraceCheckUtils]: 65: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,264 INFO L290 TraceCheckUtils]: 66: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,264 INFO L290 TraceCheckUtils]: 67: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,264 INFO L290 TraceCheckUtils]: 68: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,265 INFO L290 TraceCheckUtils]: 69: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,265 INFO L290 TraceCheckUtils]: 70: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,265 INFO L290 TraceCheckUtils]: 71: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,265 INFO L290 TraceCheckUtils]: 72: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,265 INFO L290 TraceCheckUtils]: 73: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,266 INFO L290 TraceCheckUtils]: 74: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:06,266 INFO L290 TraceCheckUtils]: 75: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume 4 == ~blastFlag~0; {11020#false} is VALID [2022-04-27 15:25:06,266 INFO L290 TraceCheckUtils]: 76: Hoare triple {11020#false} assume !false; {11020#false} is VALID [2022-04-27 15:25:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-27 15:25:06,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:06,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978462336] [2022-04-27 15:25:06,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978462336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:06,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:06,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:25:06,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53977302] [2022-04-27 15:25:06,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:06,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-27 15:25:06,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:06,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:06,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:06,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:25:06,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:06,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:25:06,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:25:06,312 INFO L87 Difference]: Start difference. First operand 270 states and 397 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:08,328 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:09,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:09,397 INFO L93 Difference]: Finished difference Result 543 states and 807 transitions. [2022-04-27 15:25:09,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:25:09,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-27 15:25:09,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:09,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-27 15:25:09,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:09,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-27 15:25:09,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-27 15:25:09,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:09,774 INFO L225 Difference]: With dead ends: 543 [2022-04-27 15:25:09,774 INFO L226 Difference]: Without dead ends: 405 [2022-04-27 15:25:09,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:25:09,777 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:09,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 477 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:25:09,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-27 15:25:09,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2022-04-27 15:25:09,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:09,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 405 states. Second operand has 405 states, 400 states have (on average 1.4775) internal successors, (591), 400 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:09,785 INFO L74 IsIncluded]: Start isIncluded. First operand 405 states. Second operand has 405 states, 400 states have (on average 1.4775) internal successors, (591), 400 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:09,785 INFO L87 Difference]: Start difference. First operand 405 states. Second operand has 405 states, 400 states have (on average 1.4775) internal successors, (591), 400 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:09,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:09,793 INFO L93 Difference]: Finished difference Result 405 states and 595 transitions. [2022-04-27 15:25:09,793 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 595 transitions. [2022-04-27 15:25:09,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:09,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:09,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 405 states, 400 states have (on average 1.4775) internal successors, (591), 400 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 405 states. [2022-04-27 15:25:09,795 INFO L87 Difference]: Start difference. First operand has 405 states, 400 states have (on average 1.4775) internal successors, (591), 400 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 405 states. [2022-04-27 15:25:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:09,803 INFO L93 Difference]: Finished difference Result 405 states and 595 transitions. [2022-04-27 15:25:09,803 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 595 transitions. [2022-04-27 15:25:09,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:09,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:09,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:09,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 400 states have (on average 1.4775) internal successors, (591), 400 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 595 transitions. [2022-04-27 15:25:09,812 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 595 transitions. Word has length 77 [2022-04-27 15:25:09,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:09,813 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 595 transitions. [2022-04-27 15:25:09,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 595 transitions. [2022-04-27 15:25:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-27 15:25:09,814 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:09,814 INFO L195 NwaCegarLoop]: 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, 1] [2022-04-27 15:25:09,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:25:09,814 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:09,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:09,815 INFO L85 PathProgramCache]: Analyzing trace with hash -979274608, now seen corresponding path program 1 times [2022-04-27 15:25:09,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:09,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638292279] [2022-04-27 15:25:09,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:09,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:09,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:09,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {12931#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {12925#true} is VALID [2022-04-27 15:25:09,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {12925#true} assume true; {12925#true} is VALID [2022-04-27 15:25:09,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12925#true} {12925#true} #593#return; {12925#true} is VALID [2022-04-27 15:25:09,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {12925#true} call ULTIMATE.init(); {12931#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:25:09,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {12931#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {12925#true} is VALID [2022-04-27 15:25:09,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {12925#true} assume true; {12925#true} is VALID [2022-04-27 15:25:09,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12925#true} {12925#true} #593#return; {12925#true} is VALID [2022-04-27 15:25:09,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {12925#true} call #t~ret158 := main(); {12925#true} is VALID [2022-04-27 15:25:09,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {12925#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {12925#true} is VALID [2022-04-27 15:25:09,964 INFO L272 TraceCheckUtils]: 6: Hoare triple {12925#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {12925#true} is VALID [2022-04-27 15:25:09,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {12925#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {12925#true} is VALID [2022-04-27 15:25:09,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {12925#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {12925#true} is VALID [2022-04-27 15:25:09,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {12925#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {12925#true} is VALID [2022-04-27 15:25:09,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {12925#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12925#true} is VALID [2022-04-27 15:25:09,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {12925#true} assume !false; {12925#true} is VALID [2022-04-27 15:25:09,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {12925#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12925#true} is VALID [2022-04-27 15:25:09,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {12925#true} assume 12292 == #t~mem49;havoc #t~mem49; {12925#true} is VALID [2022-04-27 15:25:09,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {12925#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {12925#true} is VALID [2022-04-27 15:25:09,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {12925#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {12925#true} is VALID [2022-04-27 15:25:09,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {12925#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {12925#true} is VALID [2022-04-27 15:25:09,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {12925#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {12925#true} is VALID [2022-04-27 15:25:09,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {12925#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {12925#true} is VALID [2022-04-27 15:25:09,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {12925#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {12925#true} is VALID [2022-04-27 15:25:09,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {12925#true} assume !(0 == ~tmp___4~0); {12925#true} is VALID [2022-04-27 15:25:09,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {12925#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {12925#true} is VALID [2022-04-27 15:25:09,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {12925#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {12925#true} is VALID [2022-04-27 15:25:09,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {12925#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {12925#true} is VALID [2022-04-27 15:25:09,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {12925#true} ~skip~0 := 0; {12925#true} is VALID [2022-04-27 15:25:09,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {12925#true} assume !false; {12925#true} is VALID [2022-04-27 15:25:09,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {12925#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12925#true} is VALID [2022-04-27 15:25:09,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {12925#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12925#true} is VALID [2022-04-27 15:25:09,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {12925#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12925#true} is VALID [2022-04-27 15:25:09,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {12925#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12925#true} is VALID [2022-04-27 15:25:09,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {12925#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12925#true} is VALID [2022-04-27 15:25:09,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {12925#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12925#true} is VALID [2022-04-27 15:25:09,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {12925#true} assume 4368 == #t~mem54;havoc #t~mem54; {12925#true} is VALID [2022-04-27 15:25:09,966 INFO L290 TraceCheckUtils]: 33: Hoare triple {12925#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {12925#true} is VALID [2022-04-27 15:25:09,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {12925#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:09,967 INFO L290 TraceCheckUtils]: 35: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:09,967 INFO L290 TraceCheckUtils]: 36: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:09,968 INFO L290 TraceCheckUtils]: 37: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:09,968 INFO L290 TraceCheckUtils]: 38: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:09,968 INFO L290 TraceCheckUtils]: 39: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:09,968 INFO L290 TraceCheckUtils]: 40: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !false; {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:09,969 INFO L290 TraceCheckUtils]: 41: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:09,969 INFO L290 TraceCheckUtils]: 42: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:09,969 INFO L290 TraceCheckUtils]: 43: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:09,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:09,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:09,970 INFO L290 TraceCheckUtils]: 46: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:09,970 INFO L290 TraceCheckUtils]: 47: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:09,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:09,971 INFO L290 TraceCheckUtils]: 49: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem56;havoc #t~mem56; {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:09,971 INFO L290 TraceCheckUtils]: 50: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:09,971 INFO L290 TraceCheckUtils]: 51: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {12926#false} is VALID [2022-04-27 15:25:09,972 INFO L290 TraceCheckUtils]: 52: Hoare triple {12926#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {12926#false} is VALID [2022-04-27 15:25:09,972 INFO L290 TraceCheckUtils]: 53: Hoare triple {12926#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {12926#false} is VALID [2022-04-27 15:25:09,972 INFO L290 TraceCheckUtils]: 54: Hoare triple {12926#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-27 15:25:09,972 INFO L290 TraceCheckUtils]: 55: Hoare triple {12926#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {12926#false} is VALID [2022-04-27 15:25:09,972 INFO L290 TraceCheckUtils]: 56: Hoare triple {12926#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {12926#false} is VALID [2022-04-27 15:25:09,972 INFO L290 TraceCheckUtils]: 57: Hoare triple {12926#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {12926#false} is VALID [2022-04-27 15:25:09,972 INFO L290 TraceCheckUtils]: 58: Hoare triple {12926#false} ~skip~0 := 0; {12926#false} is VALID [2022-04-27 15:25:09,972 INFO L290 TraceCheckUtils]: 59: Hoare triple {12926#false} assume !false; {12926#false} is VALID [2022-04-27 15:25:09,972 INFO L290 TraceCheckUtils]: 60: Hoare triple {12926#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-27 15:25:09,972 INFO L290 TraceCheckUtils]: 61: Hoare triple {12926#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-27 15:25:09,972 INFO L290 TraceCheckUtils]: 62: Hoare triple {12926#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-27 15:25:09,973 INFO L290 TraceCheckUtils]: 63: Hoare triple {12926#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-27 15:25:09,973 INFO L290 TraceCheckUtils]: 64: Hoare triple {12926#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-27 15:25:09,973 INFO L290 TraceCheckUtils]: 65: Hoare triple {12926#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-27 15:25:09,973 INFO L290 TraceCheckUtils]: 66: Hoare triple {12926#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-27 15:25:09,973 INFO L290 TraceCheckUtils]: 67: Hoare triple {12926#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-27 15:25:09,973 INFO L290 TraceCheckUtils]: 68: Hoare triple {12926#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-27 15:25:09,973 INFO L290 TraceCheckUtils]: 69: Hoare triple {12926#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-27 15:25:09,973 INFO L290 TraceCheckUtils]: 70: Hoare triple {12926#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-27 15:25:09,973 INFO L290 TraceCheckUtils]: 71: Hoare triple {12926#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-27 15:25:09,973 INFO L290 TraceCheckUtils]: 72: Hoare triple {12926#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-27 15:25:09,973 INFO L290 TraceCheckUtils]: 73: Hoare triple {12926#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-27 15:25:09,973 INFO L290 TraceCheckUtils]: 74: Hoare triple {12926#false} assume 4432 == #t~mem62;havoc #t~mem62; {12926#false} is VALID [2022-04-27 15:25:09,973 INFO L290 TraceCheckUtils]: 75: Hoare triple {12926#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {12926#false} is VALID [2022-04-27 15:25:09,973 INFO L290 TraceCheckUtils]: 76: Hoare triple {12926#false} assume 4 == ~blastFlag~0; {12926#false} is VALID [2022-04-27 15:25:09,973 INFO L290 TraceCheckUtils]: 77: Hoare triple {12926#false} assume !false; {12926#false} is VALID [2022-04-27 15:25:09,974 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 15:25:09,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:09,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638292279] [2022-04-27 15:25:09,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638292279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:09,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:09,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:25:09,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560492138] [2022-04-27 15:25:09,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:09,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-27 15:25:09,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:09,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:10,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:10,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:25:10,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:10,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:25:10,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:25:10,041 INFO L87 Difference]: Start difference. First operand 405 states and 595 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:12,061 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:12,618 INFO L93 Difference]: Finished difference Result 702 states and 1033 transitions. [2022-04-27 15:25:12,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:25:12,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-27 15:25:12,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:12,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-27 15:25:12,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-27 15:25:12,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 367 transitions. [2022-04-27 15:25:12,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:12,860 INFO L225 Difference]: With dead ends: 702 [2022-04-27 15:25:12,860 INFO L226 Difference]: Without dead ends: 429 [2022-04-27 15:25:12,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:25:12,861 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 15 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:12,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 359 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 15:25:12,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-04-27 15:25:12,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2022-04-27 15:25:12,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:12,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:12,869 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:12,869 INFO L87 Difference]: Start difference. First operand 429 states. Second operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:12,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:12,885 INFO L93 Difference]: Finished difference Result 429 states and 627 transitions. [2022-04-27 15:25:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 627 transitions. [2022-04-27 15:25:12,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:12,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:12,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 429 states. [2022-04-27 15:25:12,887 INFO L87 Difference]: Start difference. First operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 429 states. [2022-04-27 15:25:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:12,895 INFO L93 Difference]: Finished difference Result 429 states and 627 transitions. [2022-04-27 15:25:12,895 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 627 transitions. [2022-04-27 15:25:12,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:12,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:12,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:12,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 627 transitions. [2022-04-27 15:25:12,903 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 627 transitions. Word has length 78 [2022-04-27 15:25:12,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:12,904 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 627 transitions. [2022-04-27 15:25:12,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:12,904 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 627 transitions. [2022-04-27 15:25:12,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-27 15:25:12,904 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:12,904 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:12,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:25:12,905 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:12,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:12,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1809534672, now seen corresponding path program 1 times [2022-04-27 15:25:12,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:12,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664351367] [2022-04-27 15:25:12,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:12,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:13,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:13,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {15092#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {15086#true} is VALID [2022-04-27 15:25:13,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {15086#true} assume true; {15086#true} is VALID [2022-04-27 15:25:13,060 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15086#true} {15086#true} #593#return; {15086#true} is VALID [2022-04-27 15:25:13,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {15086#true} call ULTIMATE.init(); {15092#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:25:13,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {15092#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {15086#true} is VALID [2022-04-27 15:25:13,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {15086#true} assume true; {15086#true} is VALID [2022-04-27 15:25:13,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15086#true} {15086#true} #593#return; {15086#true} is VALID [2022-04-27 15:25:13,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {15086#true} call #t~ret158 := main(); {15086#true} is VALID [2022-04-27 15:25:13,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {15086#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {15086#true} is VALID [2022-04-27 15:25:13,061 INFO L272 TraceCheckUtils]: 6: Hoare triple {15086#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15086#true} is VALID [2022-04-27 15:25:13,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {15086#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {15086#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {15086#true} is VALID [2022-04-27 15:25:13,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {15086#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {15086#true} is VALID [2022-04-27 15:25:13,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {15086#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15086#true} is VALID [2022-04-27 15:25:13,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {15086#true} assume !false; {15086#true} is VALID [2022-04-27 15:25:13,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {15086#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {15086#true} assume 12292 == #t~mem49;havoc #t~mem49; {15086#true} is VALID [2022-04-27 15:25:13,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {15086#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {15086#true} is VALID [2022-04-27 15:25:13,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {15086#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {15086#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15086#true} is VALID [2022-04-27 15:25:13,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {15086#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {15086#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {15086#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {15086#true} is VALID [2022-04-27 15:25:13,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {15086#true} assume !(0 == ~tmp___4~0); {15086#true} is VALID [2022-04-27 15:25:13,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {15086#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {15086#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {15086#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15086#true} is VALID [2022-04-27 15:25:13,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {15086#true} ~skip~0 := 0; {15086#true} is VALID [2022-04-27 15:25:13,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {15086#true} assume !false; {15086#true} is VALID [2022-04-27 15:25:13,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {15086#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {15086#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {15086#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {15086#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {15086#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {15086#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {15086#true} assume 4368 == #t~mem54;havoc #t~mem54; {15086#true} is VALID [2022-04-27 15:25:13,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {15086#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {15086#true} is VALID [2022-04-27 15:25:13,075 INFO L290 TraceCheckUtils]: 34: Hoare triple {15086#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15086#true} is VALID [2022-04-27 15:25:13,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {15086#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,075 INFO L290 TraceCheckUtils]: 36: Hoare triple {15086#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {15086#true} is VALID [2022-04-27 15:25:13,075 INFO L290 TraceCheckUtils]: 37: Hoare triple {15086#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,075 INFO L290 TraceCheckUtils]: 38: Hoare triple {15086#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15086#true} is VALID [2022-04-27 15:25:13,075 INFO L290 TraceCheckUtils]: 39: Hoare triple {15086#true} ~skip~0 := 0; {15086#true} is VALID [2022-04-27 15:25:13,075 INFO L290 TraceCheckUtils]: 40: Hoare triple {15086#true} assume !false; {15086#true} is VALID [2022-04-27 15:25:13,075 INFO L290 TraceCheckUtils]: 41: Hoare triple {15086#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,075 INFO L290 TraceCheckUtils]: 42: Hoare triple {15086#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {15086#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,075 INFO L290 TraceCheckUtils]: 44: Hoare triple {15086#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {15086#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {15086#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,075 INFO L290 TraceCheckUtils]: 47: Hoare triple {15086#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,076 INFO L290 TraceCheckUtils]: 48: Hoare triple {15086#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {15086#true} assume 4384 == #t~mem56;havoc #t~mem56; {15086#true} is VALID [2022-04-27 15:25:13,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {15086#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15086#true} is VALID [2022-04-27 15:25:13,076 INFO L290 TraceCheckUtils]: 51: Hoare triple {15086#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15086#true} is VALID [2022-04-27 15:25:13,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {15086#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,076 INFO L290 TraceCheckUtils]: 53: Hoare triple {15086#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,076 INFO L290 TraceCheckUtils]: 54: Hoare triple {15086#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,076 INFO L290 TraceCheckUtils]: 55: Hoare triple {15086#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,076 INFO L290 TraceCheckUtils]: 56: Hoare triple {15086#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15086#true} is VALID [2022-04-27 15:25:13,076 INFO L290 TraceCheckUtils]: 57: Hoare triple {15086#true} ~skip~0 := 0; {15086#true} is VALID [2022-04-27 15:25:13,076 INFO L290 TraceCheckUtils]: 58: Hoare triple {15086#true} assume !false; {15086#true} is VALID [2022-04-27 15:25:13,076 INFO L290 TraceCheckUtils]: 59: Hoare triple {15086#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,076 INFO L290 TraceCheckUtils]: 60: Hoare triple {15086#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,076 INFO L290 TraceCheckUtils]: 61: Hoare triple {15086#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,076 INFO L290 TraceCheckUtils]: 62: Hoare triple {15086#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,076 INFO L290 TraceCheckUtils]: 63: Hoare triple {15086#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,077 INFO L290 TraceCheckUtils]: 64: Hoare triple {15086#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,077 INFO L290 TraceCheckUtils]: 65: Hoare triple {15086#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,077 INFO L290 TraceCheckUtils]: 66: Hoare triple {15086#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,077 INFO L290 TraceCheckUtils]: 67: Hoare triple {15086#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,077 INFO L290 TraceCheckUtils]: 68: Hoare triple {15086#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,077 INFO L290 TraceCheckUtils]: 69: Hoare triple {15086#true} assume 4400 == #t~mem58;havoc #t~mem58; {15086#true} is VALID [2022-04-27 15:25:13,077 INFO L290 TraceCheckUtils]: 70: Hoare triple {15086#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {15086#true} is VALID [2022-04-27 15:25:13,077 INFO L290 TraceCheckUtils]: 71: Hoare triple {15086#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {15086#true} is VALID [2022-04-27 15:25:13,087 INFO L290 TraceCheckUtils]: 72: Hoare triple {15086#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,087 INFO L290 TraceCheckUtils]: 73: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,087 INFO L290 TraceCheckUtils]: 74: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,088 INFO L290 TraceCheckUtils]: 75: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,088 INFO L290 TraceCheckUtils]: 76: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,088 INFO L290 TraceCheckUtils]: 77: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,088 INFO L290 TraceCheckUtils]: 78: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,089 INFO L290 TraceCheckUtils]: 79: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,089 INFO L290 TraceCheckUtils]: 80: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,089 INFO L290 TraceCheckUtils]: 81: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,089 INFO L290 TraceCheckUtils]: 82: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,090 INFO L290 TraceCheckUtils]: 83: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,090 INFO L290 TraceCheckUtils]: 84: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,090 INFO L290 TraceCheckUtils]: 85: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,090 INFO L290 TraceCheckUtils]: 86: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,091 INFO L290 TraceCheckUtils]: 87: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,091 INFO L290 TraceCheckUtils]: 88: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,091 INFO L290 TraceCheckUtils]: 89: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,091 INFO L290 TraceCheckUtils]: 90: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,092 INFO L290 TraceCheckUtils]: 91: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,092 INFO L290 TraceCheckUtils]: 92: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,092 INFO L290 TraceCheckUtils]: 93: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,092 INFO L290 TraceCheckUtils]: 94: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:13,093 INFO L290 TraceCheckUtils]: 95: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume 4 == ~blastFlag~0; {15087#false} is VALID [2022-04-27 15:25:13,093 INFO L290 TraceCheckUtils]: 96: Hoare triple {15087#false} assume !false; {15087#false} is VALID [2022-04-27 15:25:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-27 15:25:13,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:13,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664351367] [2022-04-27 15:25:13,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664351367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:13,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:13,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:25:13,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463585565] [2022-04-27 15:25:13,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:13,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-27 15:25:13,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:13,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:13,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:13,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:25:13,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:13,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:25:13,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:25:13,151 INFO L87 Difference]: Start difference. First operand 429 states and 627 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:15,166 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:16,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:16,002 INFO L93 Difference]: Finished difference Result 860 states and 1266 transitions. [2022-04-27 15:25:16,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:25:16,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-27 15:25:16,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:16,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-27 15:25:16,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-27 15:25:16,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-27 15:25:16,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:16,327 INFO L225 Difference]: With dead ends: 860 [2022-04-27 15:25:16,327 INFO L226 Difference]: Without dead ends: 563 [2022-04-27 15:25:16,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:25:16,328 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:16,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 476 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 338 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:25:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-04-27 15:25:16,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2022-04-27 15:25:16,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:16,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 563 states. Second operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:16,337 INFO L74 IsIncluded]: Start isIncluded. First operand 563 states. Second operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:16,337 INFO L87 Difference]: Start difference. First operand 563 states. Second operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:16,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:16,349 INFO L93 Difference]: Finished difference Result 563 states and 824 transitions. [2022-04-27 15:25:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 824 transitions. [2022-04-27 15:25:16,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:16,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:16,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 563 states. [2022-04-27 15:25:16,350 INFO L87 Difference]: Start difference. First operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 563 states. [2022-04-27 15:25:16,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:16,361 INFO L93 Difference]: Finished difference Result 563 states and 824 transitions. [2022-04-27 15:25:16,361 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 824 transitions. [2022-04-27 15:25:16,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:16,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:16,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:16,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:16,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 824 transitions. [2022-04-27 15:25:16,374 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 824 transitions. Word has length 97 [2022-04-27 15:25:16,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:16,374 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 824 transitions. [2022-04-27 15:25:16,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:16,374 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 824 transitions. [2022-04-27 15:25:16,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-27 15:25:16,376 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:16,377 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:25:16,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:25:16,377 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:16,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:16,377 INFO L85 PathProgramCache]: Analyzing trace with hash -120492913, now seen corresponding path program 1 times [2022-04-27 15:25:16,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:16,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409695324] [2022-04-27 15:25:16,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:16,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:25:17,460 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 15:25:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:25:17,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 15:25:17,969 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 15:25:17,970 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:25:17,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:25:17,974 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:17,977 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:25:18,055 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 15:25:18,055 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 15:25:18,055 WARN L170 areAnnotationChecker]: ssl3_get_client_methodENTRY has no Hoare annotation [2022-04-27 15:25:18,055 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 15:25:18,055 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 15:25:18,055 WARN L170 areAnnotationChecker]: ssl3_connectENTRY has no Hoare annotation [2022-04-27 15:25:18,055 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 15:25:18,055 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-27 15:25:18,055 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-27 15:25:18,055 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-27 15:25:18,055 WARN L170 areAnnotationChecker]: SSLv3_client_methodENTRY has no Hoare annotation [2022-04-27 15:25:18,055 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 15:25:18,055 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:25:18,055 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-27 15:25:18,055 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-27 15:25:18,055 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 15:25:18,055 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 15:25:18,055 WARN L170 areAnnotationChecker]: L1132 has no Hoare annotation [2022-04-27 15:25:18,055 WARN L170 areAnnotationChecker]: L1132 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L1675 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L1675 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: ssl3_get_client_methodFINAL has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L1135-2 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L1135 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L1135 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L1098-1 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L1675-1 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-27 15:25:18,056 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: L1064-1 has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: SSLv3_client_methodFINAL has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: SSLv3_client_methodEXIT has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: L1655 has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: L1066-1 has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: L1659 has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: L1659 has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-27 15:25:18,057 WARN L170 areAnnotationChecker]: L1659-2 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1156 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: ssl3_connectFINAL has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1261 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: ssl3_connectEXIT has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1266-2 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1278 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1278 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1174 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-27 15:25:18,058 WARN L170 areAnnotationChecker]: L1278-2 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1278-2 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1316 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1316 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1286 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1286 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1302 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1302 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1316-2 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1316-2 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1180 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1588 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1328 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1328 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1337 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1337 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1340-2 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1340-2 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1340 has no Hoare annotation [2022-04-27 15:25:18,059 WARN L170 areAnnotationChecker]: L1340 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1186 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1625 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1625 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1624-1 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1351-2 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1360-2 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1364 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1364 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-27 15:25:18,060 WARN L170 areAnnotationChecker]: L1364-2 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1364-2 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1381 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1381 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1381-2 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1381-2 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1198 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1393 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1393 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-27 15:25:18,061 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1216 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1424-2 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1222 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1447 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1447 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-27 15:25:18,062 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1228 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1453-2 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1484-2 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1484-2 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-27 15:25:18,063 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1495 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1495 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1512 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1512 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1514 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1514 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1512-1 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1534-2 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-27 15:25:18,064 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-27 15:25:18,065 WARN L170 areAnnotationChecker]: L1542-1 has no Hoare annotation [2022-04-27 15:25:18,065 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-27 15:25:18,065 WARN L170 areAnnotationChecker]: L1255 has no Hoare annotation [2022-04-27 15:25:18,065 WARN L170 areAnnotationChecker]: L1558 has no Hoare annotation [2022-04-27 15:25:18,065 WARN L170 areAnnotationChecker]: L1558 has no Hoare annotation [2022-04-27 15:25:18,065 WARN L170 areAnnotationChecker]: L1558-2 has no Hoare annotation [2022-04-27 15:25:18,065 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-27 15:25:18,065 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-27 15:25:18,065 WARN L170 areAnnotationChecker]: L1563-2 has no Hoare annotation [2022-04-27 15:25:18,065 WARN L170 areAnnotationChecker]: L1570 has no Hoare annotation [2022-04-27 15:25:18,065 WARN L170 areAnnotationChecker]: L1570 has no Hoare annotation [2022-04-27 15:25:18,065 WARN L170 areAnnotationChecker]: L1570-2 has no Hoare annotation [2022-04-27 15:25:18,065 WARN L170 areAnnotationChecker]: L1578 has no Hoare annotation [2022-04-27 15:25:18,065 WARN L170 areAnnotationChecker]: L1578 has no Hoare annotation [2022-04-27 15:25:18,065 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 15:25:18,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:25:18 BoogieIcfgContainer [2022-04-27 15:25:18,066 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:25:18,066 INFO L158 Benchmark]: Toolchain (without parser) took 43770.23ms. Allocated memory was 233.8MB in the beginning and 380.6MB in the end (delta: 146.8MB). Free memory was 173.3MB in the beginning and 209.1MB in the end (delta: -35.8MB). Peak memory consumption was 202.9MB. Max. memory is 8.0GB. [2022-04-27 15:25:18,067 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 233.8MB. Free memory is still 191.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:25:18,067 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.08ms. Allocated memory was 233.8MB in the beginning and 316.7MB in the end (delta: 82.8MB). Free memory was 173.2MB in the beginning and 262.9MB in the end (delta: -89.8MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. [2022-04-27 15:25:18,067 INFO L158 Benchmark]: Boogie Preprocessor took 119.27ms. Allocated memory is still 316.7MB. Free memory was 262.9MB in the beginning and 253.4MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 15:25:18,067 INFO L158 Benchmark]: RCFGBuilder took 2238.13ms. Allocated memory is still 316.7MB. Free memory was 253.4MB in the beginning and 149.6MB in the end (delta: 103.8MB). Peak memory consumption was 103.8MB. Max. memory is 8.0GB. [2022-04-27 15:25:18,067 INFO L158 Benchmark]: TraceAbstraction took 40885.70ms. Allocated memory was 316.7MB in the beginning and 380.6MB in the end (delta: 64.0MB). Free memory was 149.1MB in the beginning and 209.1MB in the end (delta: -60.0MB). Peak memory consumption was 96.2MB. Max. memory is 8.0GB. [2022-04-27 15:25:18,068 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 233.8MB. Free memory is still 191.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 523.08ms. Allocated memory was 233.8MB in the beginning and 316.7MB in the end (delta: 82.8MB). Free memory was 173.2MB in the beginning and 262.9MB in the end (delta: -89.8MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 119.27ms. Allocated memory is still 316.7MB. Free memory was 262.9MB in the beginning and 253.4MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2238.13ms. Allocated memory is still 316.7MB. Free memory was 253.4MB in the beginning and 149.6MB in the end (delta: 103.8MB). Peak memory consumption was 103.8MB. Max. memory is 8.0GB. * TraceAbstraction took 40885.70ms. Allocated memory was 316.7MB in the beginning and 380.6MB in the end (delta: 64.0MB). Free memory was 149.1MB in the beginning and 209.1MB in the end (delta: -60.0MB). Peak memory consumption was 96.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1665]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1360. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=4294967300, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={4:0}] [L1077] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1081] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1082] s->ctx = malloc(sizeof(SSL_CTX)) [L1083] s->session = malloc(sizeof(SSL_SESSION)) [L1084] s->state = 12292 [L1085] s->version = __VERIFIER_nondet_int() [L1087] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1088] EXPR s->ctx [L1088] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1089] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1090] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1091] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->flags = __VERIFIER_nondet_long() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1094] EXPR s->s3 [L1094] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1096] EXPR s->s3 [L1096] (s->s3)->tmp.next_state = __VERIFIER_nondet_int() [L1098] CALL ssl3_connect(s) VAL [init=1, s={-10:0}, SSLv3_client_data={4:0}] [L1104] BUF_MEM *buf ; [L1105] unsigned long tmp ; [L1106] unsigned long l ; [L1107] long num1 ; [L1108] void (*cb)() ; [L1109] int ret ; [L1110] int new_state ; [L1111] int state ; [L1112] int skip ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 = __VERIFIER_nondet_int() ; [L1120] int tmp___8 = __VERIFIER_nondet_int() ; [L1121] long tmp___9 = __VERIFIER_nondet_long() ; [L1122] int blastFlag ; [L1125] blastFlag = 0 [L1126] s->hit=__VERIFIER_nondet_int () [L1127] s->state = 12292 [L1128] tmp = __VERIFIER_nondet_int() [L1129] cb = (void (*)())((void *)0) [L1130] ret = -1 [L1131] skip = 0 [L1132] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->info_callback={0:-6}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1132] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1133] EXPR s->info_callback [L1133] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND TRUE s->state == 12292 [L1258] s->new_session = 1 [L1259] s->state = 4096 [L1260] EXPR s->ctx [L1260] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1260] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1265] s->server = 0 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1266] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1271] EXPR s->version VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->version=-5, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1271] COND FALSE !((s->version & 65280) != 768) [L1277] s->type = 4096 [L1278] EXPR s->init_buf VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->init_buf={0:15}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1278] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1296] COND FALSE !(! tmp___4) VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1302] COND FALSE !(! tmp___5) [L1308] s->state = 4368 [L1309] EXPR s->ctx [L1309] EXPR (s->ctx)->stats.sess_connect [L1309] (s->ctx)->stats.sess_connect += 1 [L1310] s->init_num = 0 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967343, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND TRUE s->state == 4368 [L1314] s->shutdown = 0 [L1315] ret = __VERIFIER_nondet_int() [L1316] COND TRUE blastFlag == 0 [L1317] blastFlag = 1 VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1321] COND FALSE !(ret <= 0) [L1326] s->state = 4384 [L1327] s->init_num = 0 [L1328] EXPR s->bbio [L1328] EXPR s->wbio VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->bbio={0:-11}, s->wbio={0:-13}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1328] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967343, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1176] COND TRUE s->state == 4384 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1346] COND FALSE !(ret <= 0) [L1351] s->hit VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1351] COND FALSE !(s->hit) [L1354] s->state = 4400 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1356] s->init_num = 0 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967343, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1182] COND TRUE s->state == 4400 [L1360] EXPR s->s3 [L1360] EXPR (s->s3)->tmp.new_cipher [L1360] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-6}, ((s->s3)->tmp.new_cipher)->algorithms=4294967346, (s->s3)->tmp.new_cipher={-8:0}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1360] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 2 [L1365] blastFlag = 3 VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1369] COND FALSE !(ret <= 0) VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1375] s->state = 4416 [L1376] s->init_num = 0 VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967343, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1188] COND TRUE s->state == 4416 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 3 [L1382] blastFlag = 4 VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1386] COND FALSE !(ret <= 0) [L1391] s->state = 4432 [L1392] s->init_num = 0 VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1393] COND FALSE !(! tmp___6) VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967343, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1188] COND FALSE !(s->state == 4416) [L1191] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1191] COND FALSE !(s->state == 4417) [L1194] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1194] COND TRUE s->state == 4432 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:-6}, blastFlag=4, init=1, ret=0, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1665] reach_error() VAL [={0:-6}, blastFlag=4, init=1, ret=0, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 169 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.8s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 35.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 772 SdHoareTripleChecker+Valid, 25.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 772 mSDsluCounter, 4676 SdHoareTripleChecker+Invalid, 25.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2486 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3578 IncrementalHoareTripleChecker+Invalid, 3740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 2190 mSDtfsCounter, 3578 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=563occurred in iteration=11, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 382 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 874 NumberOfCodeBlocks, 874 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 745 ConstructedInterpolants, 0 QuantifiedInterpolants, 1704 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 410/410 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-27 15:25:18,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...