/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 15:10:16,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 15:10:16,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 15:10:16,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 15:10:16,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 15:10:16,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 15:10:16,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 15:10:16,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 15:10:16,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 15:10:16,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 15:10:16,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 15:10:16,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 15:10:16,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 15:10:16,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 15:10:16,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 15:10:16,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 15:10:16,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 15:10:16,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 15:10:16,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 15:10:16,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 15:10:16,680 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 15:10:16,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 15:10:16,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 15:10:16,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 15:10:16,683 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 15:10:16,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 15:10:16,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 15:10:16,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 15:10:16,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 15:10:16,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 15:10:16,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 15:10:16,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 15:10:16,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 15:10:16,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 15:10:16,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 15:10:16,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 15:10:16,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 15:10:16,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 15:10:16,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 15:10:16,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 15:10:16,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 15:10:16,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 15:10:16,696 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 15:10:16,703 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 15:10:16,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 15:10:16,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 15:10:16,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 15:10:16,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 15:10:16,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 15:10:16,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 15:10:16,706 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 15:10:16,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 15:10:16,706 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 15:10:16,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 15:10:16,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 15:10:16,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 15:10:16,711 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 15:10:16,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 15:10:16,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 15:10:16,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 15:10:16,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 15:10:16,712 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 15:10:16,712 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 15:10:16,712 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 15:10:16,712 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 15:10:16,713 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-08 15:10:16,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 15:10:16,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 15:10:16,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 15:10:16,936 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 15:10:16,936 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 15:10:16,938 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c [2022-04-08 15:10:16,988 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/741731b07/9fbdac99f544489287af3a6fe744e3b0/FLAG1279fe462 [2022-04-08 15:10:17,527 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 15:10:17,537 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c [2022-04-08 15:10:17,566 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/741731b07/9fbdac99f544489287af3a6fe744e3b0/FLAG1279fe462 [2022-04-08 15:10:17,823 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/741731b07/9fbdac99f544489287af3a6fe744e3b0 [2022-04-08 15:10:17,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 15:10:17,829 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 15:10:17,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 15:10:17,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 15:10:17,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 15:10:17,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:10:17" (1/1) ... [2022-04-08 15:10:17,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be3535b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:10:17, skipping insertion in model container [2022-04-08 15:10:17,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:10:17" (1/1) ... [2022-04-08 15:10:17,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 15:10:17,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 15:10:18,298 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.01.i.cil-2.c[65520,65533] [2022-04-08 15:10:18,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 15:10:18,319 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 15:10:18,455 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.01.i.cil-2.c[65520,65533] [2022-04-08 15:10:18,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 15:10:18,484 INFO L208 MainTranslator]: Completed translation [2022-04-08 15:10:18,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:10:18 WrapperNode [2022-04-08 15:10:18,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 15:10:18,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 15:10:18,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 15:10:18,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 15:10:18,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:10:18" (1/1) ... [2022-04-08 15:10:18,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:10:18" (1/1) ... [2022-04-08 15:10:18,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:10:18" (1/1) ... [2022-04-08 15:10:18,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:10:18" (1/1) ... [2022-04-08 15:10:18,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:10:18" (1/1) ... [2022-04-08 15:10:18,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:10:18" (1/1) ... [2022-04-08 15:10:18,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:10:18" (1/1) ... [2022-04-08 15:10:18,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 15:10:18,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 15:10:18,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 15:10:18,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 15:10:18,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:10:18" (1/1) ... [2022-04-08 15:10:18,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 15:10:18,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 15:10:18,652 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-08 15:10:18,667 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-08 15:10:18,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 15:10:18,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 15:10:18,686 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 15:10:18,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-08 15:10:18,687 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-08 15:10:18,687 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 15:10:18,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-08 15:10:18,687 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 15:10:18,687 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 15:10:18,687 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 15:10:18,687 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 15:10:18,687 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 15:10:18,687 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 15:10:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 15:10:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 15:10:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 15:10:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 15:10:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 15:10:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 15:10:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 15:10:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-08 15:10:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 15:10:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-08 15:10:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-08 15:10:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 15:10:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 15:10:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 15:10:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 15:10:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 15:10:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 15:10:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 15:10:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 15:10:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 15:10:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 15:10:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 15:10:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 15:10:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 15:10:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 15:10:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 15:10:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 15:10:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 15:10:18,831 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 15:10:18,833 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 15:10:20,438 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:10:20,911 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-08 15:10:20,911 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-08 15:10:20,923 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 15:10:20,932 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 15:10:20,932 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 15:10:20,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:10:20 BoogieIcfgContainer [2022-04-08 15:10:20,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 15:10:20,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 15:10:20,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 15:10:20,939 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 15:10:20,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:10:17" (1/3) ... [2022-04-08 15:10:20,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db00067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:10:20, skipping insertion in model container [2022-04-08 15:10:20,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:10:18" (2/3) ... [2022-04-08 15:10:20,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db00067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:10:20, skipping insertion in model container [2022-04-08 15:10:20,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:10:20" (3/3) ... [2022-04-08 15:10:20,942 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2022-04-08 15:10:20,947 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 15:10:20,947 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 15:10:20,985 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 15:10:20,990 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-08 15:10:20,990 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 15:10:21,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 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-08 15:10:21,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 15:10:21,023 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:10:21,023 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:10:21,024 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:10:21,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:10:21,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1896540148, now seen corresponding path program 1 times [2022-04-08 15:10:21,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:10:21,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1552704349] [2022-04-08 15:10:21,043 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:10:21,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1896540148, now seen corresponding path program 2 times [2022-04-08 15:10:21,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:10:21,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115758974] [2022-04-08 15:10:21,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:10:21,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:10:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:21,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:10:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:21,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {143#true} is VALID [2022-04-08 15:10:21,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-08 15:10:21,718 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {143#true} {143#true} #591#return; {143#true} is VALID [2022-04-08 15:10:21,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {143#true} call ULTIMATE.init(); {150#(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-08 15:10:21,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {143#true} is VALID [2022-04-08 15:10:21,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-08 15:10:21,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {143#true} {143#true} #591#return; {143#true} is VALID [2022-04-08 15:10:21,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {143#true} call #t~ret159 := main(); {143#true} is VALID [2022-04-08 15:10:21,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {143#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {143#true} is VALID [2022-04-08 15:10:21,722 INFO L272 TraceCheckUtils]: 6: Hoare triple {143#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {143#true} is VALID [2022-04-08 15:10:21,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {143#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:21,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:21,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:21,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 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)))); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:21,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:21,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:21,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:21,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:21,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:21,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:21,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:21,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:21,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:21,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:21,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:21,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:21,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:21,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:21,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {149#(not (= |ssl3_connect_#t~mem56| 4432))} is VALID [2022-04-08 15:10:21,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {149#(not (= |ssl3_connect_#t~mem56| 4432))} assume 4432 == #t~mem56;havoc #t~mem56; {144#false} is VALID [2022-04-08 15:10:21,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {144#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {144#false} is VALID [2022-04-08 15:10:21,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {144#false} assume 5 == ~blastFlag~0; {144#false} is VALID [2022-04-08 15:10:21,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {144#false} assume !false; {144#false} is VALID [2022-04-08 15:10:21,739 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-08 15:10:21,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:10:21,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115758974] [2022-04-08 15:10:21,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115758974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:10:21,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:10:21,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:10:21,744 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:10:21,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1552704349] [2022-04-08 15:10:21,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1552704349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:10:21,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:10:21,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:10:21,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262082417] [2022-04-08 15:10:21,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:10:21,750 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-08 15:10:21,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:10:21,755 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-08 15:10:21,793 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-08 15:10:21,794 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:10:21,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:10:21,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:10:21,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:10:21,816 INFO L87 Difference]: Start difference. First operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 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-08 15:10:23,869 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-08 15:10:25,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:25,625 INFO L93 Difference]: Finished difference Result 375 states and 621 transitions. [2022-04-08 15:10:25,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:10:25,626 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-08 15:10:25,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:10:25,627 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-08 15:10:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2022-04-08 15:10:25,642 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-08 15:10:25,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2022-04-08 15:10:25,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 621 transitions. [2022-04-08 15:10:26,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 621 edges. 621 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:26,206 INFO L225 Difference]: With dead ends: 375 [2022-04-08 15:10:26,207 INFO L226 Difference]: Without dead ends: 214 [2022-04-08 15:10:26,211 INFO L912 BasicCegarLoop]: 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-08 15:10:26,218 INFO L913 BasicCegarLoop]: 139 mSDtfsCounter, 141 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 47 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-08 15:10:26,219 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 405 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 457 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-04-08 15:10:26,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-04-08 15:10:26,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 144. [2022-04-08 15:10:26,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:10:26,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 144 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 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-08 15:10:26,277 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 144 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 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-08 15:10:26,277 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 144 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 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-08 15:10:26,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:26,291 INFO L93 Difference]: Finished difference Result 214 states and 319 transitions. [2022-04-08 15:10:26,292 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 319 transitions. [2022-04-08 15:10:26,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:10:26,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:10:26,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 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 214 states. [2022-04-08 15:10:26,301 INFO L87 Difference]: Start difference. First operand has 144 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 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 214 states. [2022-04-08 15:10:26,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:26,312 INFO L93 Difference]: Finished difference Result 214 states and 319 transitions. [2022-04-08 15:10:26,312 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 319 transitions. [2022-04-08 15:10:26,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:10:26,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:10:26,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:10:26,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:10:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 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-08 15:10:26,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 219 transitions. [2022-04-08 15:10:26,322 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 219 transitions. Word has length 30 [2022-04-08 15:10:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:10:26,322 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 219 transitions. [2022-04-08 15:10:26,322 INFO L479 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-08 15:10:26,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 219 transitions. [2022-04-08 15:10:26,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:26,529 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 219 transitions. [2022-04-08 15:10:26,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 15:10:26,530 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:10:26,530 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:10:26,530 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 15:10:26,531 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:10:26,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:10:26,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1332379691, now seen corresponding path program 1 times [2022-04-08 15:10:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:10:26,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1185619279] [2022-04-08 15:10:26,532 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:10:26,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1332379691, now seen corresponding path program 2 times [2022-04-08 15:10:26,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:10:26,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721470472] [2022-04-08 15:10:26,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:10:26,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:10:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:26,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:10:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:26,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {1628#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1621#true} is VALID [2022-04-08 15:10:26,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {1621#true} assume true; {1621#true} is VALID [2022-04-08 15:10:26,773 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1621#true} {1621#true} #591#return; {1621#true} is VALID [2022-04-08 15:10:26,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {1621#true} call ULTIMATE.init(); {1628#(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-08 15:10:26,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {1628#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1621#true} is VALID [2022-04-08 15:10:26,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {1621#true} assume true; {1621#true} is VALID [2022-04-08 15:10:26,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1621#true} {1621#true} #591#return; {1621#true} is VALID [2022-04-08 15:10:26,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {1621#true} call #t~ret159 := main(); {1621#true} is VALID [2022-04-08 15:10:26,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {1621#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {1621#true} is VALID [2022-04-08 15:10:26,777 INFO L272 TraceCheckUtils]: 6: Hoare triple {1621#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1621#true} is VALID [2022-04-08 15:10:26,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {1621#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:10:26,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:10:26,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:10:26,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 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)))); {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:10:26,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:10:26,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {1627#(= 12292 |ssl3_connect_#t~mem43|)} is VALID [2022-04-08 15:10:26,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {1627#(= 12292 |ssl3_connect_#t~mem43|)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-08 15:10:26,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {1622#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-08 15:10:26,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {1622#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-08 15:10:26,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {1622#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-08 15:10:26,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {1622#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-08 15:10:26,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {1622#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-08 15:10:26,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {1622#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-08 15:10:26,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {1622#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-08 15:10:26,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {1622#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-08 15:10:26,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {1622#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-08 15:10:26,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {1622#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-08 15:10:26,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {1622#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-08 15:10:26,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {1622#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-08 15:10:26,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {1622#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-08 15:10:26,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {1622#false} assume 4433 == #t~mem57;havoc #t~mem57; {1622#false} is VALID [2022-04-08 15:10:26,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {1622#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {1622#false} is VALID [2022-04-08 15:10:26,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {1622#false} assume 5 == ~blastFlag~0; {1622#false} is VALID [2022-04-08 15:10:26,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {1622#false} assume !false; {1622#false} is VALID [2022-04-08 15:10:26,792 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-08 15:10:26,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:10:26,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721470472] [2022-04-08 15:10:26,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721470472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:10:26,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:10:26,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:10:26,794 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:10:26,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1185619279] [2022-04-08 15:10:26,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1185619279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:10:26,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:10:26,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:10:26,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693532139] [2022-04-08 15:10:26,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:10:26,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 31 [2022-04-08 15:10:26,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:10:26,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-08 15:10:26,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:26,828 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:10:26,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:10:26,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:10:26,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:10:26,829 INFO L87 Difference]: Start difference. First operand 144 states and 219 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-08 15:10:28,855 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-08 15:10:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:29,727 INFO L93 Difference]: Finished difference Result 279 states and 426 transitions. [2022-04-08 15:10:29,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:10:29,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 31 [2022-04-08 15:10:29,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:10:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-08 15:10:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2022-04-08 15:10:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-08 15:10:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2022-04-08 15:10:29,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 342 transitions. [2022-04-08 15:10:30,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 342 edges. 342 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:30,017 INFO L225 Difference]: With dead ends: 279 [2022-04-08 15:10:30,017 INFO L226 Difference]: Without dead ends: 148 [2022-04-08 15:10:30,018 INFO L912 BasicCegarLoop]: 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-08 15:10:30,019 INFO L913 BasicCegarLoop]: 167 mSDtfsCounter, 7 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:10:30,020 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 423 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 268 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:10:30,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-04-08 15:10:30,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2022-04-08 15:10:30,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:10:30,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 147 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 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-08 15:10:30,031 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 147 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 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-08 15:10:30,031 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 147 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 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-08 15:10:30,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:30,038 INFO L93 Difference]: Finished difference Result 148 states and 223 transitions. [2022-04-08 15:10:30,038 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 223 transitions. [2022-04-08 15:10:30,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:10:30,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:10:30,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 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 148 states. [2022-04-08 15:10:30,040 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 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 148 states. [2022-04-08 15:10:30,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:30,047 INFO L93 Difference]: Finished difference Result 148 states and 223 transitions. [2022-04-08 15:10:30,047 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 223 transitions. [2022-04-08 15:10:30,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:10:30,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:10:30,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:10:30,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:10:30,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 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-08 15:10:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 222 transitions. [2022-04-08 15:10:30,069 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 222 transitions. Word has length 31 [2022-04-08 15:10:30,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:10:30,069 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 222 transitions. [2022-04-08 15:10:30,069 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-08 15:10:30,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 222 transitions. [2022-04-08 15:10:30,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:30,262 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2022-04-08 15:10:30,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 15:10:30,263 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:10:30,264 INFO L499 BasicCegarLoop]: 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, 1, 1] [2022-04-08 15:10:30,264 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 15:10:30,264 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:10:30,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:10:30,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1031742358, now seen corresponding path program 1 times [2022-04-08 15:10:30,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:10:30,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1189554398] [2022-04-08 15:10:30,265 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:10:30,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1031742358, now seen corresponding path program 2 times [2022-04-08 15:10:30,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:10:30,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712328293] [2022-04-08 15:10:30,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:10:30,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:10:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:30,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:10:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:30,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {2787#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2781#true} is VALID [2022-04-08 15:10:30,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-04-08 15:10:30,483 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2781#true} {2781#true} #591#return; {2781#true} is VALID [2022-04-08 15:10:30,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {2781#true} call ULTIMATE.init(); {2787#(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-08 15:10:30,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {2787#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2781#true} is VALID [2022-04-08 15:10:30,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-04-08 15:10:30,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2781#true} {2781#true} #591#return; {2781#true} is VALID [2022-04-08 15:10:30,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {2781#true} call #t~ret159 := main(); {2781#true} is VALID [2022-04-08 15:10:30,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {2781#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {2781#true} is VALID [2022-04-08 15:10:30,486 INFO L272 TraceCheckUtils]: 6: Hoare triple {2781#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {2781#true} is VALID [2022-04-08 15:10:30,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {2781#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {2786#(= 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)))); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !false; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem43;havoc #t~mem43; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 56 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !false; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,495 INFO L290 TraceCheckUtils]: 30: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,498 INFO L290 TraceCheckUtils]: 37: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,498 INFO L290 TraceCheckUtils]: 38: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,499 INFO L290 TraceCheckUtils]: 41: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,500 INFO L290 TraceCheckUtils]: 42: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume 4433 == #t~mem57;havoc #t~mem57; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,500 INFO L290 TraceCheckUtils]: 43: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:10:30,500 INFO L290 TraceCheckUtils]: 44: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {2782#false} is VALID [2022-04-08 15:10:30,501 INFO L290 TraceCheckUtils]: 45: Hoare triple {2782#false} assume !false; {2782#false} is VALID [2022-04-08 15:10:30,501 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-08 15:10:30,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:10:30,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712328293] [2022-04-08 15:10:30,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712328293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:10:30,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:10:30,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:10:30,502 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:10:30,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1189554398] [2022-04-08 15:10:30,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1189554398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:10:30,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:10:30,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:10:30,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738992718] [2022-04-08 15:10:30,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:10:30,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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 46 [2022-04-08 15:10:30,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:10:30,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-08 15:10:30,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:30,548 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:10:30,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:10:30,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:10:30,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:10:30,549 INFO L87 Difference]: Start difference. First operand 147 states and 222 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-08 15:10:32,573 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-08 15:10:33,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:33,336 INFO L93 Difference]: Finished difference Result 405 states and 622 transitions. [2022-04-08 15:10:33,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:10:33,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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 46 [2022-04-08 15:10:33,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:10:33,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-08 15:10:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-08 15:10:33,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-08 15:10:33,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-08 15:10:33,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 493 transitions. [2022-04-08 15:10:33,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:33,751 INFO L225 Difference]: With dead ends: 405 [2022-04-08 15:10:33,751 INFO L226 Difference]: Without dead ends: 274 [2022-04-08 15:10:33,752 INFO L912 BasicCegarLoop]: 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-08 15:10:33,753 INFO L913 BasicCegarLoop]: 168 mSDtfsCounter, 124 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 15:10:33,753 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 323 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 15:10:33,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-04-08 15:10:33,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2022-04-08 15:10:33,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:10:33,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand has 274 states, 269 states have (on average 1.5241635687732342) internal successors, (410), 269 states have internal predecessors, (410), 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-08 15:10:33,771 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand has 274 states, 269 states have (on average 1.5241635687732342) internal successors, (410), 269 states have internal predecessors, (410), 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-08 15:10:33,772 INFO L87 Difference]: Start difference. First operand 274 states. Second operand has 274 states, 269 states have (on average 1.5241635687732342) internal successors, (410), 269 states have internal predecessors, (410), 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-08 15:10:33,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:33,781 INFO L93 Difference]: Finished difference Result 274 states and 414 transitions. [2022-04-08 15:10:33,781 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 414 transitions. [2022-04-08 15:10:33,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:10:33,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:10:33,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 274 states, 269 states have (on average 1.5241635687732342) internal successors, (410), 269 states have internal predecessors, (410), 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 274 states. [2022-04-08 15:10:33,783 INFO L87 Difference]: Start difference. First operand has 274 states, 269 states have (on average 1.5241635687732342) internal successors, (410), 269 states have internal predecessors, (410), 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 274 states. [2022-04-08 15:10:33,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:33,793 INFO L93 Difference]: Finished difference Result 274 states and 414 transitions. [2022-04-08 15:10:33,793 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 414 transitions. [2022-04-08 15:10:33,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:10:33,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:10:33,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:10:33,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:10:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 269 states have (on average 1.5241635687732342) internal successors, (410), 269 states have internal predecessors, (410), 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-08 15:10:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 414 transitions. [2022-04-08 15:10:33,804 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 414 transitions. Word has length 46 [2022-04-08 15:10:33,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:10:33,804 INFO L478 AbstractCegarLoop]: Abstraction has 274 states and 414 transitions. [2022-04-08 15:10:33,804 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-08 15:10:33,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 274 states and 414 transitions. [2022-04-08 15:10:34,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 414 edges. 414 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 414 transitions. [2022-04-08 15:10:34,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 15:10:34,134 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:10:34,134 INFO L499 BasicCegarLoop]: 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, 1, 1] [2022-04-08 15:10:34,134 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 15:10:34,134 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:10:34,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:10:34,135 INFO L85 PathProgramCache]: Analyzing trace with hash -815325844, now seen corresponding path program 1 times [2022-04-08 15:10:34,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:10:34,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [582604142] [2022-04-08 15:10:34,136 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:10:34,136 INFO L85 PathProgramCache]: Analyzing trace with hash -815325844, now seen corresponding path program 2 times [2022-04-08 15:10:34,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:10:34,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746522740] [2022-04-08 15:10:34,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:10:34,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:10:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:34,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:10:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:34,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {4703#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4696#true} is VALID [2022-04-08 15:10:34,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {4696#true} assume true; {4696#true} is VALID [2022-04-08 15:10:34,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4696#true} {4696#true} #591#return; {4696#true} is VALID [2022-04-08 15:10:34,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {4696#true} call ULTIMATE.init(); {4703#(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-08 15:10:34,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {4703#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4696#true} is VALID [2022-04-08 15:10:34,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {4696#true} assume true; {4696#true} is VALID [2022-04-08 15:10:34,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4696#true} {4696#true} #591#return; {4696#true} is VALID [2022-04-08 15:10:34,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {4696#true} call #t~ret159 := main(); {4696#true} is VALID [2022-04-08 15:10:34,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {4696#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {4696#true} is VALID [2022-04-08 15:10:34,413 INFO L272 TraceCheckUtils]: 6: Hoare triple {4696#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4696#true} is VALID [2022-04-08 15:10:34,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {4696#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {4696#true} is VALID [2022-04-08 15:10:34,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {4696#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {4696#true} is VALID [2022-04-08 15:10:34,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {4696#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {4696#true} is VALID [2022-04-08 15:10:34,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {4696#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4696#true} is VALID [2022-04-08 15:10:34,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {4696#true} assume !false; {4696#true} is VALID [2022-04-08 15:10:34,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {4696#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-08 15:10:34,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {4696#true} assume 12292 == #t~mem43;havoc #t~mem43; {4696#true} is VALID [2022-04-08 15:10:34,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {4696#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {4696#true} is VALID [2022-04-08 15:10:34,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {4696#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {4696#true} is VALID [2022-04-08 15:10:34,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {4696#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {4696#true} is VALID [2022-04-08 15:10:34,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {4696#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {4696#true} is VALID [2022-04-08 15:10:34,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {4696#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {4696#true} is VALID [2022-04-08 15:10:34,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {4696#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {4696#true} is VALID [2022-04-08 15:10:34,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {4696#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {4696#true} is VALID [2022-04-08 15:10:34,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {4696#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {4696#true} is VALID [2022-04-08 15:10:34,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {4696#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {4696#true} is VALID [2022-04-08 15:10:34,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {4696#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {4696#true} is VALID [2022-04-08 15:10:34,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {4696#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {4696#true} is VALID [2022-04-08 15:10:34,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {4696#true} ~skip~0 := 0; {4696#true} is VALID [2022-04-08 15:10:34,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {4696#true} assume !false; {4696#true} is VALID [2022-04-08 15:10:34,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {4696#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-08 15:10:34,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {4696#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-08 15:10:34,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {4696#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-08 15:10:34,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {4696#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-08 15:10:34,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {4696#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-08 15:10:34,417 INFO L290 TraceCheckUtils]: 32: Hoare triple {4696#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-08 15:10:34,417 INFO L290 TraceCheckUtils]: 33: Hoare triple {4696#true} assume 4368 == #t~mem48;havoc #t~mem48; {4696#true} is VALID [2022-04-08 15:10:34,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {4696#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {4696#true} is VALID [2022-04-08 15:10:34,418 INFO L290 TraceCheckUtils]: 35: Hoare triple {4696#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4696#true} is VALID [2022-04-08 15:10:34,419 INFO L290 TraceCheckUtils]: 36: Hoare triple {4696#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,420 INFO L290 TraceCheckUtils]: 37: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,420 INFO L290 TraceCheckUtils]: 38: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,420 INFO L290 TraceCheckUtils]: 39: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,421 INFO L290 TraceCheckUtils]: 40: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} ~skip~0 := 0; {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,421 INFO L290 TraceCheckUtils]: 41: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !false; {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,422 INFO L290 TraceCheckUtils]: 42: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,422 INFO L290 TraceCheckUtils]: 43: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,422 INFO L290 TraceCheckUtils]: 44: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,423 INFO L290 TraceCheckUtils]: 46: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,424 INFO L290 TraceCheckUtils]: 47: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,424 INFO L290 TraceCheckUtils]: 49: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,425 INFO L290 TraceCheckUtils]: 50: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,425 INFO L290 TraceCheckUtils]: 51: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,425 INFO L290 TraceCheckUtils]: 52: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,426 INFO L290 TraceCheckUtils]: 53: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,426 INFO L290 TraceCheckUtils]: 54: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,427 INFO L290 TraceCheckUtils]: 55: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:10:34,427 INFO L290 TraceCheckUtils]: 56: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {4702#(not (= |ssl3_connect_#t~mem57| 4433))} is VALID [2022-04-08 15:10:34,428 INFO L290 TraceCheckUtils]: 57: Hoare triple {4702#(not (= |ssl3_connect_#t~mem57| 4433))} assume 4433 == #t~mem57;havoc #t~mem57; {4697#false} is VALID [2022-04-08 15:10:34,428 INFO L290 TraceCheckUtils]: 58: Hoare triple {4697#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {4697#false} is VALID [2022-04-08 15:10:34,428 INFO L290 TraceCheckUtils]: 59: Hoare triple {4697#false} assume 5 == ~blastFlag~0; {4697#false} is VALID [2022-04-08 15:10:34,428 INFO L290 TraceCheckUtils]: 60: Hoare triple {4697#false} assume !false; {4697#false} is VALID [2022-04-08 15:10:34,429 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-08 15:10:34,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:10:34,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746522740] [2022-04-08 15:10:34,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746522740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:10:34,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:10:34,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:10:34,429 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:10:34,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [582604142] [2022-04-08 15:10:34,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [582604142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:10:34,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:10:34,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:10:34,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971775239] [2022-04-08 15:10:34,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:10:34,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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 61 [2022-04-08 15:10:34,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:10:34,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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-08 15:10:34,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:34,480 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:10:34,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:10:34,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:10:34,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:10:34,481 INFO L87 Difference]: Start difference. First operand 274 states and 414 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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-08 15:10:36,504 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-08 15:10:37,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:37,668 INFO L93 Difference]: Finished difference Result 717 states and 1086 transitions. [2022-04-08 15:10:37,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:10:37,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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 61 [2022-04-08 15:10:37,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:10:37,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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-08 15:10:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-08 15:10:37,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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-08 15:10:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-08 15:10:37,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-08 15:10:38,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:38,092 INFO L225 Difference]: With dead ends: 717 [2022-04-08 15:10:38,092 INFO L226 Difference]: Without dead ends: 459 [2022-04-08 15:10:38,093 INFO L912 BasicCegarLoop]: 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-08 15:10:38,094 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 107 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:10:38,094 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 284 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:10:38,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-04-08 15:10:38,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 324. [2022-04-08 15:10:38,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:10:38,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 459 states. Second operand has 324 states, 319 states have (on average 1.561128526645768) internal successors, (498), 319 states have internal predecessors, (498), 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-08 15:10:38,117 INFO L74 IsIncluded]: Start isIncluded. First operand 459 states. Second operand has 324 states, 319 states have (on average 1.561128526645768) internal successors, (498), 319 states have internal predecessors, (498), 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-08 15:10:38,118 INFO L87 Difference]: Start difference. First operand 459 states. Second operand has 324 states, 319 states have (on average 1.561128526645768) internal successors, (498), 319 states have internal predecessors, (498), 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-08 15:10:38,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:38,132 INFO L93 Difference]: Finished difference Result 459 states and 690 transitions. [2022-04-08 15:10:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 690 transitions. [2022-04-08 15:10:38,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:10:38,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:10:38,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 324 states, 319 states have (on average 1.561128526645768) internal successors, (498), 319 states have internal predecessors, (498), 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 459 states. [2022-04-08 15:10:38,135 INFO L87 Difference]: Start difference. First operand has 324 states, 319 states have (on average 1.561128526645768) internal successors, (498), 319 states have internal predecessors, (498), 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 459 states. [2022-04-08 15:10:38,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:38,149 INFO L93 Difference]: Finished difference Result 459 states and 690 transitions. [2022-04-08 15:10:38,149 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 690 transitions. [2022-04-08 15:10:38,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:10:38,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:10:38,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:10:38,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:10:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 319 states have (on average 1.561128526645768) internal successors, (498), 319 states have internal predecessors, (498), 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-08 15:10:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 502 transitions. [2022-04-08 15:10:38,161 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 502 transitions. Word has length 61 [2022-04-08 15:10:38,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:10:38,161 INFO L478 AbstractCegarLoop]: Abstraction has 324 states and 502 transitions. [2022-04-08 15:10:38,161 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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-08 15:10:38,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 324 states and 502 transitions. [2022-04-08 15:10:38,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 502 edges. 502 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:38,552 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 502 transitions. [2022-04-08 15:10:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-08 15:10:38,553 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:10:38,553 INFO L499 BasicCegarLoop]: 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, 1, 1, 1] [2022-04-08 15:10:38,553 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 15:10:38,553 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:10:38,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:10:38,554 INFO L85 PathProgramCache]: Analyzing trace with hash 490445606, now seen corresponding path program 1 times [2022-04-08 15:10:38,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:10:38,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1682513016] [2022-04-08 15:10:38,554 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:10:38,555 INFO L85 PathProgramCache]: Analyzing trace with hash 490445606, now seen corresponding path program 2 times [2022-04-08 15:10:38,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:10:38,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903495463] [2022-04-08 15:10:38,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:10:38,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:10:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:38,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:10:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:38,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7708#true} is VALID [2022-04-08 15:10:38,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {7708#true} assume true; {7708#true} is VALID [2022-04-08 15:10:38,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7708#true} {7708#true} #591#return; {7708#true} is VALID [2022-04-08 15:10:38,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {7708#true} call ULTIMATE.init(); {7715#(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-08 15:10:38,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7708#true} is VALID [2022-04-08 15:10:38,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {7708#true} assume true; {7708#true} is VALID [2022-04-08 15:10:38,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7708#true} {7708#true} #591#return; {7708#true} is VALID [2022-04-08 15:10:38,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {7708#true} call #t~ret159 := main(); {7708#true} is VALID [2022-04-08 15:10:38,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {7708#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {7708#true} is VALID [2022-04-08 15:10:38,810 INFO L272 TraceCheckUtils]: 6: Hoare triple {7708#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7708#true} is VALID [2022-04-08 15:10:38,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {7708#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {7708#true} is VALID [2022-04-08 15:10:38,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {7708#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {7708#true} is VALID [2022-04-08 15:10:38,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {7708#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {7708#true} is VALID [2022-04-08 15:10:38,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {7708#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7708#true} is VALID [2022-04-08 15:10:38,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {7708#true} assume !false; {7708#true} is VALID [2022-04-08 15:10:38,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {7708#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-08 15:10:38,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {7708#true} assume 12292 == #t~mem43;havoc #t~mem43; {7708#true} is VALID [2022-04-08 15:10:38,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {7708#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {7708#true} is VALID [2022-04-08 15:10:38,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {7708#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {7708#true} is VALID [2022-04-08 15:10:38,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {7708#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {7708#true} is VALID [2022-04-08 15:10:38,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {7708#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {7708#true} is VALID [2022-04-08 15:10:38,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {7708#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {7708#true} is VALID [2022-04-08 15:10:38,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {7708#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {7708#true} is VALID [2022-04-08 15:10:38,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {7708#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {7708#true} is VALID [2022-04-08 15:10:38,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {7708#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {7708#true} is VALID [2022-04-08 15:10:38,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {7708#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {7708#true} is VALID [2022-04-08 15:10:38,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {7708#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {7708#true} is VALID [2022-04-08 15:10:38,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {7708#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7708#true} is VALID [2022-04-08 15:10:38,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {7708#true} ~skip~0 := 0; {7708#true} is VALID [2022-04-08 15:10:38,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {7708#true} assume !false; {7708#true} is VALID [2022-04-08 15:10:38,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {7708#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-08 15:10:38,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {7708#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-08 15:10:38,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {7708#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-08 15:10:38,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {7708#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-08 15:10:38,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {7708#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-08 15:10:38,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {7708#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-08 15:10:38,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {7708#true} assume 4368 == #t~mem48;havoc #t~mem48; {7708#true} is VALID [2022-04-08 15:10:38,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {7708#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {7708#true} is VALID [2022-04-08 15:10:38,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {7708#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7708#true} is VALID [2022-04-08 15:10:38,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {7708#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,816 INFO L290 TraceCheckUtils]: 37: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,817 INFO L290 TraceCheckUtils]: 40: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} ~skip~0 := 0; {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !false; {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,818 INFO L290 TraceCheckUtils]: 42: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,818 INFO L290 TraceCheckUtils]: 43: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,819 INFO L290 TraceCheckUtils]: 46: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,820 INFO L290 TraceCheckUtils]: 47: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,820 INFO L290 TraceCheckUtils]: 48: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,821 INFO L290 TraceCheckUtils]: 49: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,821 INFO L290 TraceCheckUtils]: 50: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,821 INFO L290 TraceCheckUtils]: 51: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,822 INFO L290 TraceCheckUtils]: 52: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,822 INFO L290 TraceCheckUtils]: 53: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,823 INFO L290 TraceCheckUtils]: 54: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,823 INFO L290 TraceCheckUtils]: 55: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,823 INFO L290 TraceCheckUtils]: 56: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-08 15:10:38,824 INFO L290 TraceCheckUtils]: 57: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {7714#(not (= |ssl3_connect_#t~mem58| 4448))} is VALID [2022-04-08 15:10:38,824 INFO L290 TraceCheckUtils]: 58: Hoare triple {7714#(not (= |ssl3_connect_#t~mem58| 4448))} assume 4448 == #t~mem58;havoc #t~mem58; {7709#false} is VALID [2022-04-08 15:10:38,824 INFO L290 TraceCheckUtils]: 59: Hoare triple {7709#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {7709#false} is VALID [2022-04-08 15:10:38,826 INFO L290 TraceCheckUtils]: 60: Hoare triple {7709#false} assume 4 == ~blastFlag~0; {7709#false} is VALID [2022-04-08 15:10:38,826 INFO L290 TraceCheckUtils]: 61: Hoare triple {7709#false} assume !false; {7709#false} is VALID [2022-04-08 15:10:38,827 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-08 15:10:38,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:10:38,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903495463] [2022-04-08 15:10:38,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903495463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:10:38,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:10:38,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:10:38,828 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:10:38,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1682513016] [2022-04-08 15:10:38,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1682513016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:10:38,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:10:38,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:10:38,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168060844] [2022-04-08 15:10:38,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:10:38,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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 62 [2022-04-08 15:10:38,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:10:38,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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-08 15:10:38,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:38,884 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:10:38,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:10:38,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:10:38,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:10:38,885 INFO L87 Difference]: Start difference. First operand 324 states and 502 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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-08 15:10:40,922 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-08 15:10:42,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:42,172 INFO L93 Difference]: Finished difference Result 817 states and 1258 transitions. [2022-04-08 15:10:42,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:10:42,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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 62 [2022-04-08 15:10:42,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:10:42,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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-08 15:10:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-08 15:10:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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-08 15:10:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-08 15:10:42,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-08 15:10:42,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:42,608 INFO L225 Difference]: With dead ends: 817 [2022-04-08 15:10:42,608 INFO L226 Difference]: Without dead ends: 509 [2022-04-08 15:10:42,609 INFO L912 BasicCegarLoop]: 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-08 15:10:42,616 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 105 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:10:42,617 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 284 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:10:42,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-04-08 15:10:42,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 376. [2022-04-08 15:10:42,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:10:42,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 509 states. Second operand has 376 states, 371 states have (on average 1.5795148247978437) internal successors, (586), 371 states have internal predecessors, (586), 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-08 15:10:42,648 INFO L74 IsIncluded]: Start isIncluded. First operand 509 states. Second operand has 376 states, 371 states have (on average 1.5795148247978437) internal successors, (586), 371 states have internal predecessors, (586), 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-08 15:10:42,649 INFO L87 Difference]: Start difference. First operand 509 states. Second operand has 376 states, 371 states have (on average 1.5795148247978437) internal successors, (586), 371 states have internal predecessors, (586), 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-08 15:10:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:42,665 INFO L93 Difference]: Finished difference Result 509 states and 774 transitions. [2022-04-08 15:10:42,665 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 774 transitions. [2022-04-08 15:10:42,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:10:42,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:10:42,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 376 states, 371 states have (on average 1.5795148247978437) internal successors, (586), 371 states have internal predecessors, (586), 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 509 states. [2022-04-08 15:10:42,668 INFO L87 Difference]: Start difference. First operand has 376 states, 371 states have (on average 1.5795148247978437) internal successors, (586), 371 states have internal predecessors, (586), 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 509 states. [2022-04-08 15:10:42,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:42,682 INFO L93 Difference]: Finished difference Result 509 states and 774 transitions. [2022-04-08 15:10:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 774 transitions. [2022-04-08 15:10:42,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:10:42,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:10:42,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:10:42,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:10:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 371 states have (on average 1.5795148247978437) internal successors, (586), 371 states have internal predecessors, (586), 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-08 15:10:42,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 590 transitions. [2022-04-08 15:10:42,696 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 590 transitions. Word has length 62 [2022-04-08 15:10:42,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:10:42,696 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 590 transitions. [2022-04-08 15:10:42,696 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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-08 15:10:42,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 376 states and 590 transitions. [2022-04-08 15:10:43,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 590 transitions. [2022-04-08 15:10:43,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 15:10:43,215 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:10:43,215 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1] [2022-04-08 15:10:43,215 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 15:10:43,215 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:10:43,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:10:43,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1980532473, now seen corresponding path program 1 times [2022-04-08 15:10:43,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:10:43,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [401335537] [2022-04-08 15:10:43,216 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:10:43,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1980532473, now seen corresponding path program 2 times [2022-04-08 15:10:43,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:10:43,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632654100] [2022-04-08 15:10:43,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:10:43,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:10:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:43,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:10:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:43,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {11131#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11124#true} is VALID [2022-04-08 15:10:43,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {11124#true} assume true; {11124#true} is VALID [2022-04-08 15:10:43,466 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11124#true} {11124#true} #591#return; {11124#true} is VALID [2022-04-08 15:10:43,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {11124#true} call ULTIMATE.init(); {11131#(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-08 15:10:43,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {11131#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11124#true} is VALID [2022-04-08 15:10:43,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {11124#true} assume true; {11124#true} is VALID [2022-04-08 15:10:43,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11124#true} {11124#true} #591#return; {11124#true} is VALID [2022-04-08 15:10:43,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {11124#true} call #t~ret159 := main(); {11124#true} is VALID [2022-04-08 15:10:43,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {11124#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {11124#true} is VALID [2022-04-08 15:10:43,479 INFO L272 TraceCheckUtils]: 6: Hoare triple {11124#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11124#true} is VALID [2022-04-08 15:10:43,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {11124#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {11124#true} is VALID [2022-04-08 15:10:43,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {11124#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {11124#true} is VALID [2022-04-08 15:10:43,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {11124#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {11124#true} is VALID [2022-04-08 15:10:43,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {11124#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11124#true} is VALID [2022-04-08 15:10:43,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {11124#true} assume !false; {11124#true} is VALID [2022-04-08 15:10:43,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {11124#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {11124#true} is VALID [2022-04-08 15:10:43,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {11124#true} assume 12292 == #t~mem43;havoc #t~mem43; {11124#true} is VALID [2022-04-08 15:10:43,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {11124#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {11124#true} is VALID [2022-04-08 15:10:43,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {11124#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {11124#true} is VALID [2022-04-08 15:10:43,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {11124#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {11124#true} is VALID [2022-04-08 15:10:43,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {11124#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {11124#true} is VALID [2022-04-08 15:10:43,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {11124#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {11124#true} is VALID [2022-04-08 15:10:43,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {11124#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {11124#true} is VALID [2022-04-08 15:10:43,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {11124#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {11124#true} is VALID [2022-04-08 15:10:43,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {11124#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {11124#true} is VALID [2022-04-08 15:10:43,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {11124#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {11124#true} is VALID [2022-04-08 15:10:43,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {11124#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {11124#true} is VALID [2022-04-08 15:10:43,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {11124#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11124#true} is VALID [2022-04-08 15:10:43,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {11124#true} ~skip~0 := 0; {11124#true} is VALID [2022-04-08 15:10:43,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {11124#true} assume !false; {11124#true} is VALID [2022-04-08 15:10:43,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {11124#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {11124#true} is VALID [2022-04-08 15:10:43,482 INFO L290 TraceCheckUtils]: 28: Hoare triple {11124#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {11124#true} is VALID [2022-04-08 15:10:43,482 INFO L290 TraceCheckUtils]: 29: Hoare triple {11124#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {11124#true} is VALID [2022-04-08 15:10:43,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {11124#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {11124#true} is VALID [2022-04-08 15:10:43,482 INFO L290 TraceCheckUtils]: 31: Hoare triple {11124#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {11124#true} is VALID [2022-04-08 15:10:43,482 INFO L290 TraceCheckUtils]: 32: Hoare triple {11124#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {11124#true} is VALID [2022-04-08 15:10:43,482 INFO L290 TraceCheckUtils]: 33: Hoare triple {11124#true} assume 4368 == #t~mem48;havoc #t~mem48; {11124#true} is VALID [2022-04-08 15:10:43,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {11124#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {11124#true} is VALID [2022-04-08 15:10:43,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {11124#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11124#true} is VALID [2022-04-08 15:10:43,485 INFO L290 TraceCheckUtils]: 36: Hoare triple {11124#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,486 INFO L290 TraceCheckUtils]: 37: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,486 INFO L290 TraceCheckUtils]: 38: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,487 INFO L290 TraceCheckUtils]: 40: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,487 INFO L290 TraceCheckUtils]: 41: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,488 INFO L290 TraceCheckUtils]: 42: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,488 INFO L290 TraceCheckUtils]: 43: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,489 INFO L290 TraceCheckUtils]: 44: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,489 INFO L290 TraceCheckUtils]: 45: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,489 INFO L290 TraceCheckUtils]: 46: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,490 INFO L290 TraceCheckUtils]: 47: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,490 INFO L290 TraceCheckUtils]: 48: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,491 INFO L290 TraceCheckUtils]: 49: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,491 INFO L290 TraceCheckUtils]: 50: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,492 INFO L290 TraceCheckUtils]: 51: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,492 INFO L290 TraceCheckUtils]: 52: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,492 INFO L290 TraceCheckUtils]: 53: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,494 INFO L290 TraceCheckUtils]: 54: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,494 INFO L290 TraceCheckUtils]: 55: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,496 INFO L290 TraceCheckUtils]: 56: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,497 INFO L290 TraceCheckUtils]: 57: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:10:43,497 INFO L290 TraceCheckUtils]: 58: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11130#(not (= 4449 |ssl3_connect_#t~mem59|))} is VALID [2022-04-08 15:10:43,498 INFO L290 TraceCheckUtils]: 59: Hoare triple {11130#(not (= 4449 |ssl3_connect_#t~mem59|))} assume 4449 == #t~mem59;havoc #t~mem59; {11125#false} is VALID [2022-04-08 15:10:43,498 INFO L290 TraceCheckUtils]: 60: Hoare triple {11125#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {11125#false} is VALID [2022-04-08 15:10:43,498 INFO L290 TraceCheckUtils]: 61: Hoare triple {11125#false} assume 4 == ~blastFlag~0; {11125#false} is VALID [2022-04-08 15:10:43,498 INFO L290 TraceCheckUtils]: 62: Hoare triple {11125#false} assume !false; {11125#false} is VALID [2022-04-08 15:10:43,500 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-08 15:10:43,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:10:43,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632654100] [2022-04-08 15:10:43,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632654100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:10:43,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:10:43,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:10:43,501 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:10:43,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [401335537] [2022-04-08 15:10:43,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [401335537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:10:43,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:10:43,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:10:43,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118977494] [2022-04-08 15:10:43,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:10:43,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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 63 [2022-04-08 15:10:43,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:10:43,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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-08 15:10:43,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:43,552 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:10:43,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:10:43,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:10:43,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:10:43,553 INFO L87 Difference]: Start difference. First operand 376 states and 590 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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-08 15:10:45,577 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-08 15:10:46,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:46,815 INFO L93 Difference]: Finished difference Result 871 states and 1348 transitions. [2022-04-08 15:10:46,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:10:46,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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 63 [2022-04-08 15:10:46,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:10:46,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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-08 15:10:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-08 15:10:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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-08 15:10:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-08 15:10:46,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-08 15:10:47,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:47,259 INFO L225 Difference]: With dead ends: 871 [2022-04-08 15:10:47,259 INFO L226 Difference]: Without dead ends: 511 [2022-04-08 15:10:47,260 INFO L912 BasicCegarLoop]: 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-08 15:10:47,261 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 104 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:10:47,261 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 298 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 391 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:10:47,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-04-08 15:10:47,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 380. [2022-04-08 15:10:47,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:10:47,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 511 states. Second operand has 380 states, 375 states have (on average 1.5786666666666667) internal successors, (592), 375 states have internal predecessors, (592), 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-08 15:10:47,284 INFO L74 IsIncluded]: Start isIncluded. First operand 511 states. Second operand has 380 states, 375 states have (on average 1.5786666666666667) internal successors, (592), 375 states have internal predecessors, (592), 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-08 15:10:47,285 INFO L87 Difference]: Start difference. First operand 511 states. Second operand has 380 states, 375 states have (on average 1.5786666666666667) internal successors, (592), 375 states have internal predecessors, (592), 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-08 15:10:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:47,300 INFO L93 Difference]: Finished difference Result 511 states and 776 transitions. [2022-04-08 15:10:47,300 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 776 transitions. [2022-04-08 15:10:47,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:10:47,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:10:47,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 380 states, 375 states have (on average 1.5786666666666667) internal successors, (592), 375 states have internal predecessors, (592), 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 511 states. [2022-04-08 15:10:47,303 INFO L87 Difference]: Start difference. First operand has 380 states, 375 states have (on average 1.5786666666666667) internal successors, (592), 375 states have internal predecessors, (592), 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 511 states. [2022-04-08 15:10:47,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:47,320 INFO L93 Difference]: Finished difference Result 511 states and 776 transitions. [2022-04-08 15:10:47,320 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 776 transitions. [2022-04-08 15:10:47,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:10:47,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:10:47,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:10:47,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:10:47,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 375 states have (on average 1.5786666666666667) internal successors, (592), 375 states have internal predecessors, (592), 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-08 15:10:47,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 596 transitions. [2022-04-08 15:10:47,334 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 596 transitions. Word has length 63 [2022-04-08 15:10:47,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:10:47,335 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 596 transitions. [2022-04-08 15:10:47,335 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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-08 15:10:47,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 380 states and 596 transitions. [2022-04-08 15:10:47,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 596 edges. 596 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:47,897 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 596 transitions. [2022-04-08 15:10:47,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-08 15:10:47,898 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:10:47,898 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:10:47,898 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 15:10:47,898 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:10:47,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:10:47,899 INFO L85 PathProgramCache]: Analyzing trace with hash -807453134, now seen corresponding path program 1 times [2022-04-08 15:10:47,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:10:47,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [424218694] [2022-04-08 15:10:47,899 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:10:47,900 INFO L85 PathProgramCache]: Analyzing trace with hash -807453134, now seen corresponding path program 2 times [2022-04-08 15:10:47,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:10:47,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770023045] [2022-04-08 15:10:47,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:10:47,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:10:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:48,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:10:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:48,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {14667#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {14660#true} is VALID [2022-04-08 15:10:48,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {14660#true} assume true; {14660#true} is VALID [2022-04-08 15:10:48,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14660#true} {14660#true} #591#return; {14660#true} is VALID [2022-04-08 15:10:48,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {14660#true} call ULTIMATE.init(); {14667#(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-08 15:10:48,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {14667#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {14660#true} is VALID [2022-04-08 15:10:48,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {14660#true} assume true; {14660#true} is VALID [2022-04-08 15:10:48,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14660#true} {14660#true} #591#return; {14660#true} is VALID [2022-04-08 15:10:48,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {14660#true} call #t~ret159 := main(); {14660#true} is VALID [2022-04-08 15:10:48,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {14660#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {14660#true} is VALID [2022-04-08 15:10:48,139 INFO L272 TraceCheckUtils]: 6: Hoare triple {14660#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {14660#true} is VALID [2022-04-08 15:10:48,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {14660#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {14660#true} is VALID [2022-04-08 15:10:48,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {14660#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {14660#true} is VALID [2022-04-08 15:10:48,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {14660#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {14660#true} is VALID [2022-04-08 15:10:48,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {14660#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14660#true} is VALID [2022-04-08 15:10:48,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {14660#true} assume !false; {14660#true} is VALID [2022-04-08 15:10:48,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {14660#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {14660#true} is VALID [2022-04-08 15:10:48,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {14660#true} assume 12292 == #t~mem43;havoc #t~mem43; {14660#true} is VALID [2022-04-08 15:10:48,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {14660#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {14660#true} is VALID [2022-04-08 15:10:48,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {14660#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {14660#true} is VALID [2022-04-08 15:10:48,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {14660#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {14660#true} is VALID [2022-04-08 15:10:48,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {14660#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {14660#true} is VALID [2022-04-08 15:10:48,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {14660#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {14660#true} is VALID [2022-04-08 15:10:48,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {14660#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {14660#true} is VALID [2022-04-08 15:10:48,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {14660#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {14660#true} is VALID [2022-04-08 15:10:48,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {14660#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {14660#true} is VALID [2022-04-08 15:10:48,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {14660#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {14660#true} is VALID [2022-04-08 15:10:48,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {14660#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {14660#true} is VALID [2022-04-08 15:10:48,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {14660#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {14660#true} is VALID [2022-04-08 15:10:48,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {14660#true} ~skip~0 := 0; {14660#true} is VALID [2022-04-08 15:10:48,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {14660#true} assume !false; {14660#true} is VALID [2022-04-08 15:10:48,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {14660#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {14660#true} is VALID [2022-04-08 15:10:48,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {14660#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {14660#true} is VALID [2022-04-08 15:10:48,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {14660#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {14660#true} is VALID [2022-04-08 15:10:48,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {14660#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {14660#true} is VALID [2022-04-08 15:10:48,142 INFO L290 TraceCheckUtils]: 31: Hoare triple {14660#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14660#true} is VALID [2022-04-08 15:10:48,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {14660#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14660#true} is VALID [2022-04-08 15:10:48,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {14660#true} assume 4368 == #t~mem48;havoc #t~mem48; {14660#true} is VALID [2022-04-08 15:10:48,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {14660#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {14660#true} is VALID [2022-04-08 15:10:48,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {14660#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {14660#true} is VALID [2022-04-08 15:10:48,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {14660#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:10:48,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:10:48,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:10:48,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:10:48,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} ~skip~0 := 0; {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:10:48,147 INFO L290 TraceCheckUtils]: 41: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !false; {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:10:48,147 INFO L290 TraceCheckUtils]: 42: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:10:48,147 INFO L290 TraceCheckUtils]: 43: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:10:48,148 INFO L290 TraceCheckUtils]: 44: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:10:48,148 INFO L290 TraceCheckUtils]: 45: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:10:48,148 INFO L290 TraceCheckUtils]: 46: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:10:48,149 INFO L290 TraceCheckUtils]: 47: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:10:48,149 INFO L290 TraceCheckUtils]: 48: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:10:48,149 INFO L290 TraceCheckUtils]: 49: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14666#(= |ssl3_connect_#t~mem50| 4384)} is VALID [2022-04-08 15:10:48,150 INFO L290 TraceCheckUtils]: 50: Hoare triple {14666#(= |ssl3_connect_#t~mem50| 4384)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-08 15:10:48,150 INFO L290 TraceCheckUtils]: 51: Hoare triple {14661#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-08 15:10:48,150 INFO L290 TraceCheckUtils]: 52: Hoare triple {14661#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-08 15:10:48,150 INFO L290 TraceCheckUtils]: 53: Hoare triple {14661#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-08 15:10:48,150 INFO L290 TraceCheckUtils]: 54: Hoare triple {14661#false} assume 4416 == #t~mem54;havoc #t~mem54; {14661#false} is VALID [2022-04-08 15:10:48,150 INFO L290 TraceCheckUtils]: 55: Hoare triple {14661#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {14661#false} is VALID [2022-04-08 15:10:48,150 INFO L290 TraceCheckUtils]: 56: Hoare triple {14661#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {14661#false} is VALID [2022-04-08 15:10:48,151 INFO L290 TraceCheckUtils]: 57: Hoare triple {14661#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {14661#false} is VALID [2022-04-08 15:10:48,151 INFO L290 TraceCheckUtils]: 58: Hoare triple {14661#false} assume !(0 == ~tmp___6~0); {14661#false} is VALID [2022-04-08 15:10:48,151 INFO L290 TraceCheckUtils]: 59: Hoare triple {14661#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {14661#false} is VALID [2022-04-08 15:10:48,151 INFO L290 TraceCheckUtils]: 60: Hoare triple {14661#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {14661#false} is VALID [2022-04-08 15:10:48,151 INFO L290 TraceCheckUtils]: 61: Hoare triple {14661#false} ~skip~0 := 0; {14661#false} is VALID [2022-04-08 15:10:48,151 INFO L290 TraceCheckUtils]: 62: Hoare triple {14661#false} assume !false; {14661#false} is VALID [2022-04-08 15:10:48,151 INFO L290 TraceCheckUtils]: 63: Hoare triple {14661#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-08 15:10:48,151 INFO L290 TraceCheckUtils]: 64: Hoare triple {14661#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-08 15:10:48,152 INFO L290 TraceCheckUtils]: 65: Hoare triple {14661#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-08 15:10:48,152 INFO L290 TraceCheckUtils]: 66: Hoare triple {14661#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-08 15:10:48,152 INFO L290 TraceCheckUtils]: 67: Hoare triple {14661#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-08 15:10:48,152 INFO L290 TraceCheckUtils]: 68: Hoare triple {14661#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-08 15:10:48,152 INFO L290 TraceCheckUtils]: 69: Hoare triple {14661#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-08 15:10:48,152 INFO L290 TraceCheckUtils]: 70: Hoare triple {14661#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-08 15:10:48,152 INFO L290 TraceCheckUtils]: 71: Hoare triple {14661#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-08 15:10:48,152 INFO L290 TraceCheckUtils]: 72: Hoare triple {14661#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-08 15:10:48,152 INFO L290 TraceCheckUtils]: 73: Hoare triple {14661#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-08 15:10:48,152 INFO L290 TraceCheckUtils]: 74: Hoare triple {14661#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-08 15:10:48,153 INFO L290 TraceCheckUtils]: 75: Hoare triple {14661#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-08 15:10:48,153 INFO L290 TraceCheckUtils]: 76: Hoare triple {14661#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-08 15:10:48,153 INFO L290 TraceCheckUtils]: 77: Hoare triple {14661#false} assume 4432 == #t~mem56;havoc #t~mem56; {14661#false} is VALID [2022-04-08 15:10:48,153 INFO L290 TraceCheckUtils]: 78: Hoare triple {14661#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {14661#false} is VALID [2022-04-08 15:10:48,153 INFO L290 TraceCheckUtils]: 79: Hoare triple {14661#false} assume 5 == ~blastFlag~0; {14661#false} is VALID [2022-04-08 15:10:48,153 INFO L290 TraceCheckUtils]: 80: Hoare triple {14661#false} assume !false; {14661#false} is VALID [2022-04-08 15:10:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-08 15:10:48,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:10:48,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770023045] [2022-04-08 15:10:48,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770023045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:10:48,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:10:48,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:10:48,154 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:10:48,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [424218694] [2022-04-08 15:10:48,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [424218694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:10:48,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:10:48,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:10:48,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352102893] [2022-04-08 15:10:48,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:10:48,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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 81 [2022-04-08 15:10:48,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:10:48,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-08 15:10:48,217 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-08 15:10:48,218 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:10:48,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:10:48,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:10:48,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:10:48,218 INFO L87 Difference]: Start difference. First operand 380 states and 596 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-08 15:10:50,246 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-08 15:10:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:51,493 INFO L93 Difference]: Finished difference Result 599 states and 942 transitions. [2022-04-08 15:10:51,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:10:51,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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 81 [2022-04-08 15:10:51,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:10:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-08 15:10:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2022-04-08 15:10:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-08 15:10:51,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2022-04-08 15:10:51,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 390 transitions. [2022-04-08 15:10:51,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 390 edges. 390 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:51,858 INFO L225 Difference]: With dead ends: 599 [2022-04-08 15:10:51,858 INFO L226 Difference]: Without dead ends: 415 [2022-04-08 15:10:51,858 INFO L912 BasicCegarLoop]: 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-08 15:10:51,860 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 31 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:10:51,860 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 490 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:10:51,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-04-08 15:10:51,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 398. [2022-04-08 15:10:51,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:10:51,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 415 states. Second operand has 398 states, 393 states have (on average 1.5826972010178118) internal successors, (622), 393 states have internal predecessors, (622), 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-08 15:10:51,881 INFO L74 IsIncluded]: Start isIncluded. First operand 415 states. Second operand has 398 states, 393 states have (on average 1.5826972010178118) internal successors, (622), 393 states have internal predecessors, (622), 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-08 15:10:51,882 INFO L87 Difference]: Start difference. First operand 415 states. Second operand has 398 states, 393 states have (on average 1.5826972010178118) internal successors, (622), 393 states have internal predecessors, (622), 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-08 15:10:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:51,894 INFO L93 Difference]: Finished difference Result 415 states and 648 transitions. [2022-04-08 15:10:51,894 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 648 transitions. [2022-04-08 15:10:51,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:10:51,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:10:51,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 398 states, 393 states have (on average 1.5826972010178118) internal successors, (622), 393 states have internal predecessors, (622), 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 415 states. [2022-04-08 15:10:51,897 INFO L87 Difference]: Start difference. First operand has 398 states, 393 states have (on average 1.5826972010178118) internal successors, (622), 393 states have internal predecessors, (622), 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 415 states. [2022-04-08 15:10:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:51,909 INFO L93 Difference]: Finished difference Result 415 states and 648 transitions. [2022-04-08 15:10:51,909 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 648 transitions. [2022-04-08 15:10:51,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:10:51,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:10:51,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:10:51,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:10:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 393 states have (on average 1.5826972010178118) internal successors, (622), 393 states have internal predecessors, (622), 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-08 15:10:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 626 transitions. [2022-04-08 15:10:51,925 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 626 transitions. Word has length 81 [2022-04-08 15:10:51,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:10:51,925 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 626 transitions. [2022-04-08 15:10:51,925 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-08 15:10:51,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 398 states and 626 transitions. [2022-04-08 15:10:52,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 626 edges. 626 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 626 transitions. [2022-04-08 15:10:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-08 15:10:52,515 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:10:52,515 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:10:52,515 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 15:10:52,515 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:10:52,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:10:52,516 INFO L85 PathProgramCache]: Analyzing trace with hash -789307781, now seen corresponding path program 3 times [2022-04-08 15:10:52,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:10:52,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1408200522] [2022-04-08 15:11:06,235 WARN L232 SmtUtils]: Spent 13.71s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:11:17,206 WARN L232 SmtUtils]: Spent 7.37s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:11:18,506 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:11:18,507 INFO L85 PathProgramCache]: Analyzing trace with hash -789307781, now seen corresponding path program 4 times [2022-04-08 15:11:18,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:11:18,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326361713] [2022-04-08 15:11:18,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:11:18,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:11:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:18,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:11:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:18,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {17503#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {17496#true} is VALID [2022-04-08 15:11:18,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {17496#true} assume true; {17496#true} is VALID [2022-04-08 15:11:18,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17496#true} {17496#true} #591#return; {17496#true} is VALID [2022-04-08 15:11:18,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {17496#true} call ULTIMATE.init(); {17503#(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-08 15:11:18,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {17503#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {17496#true} is VALID [2022-04-08 15:11:18,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {17496#true} assume true; {17496#true} is VALID [2022-04-08 15:11:18,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17496#true} {17496#true} #591#return; {17496#true} is VALID [2022-04-08 15:11:18,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {17496#true} call #t~ret159 := main(); {17496#true} is VALID [2022-04-08 15:11:18,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {17496#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {17496#true} is VALID [2022-04-08 15:11:18,738 INFO L272 TraceCheckUtils]: 6: Hoare triple {17496#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {17496#true} is VALID [2022-04-08 15:11:18,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {17496#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {17496#true} is VALID [2022-04-08 15:11:18,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {17496#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {17496#true} is VALID [2022-04-08 15:11:18,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {17496#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {17496#true} is VALID [2022-04-08 15:11:18,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {17496#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17496#true} is VALID [2022-04-08 15:11:18,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {17496#true} assume !false; {17496#true} is VALID [2022-04-08 15:11:18,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {17496#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {17496#true} is VALID [2022-04-08 15:11:18,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {17496#true} assume 12292 == #t~mem43;havoc #t~mem43; {17496#true} is VALID [2022-04-08 15:11:18,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {17496#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {17496#true} is VALID [2022-04-08 15:11:18,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {17496#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {17496#true} is VALID [2022-04-08 15:11:18,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {17496#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {17496#true} is VALID [2022-04-08 15:11:18,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {17496#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {17496#true} is VALID [2022-04-08 15:11:18,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {17496#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {17496#true} is VALID [2022-04-08 15:11:18,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {17496#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {17496#true} is VALID [2022-04-08 15:11:18,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {17496#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {17496#true} is VALID [2022-04-08 15:11:18,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {17496#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {17496#true} is VALID [2022-04-08 15:11:18,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {17496#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {17496#true} is VALID [2022-04-08 15:11:18,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {17496#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {17496#true} is VALID [2022-04-08 15:11:18,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {17496#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {17496#true} is VALID [2022-04-08 15:11:18,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {17496#true} ~skip~0 := 0; {17496#true} is VALID [2022-04-08 15:11:18,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {17496#true} assume !false; {17496#true} is VALID [2022-04-08 15:11:18,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {17496#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {17496#true} is VALID [2022-04-08 15:11:18,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {17496#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {17496#true} is VALID [2022-04-08 15:11:18,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {17496#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {17496#true} is VALID [2022-04-08 15:11:18,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {17496#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {17496#true} is VALID [2022-04-08 15:11:18,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {17496#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {17496#true} is VALID [2022-04-08 15:11:18,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {17496#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17496#true} is VALID [2022-04-08 15:11:18,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {17496#true} assume 4368 == #t~mem48;havoc #t~mem48; {17496#true} is VALID [2022-04-08 15:11:18,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {17496#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {17496#true} is VALID [2022-04-08 15:11:18,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {17496#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {17496#true} is VALID [2022-04-08 15:11:18,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {17496#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:11:18,746 INFO L290 TraceCheckUtils]: 37: Hoare triple {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:11:18,746 INFO L290 TraceCheckUtils]: 38: Hoare triple {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:11:18,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:11:18,747 INFO L290 TraceCheckUtils]: 40: Hoare triple {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} ~skip~0 := 0; {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:11:18,747 INFO L290 TraceCheckUtils]: 41: Hoare triple {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !false; {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:11:18,747 INFO L290 TraceCheckUtils]: 42: Hoare triple {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {17502#(= |ssl3_connect_#t~mem43| 4384)} is VALID [2022-04-08 15:11:18,748 INFO L290 TraceCheckUtils]: 43: Hoare triple {17502#(= |ssl3_connect_#t~mem43| 4384)} assume 12292 == #t~mem43;havoc #t~mem43; {17497#false} is VALID [2022-04-08 15:11:18,748 INFO L290 TraceCheckUtils]: 44: Hoare triple {17497#false} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {17497#false} is VALID [2022-04-08 15:11:18,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {17497#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,748 INFO L290 TraceCheckUtils]: 46: Hoare triple {17497#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {17497#false} is VALID [2022-04-08 15:11:18,748 INFO L290 TraceCheckUtils]: 47: Hoare triple {17497#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,748 INFO L290 TraceCheckUtils]: 48: Hoare triple {17497#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {17497#false} is VALID [2022-04-08 15:11:18,748 INFO L290 TraceCheckUtils]: 49: Hoare triple {17497#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {17497#false} is VALID [2022-04-08 15:11:18,748 INFO L290 TraceCheckUtils]: 50: Hoare triple {17497#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {17497#false} is VALID [2022-04-08 15:11:18,749 INFO L290 TraceCheckUtils]: 51: Hoare triple {17497#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {17497#false} is VALID [2022-04-08 15:11:18,749 INFO L290 TraceCheckUtils]: 52: Hoare triple {17497#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {17497#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,749 INFO L290 TraceCheckUtils]: 54: Hoare triple {17497#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {17497#false} is VALID [2022-04-08 15:11:18,749 INFO L290 TraceCheckUtils]: 55: Hoare triple {17497#false} ~skip~0 := 0; {17497#false} is VALID [2022-04-08 15:11:18,749 INFO L290 TraceCheckUtils]: 56: Hoare triple {17497#false} assume !false; {17497#false} is VALID [2022-04-08 15:11:18,749 INFO L290 TraceCheckUtils]: 57: Hoare triple {17497#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,749 INFO L290 TraceCheckUtils]: 58: Hoare triple {17497#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,749 INFO L290 TraceCheckUtils]: 59: Hoare triple {17497#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,749 INFO L290 TraceCheckUtils]: 60: Hoare triple {17497#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,749 INFO L290 TraceCheckUtils]: 61: Hoare triple {17497#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,749 INFO L290 TraceCheckUtils]: 62: Hoare triple {17497#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,750 INFO L290 TraceCheckUtils]: 63: Hoare triple {17497#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,750 INFO L290 TraceCheckUtils]: 64: Hoare triple {17497#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,750 INFO L290 TraceCheckUtils]: 65: Hoare triple {17497#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,750 INFO L290 TraceCheckUtils]: 66: Hoare triple {17497#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,750 INFO L290 TraceCheckUtils]: 67: Hoare triple {17497#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,750 INFO L290 TraceCheckUtils]: 68: Hoare triple {17497#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,750 INFO L290 TraceCheckUtils]: 69: Hoare triple {17497#false} assume 4416 == #t~mem54;havoc #t~mem54; {17497#false} is VALID [2022-04-08 15:11:18,750 INFO L290 TraceCheckUtils]: 70: Hoare triple {17497#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {17497#false} is VALID [2022-04-08 15:11:18,750 INFO L290 TraceCheckUtils]: 71: Hoare triple {17497#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {17497#false} is VALID [2022-04-08 15:11:18,750 INFO L290 TraceCheckUtils]: 72: Hoare triple {17497#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {17497#false} is VALID [2022-04-08 15:11:18,750 INFO L290 TraceCheckUtils]: 73: Hoare triple {17497#false} assume !(0 == ~tmp___6~0); {17497#false} is VALID [2022-04-08 15:11:18,750 INFO L290 TraceCheckUtils]: 74: Hoare triple {17497#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,751 INFO L290 TraceCheckUtils]: 75: Hoare triple {17497#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {17497#false} is VALID [2022-04-08 15:11:18,751 INFO L290 TraceCheckUtils]: 76: Hoare triple {17497#false} ~skip~0 := 0; {17497#false} is VALID [2022-04-08 15:11:18,751 INFO L290 TraceCheckUtils]: 77: Hoare triple {17497#false} assume !false; {17497#false} is VALID [2022-04-08 15:11:18,751 INFO L290 TraceCheckUtils]: 78: Hoare triple {17497#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,751 INFO L290 TraceCheckUtils]: 79: Hoare triple {17497#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,751 INFO L290 TraceCheckUtils]: 80: Hoare triple {17497#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,751 INFO L290 TraceCheckUtils]: 81: Hoare triple {17497#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,751 INFO L290 TraceCheckUtils]: 82: Hoare triple {17497#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,751 INFO L290 TraceCheckUtils]: 83: Hoare triple {17497#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,751 INFO L290 TraceCheckUtils]: 84: Hoare triple {17497#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,751 INFO L290 TraceCheckUtils]: 85: Hoare triple {17497#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,752 INFO L290 TraceCheckUtils]: 86: Hoare triple {17497#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,752 INFO L290 TraceCheckUtils]: 87: Hoare triple {17497#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,752 INFO L290 TraceCheckUtils]: 88: Hoare triple {17497#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,752 INFO L290 TraceCheckUtils]: 89: Hoare triple {17497#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,752 INFO L290 TraceCheckUtils]: 90: Hoare triple {17497#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,752 INFO L290 TraceCheckUtils]: 91: Hoare triple {17497#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-08 15:11:18,752 INFO L290 TraceCheckUtils]: 92: Hoare triple {17497#false} assume 4432 == #t~mem56;havoc #t~mem56; {17497#false} is VALID [2022-04-08 15:11:18,752 INFO L290 TraceCheckUtils]: 93: Hoare triple {17497#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {17497#false} is VALID [2022-04-08 15:11:18,752 INFO L290 TraceCheckUtils]: 94: Hoare triple {17497#false} assume 5 == ~blastFlag~0; {17497#false} is VALID [2022-04-08 15:11:18,752 INFO L290 TraceCheckUtils]: 95: Hoare triple {17497#false} assume !false; {17497#false} is VALID [2022-04-08 15:11:18,753 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-08 15:11:18,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:11:18,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326361713] [2022-04-08 15:11:18,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326361713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:18,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:18,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:11:18,753 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:11:18,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1408200522] [2022-04-08 15:11:18,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1408200522] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:18,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:18,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:11:18,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989970411] [2022-04-08 15:11:18,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:11:18,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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 96 [2022-04-08 15:11:18,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:11:18,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-08 15:11:18,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:18,828 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:11:18,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:18,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:11:18,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:11:18,829 INFO L87 Difference]: Start difference. First operand 398 states and 626 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-08 15:11:20,856 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-08 15:11:21,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:21,962 INFO L93 Difference]: Finished difference Result 616 states and 970 transitions. [2022-04-08 15:11:21,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:11:21,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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 96 [2022-04-08 15:11:21,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:11:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-08 15:11:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-08 15:11:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-08 15:11:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-08 15:11:21,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 388 transitions. [2022-04-08 15:11:22,299 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-08 15:11:22,312 INFO L225 Difference]: With dead ends: 616 [2022-04-08 15:11:22,312 INFO L226 Difference]: Without dead ends: 414 [2022-04-08 15:11:22,312 INFO L912 BasicCegarLoop]: 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-08 15:11:22,313 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 37 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:11:22,313 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 490 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 354 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:11:22,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-04-08 15:11:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 398. [2022-04-08 15:11:22,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:11:22,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 414 states. Second operand has 398 states, 393 states have (on average 1.5801526717557253) internal successors, (621), 393 states have internal predecessors, (621), 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-08 15:11:22,339 INFO L74 IsIncluded]: Start isIncluded. First operand 414 states. Second operand has 398 states, 393 states have (on average 1.5801526717557253) internal successors, (621), 393 states have internal predecessors, (621), 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-08 15:11:22,340 INFO L87 Difference]: Start difference. First operand 414 states. Second operand has 398 states, 393 states have (on average 1.5801526717557253) internal successors, (621), 393 states have internal predecessors, (621), 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-08 15:11:22,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:22,352 INFO L93 Difference]: Finished difference Result 414 states and 646 transitions. [2022-04-08 15:11:22,352 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 646 transitions. [2022-04-08 15:11:22,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:22,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:22,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 398 states, 393 states have (on average 1.5801526717557253) internal successors, (621), 393 states have internal predecessors, (621), 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 414 states. [2022-04-08 15:11:22,355 INFO L87 Difference]: Start difference. First operand has 398 states, 393 states have (on average 1.5801526717557253) internal successors, (621), 393 states have internal predecessors, (621), 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 414 states. [2022-04-08 15:11:22,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:22,366 INFO L93 Difference]: Finished difference Result 414 states and 646 transitions. [2022-04-08 15:11:22,366 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 646 transitions. [2022-04-08 15:11:22,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:22,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:22,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:11:22,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:11:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 393 states have (on average 1.5801526717557253) internal successors, (621), 393 states have internal predecessors, (621), 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-08 15:11:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 625 transitions. [2022-04-08 15:11:22,380 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 625 transitions. Word has length 96 [2022-04-08 15:11:22,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:11:22,380 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 625 transitions. [2022-04-08 15:11:22,381 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-08 15:11:22,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 398 states and 625 transitions. [2022-04-08 15:11:22,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 625 edges. 625 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:22,905 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 625 transitions. [2022-04-08 15:11:22,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-08 15:11:22,907 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:11:22,907 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 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, 1, 1] [2022-04-08 15:11:22,907 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 15:11:22,907 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:11:22,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:11:22,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1141442077, now seen corresponding path program 1 times [2022-04-08 15:11:22,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:22,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1038310448] [2022-04-08 15:11:39,178 WARN L232 SmtUtils]: Spent 11.16s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:11:49,403 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:11:49,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1141442077, now seen corresponding path program 2 times [2022-04-08 15:11:49,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:11:49,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85604006] [2022-04-08 15:11:49,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:11:49,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:11:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:49,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:11:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:49,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {20371#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {20364#true} is VALID [2022-04-08 15:11:49,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {20364#true} assume true; {20364#true} is VALID [2022-04-08 15:11:49,581 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20364#true} {20364#true} #591#return; {20364#true} is VALID [2022-04-08 15:11:49,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {20364#true} call ULTIMATE.init(); {20371#(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-08 15:11:49,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {20371#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {20364#true} is VALID [2022-04-08 15:11:49,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {20364#true} assume true; {20364#true} is VALID [2022-04-08 15:11:49,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20364#true} {20364#true} #591#return; {20364#true} is VALID [2022-04-08 15:11:49,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {20364#true} call #t~ret159 := main(); {20364#true} is VALID [2022-04-08 15:11:49,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {20364#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {20364#true} is VALID [2022-04-08 15:11:49,583 INFO L272 TraceCheckUtils]: 6: Hoare triple {20364#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {20364#true} is VALID [2022-04-08 15:11:49,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {20364#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {20364#true} is VALID [2022-04-08 15:11:49,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {20364#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {20364#true} is VALID [2022-04-08 15:11:49,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {20364#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {20364#true} is VALID [2022-04-08 15:11:49,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {20364#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20364#true} is VALID [2022-04-08 15:11:49,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {20364#true} assume !false; {20364#true} is VALID [2022-04-08 15:11:49,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {20364#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {20364#true} is VALID [2022-04-08 15:11:49,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {20364#true} assume 12292 == #t~mem43;havoc #t~mem43; {20364#true} is VALID [2022-04-08 15:11:49,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {20364#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {20364#true} is VALID [2022-04-08 15:11:49,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {20364#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {20364#true} is VALID [2022-04-08 15:11:49,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {20364#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {20364#true} is VALID [2022-04-08 15:11:49,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {20364#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {20364#true} is VALID [2022-04-08 15:11:49,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {20364#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {20364#true} is VALID [2022-04-08 15:11:49,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {20364#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {20364#true} is VALID [2022-04-08 15:11:49,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {20364#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {20364#true} is VALID [2022-04-08 15:11:49,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {20364#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {20364#true} is VALID [2022-04-08 15:11:49,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {20364#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {20364#true} is VALID [2022-04-08 15:11:49,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {20364#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {20364#true} is VALID [2022-04-08 15:11:49,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {20364#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {20364#true} is VALID [2022-04-08 15:11:49,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {20364#true} ~skip~0 := 0; {20364#true} is VALID [2022-04-08 15:11:49,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {20364#true} assume !false; {20364#true} is VALID [2022-04-08 15:11:49,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {20364#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {20364#true} is VALID [2022-04-08 15:11:49,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {20364#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {20364#true} is VALID [2022-04-08 15:11:49,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {20364#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {20364#true} is VALID [2022-04-08 15:11:49,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {20364#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {20364#true} is VALID [2022-04-08 15:11:49,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {20364#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {20364#true} is VALID [2022-04-08 15:11:49,585 INFO L290 TraceCheckUtils]: 32: Hoare triple {20364#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {20364#true} is VALID [2022-04-08 15:11:49,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {20364#true} assume 4368 == #t~mem48;havoc #t~mem48; {20364#true} is VALID [2022-04-08 15:11:49,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {20364#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {20364#true} is VALID [2022-04-08 15:11:49,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {20364#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {20364#true} is VALID [2022-04-08 15:11:49,587 INFO L290 TraceCheckUtils]: 36: Hoare triple {20364#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:11:49,587 INFO L290 TraceCheckUtils]: 37: Hoare triple {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:11:49,588 INFO L290 TraceCheckUtils]: 38: Hoare triple {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:11:49,588 INFO L290 TraceCheckUtils]: 39: Hoare triple {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:11:49,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} ~skip~0 := 0; {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:11:49,589 INFO L290 TraceCheckUtils]: 41: Hoare triple {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !false; {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:11:49,589 INFO L290 TraceCheckUtils]: 42: Hoare triple {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:11:49,589 INFO L290 TraceCheckUtils]: 43: Hoare triple {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {20370#(= |ssl3_connect_#t~mem44| 4384)} is VALID [2022-04-08 15:11:49,590 INFO L290 TraceCheckUtils]: 44: Hoare triple {20370#(= |ssl3_connect_#t~mem44| 4384)} assume 16384 == #t~mem44;havoc #t~mem44; {20365#false} is VALID [2022-04-08 15:11:49,590 INFO L290 TraceCheckUtils]: 45: Hoare triple {20365#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {20365#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {20365#false} is VALID [2022-04-08 15:11:49,590 INFO L290 TraceCheckUtils]: 47: Hoare triple {20365#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,590 INFO L290 TraceCheckUtils]: 48: Hoare triple {20365#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {20365#false} is VALID [2022-04-08 15:11:49,590 INFO L290 TraceCheckUtils]: 49: Hoare triple {20365#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {20365#false} is VALID [2022-04-08 15:11:49,590 INFO L290 TraceCheckUtils]: 50: Hoare triple {20365#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {20365#false} is VALID [2022-04-08 15:11:49,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {20365#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {20365#false} is VALID [2022-04-08 15:11:49,591 INFO L290 TraceCheckUtils]: 52: Hoare triple {20365#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,591 INFO L290 TraceCheckUtils]: 53: Hoare triple {20365#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,591 INFO L290 TraceCheckUtils]: 54: Hoare triple {20365#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {20365#false} is VALID [2022-04-08 15:11:49,591 INFO L290 TraceCheckUtils]: 55: Hoare triple {20365#false} ~skip~0 := 0; {20365#false} is VALID [2022-04-08 15:11:49,591 INFO L290 TraceCheckUtils]: 56: Hoare triple {20365#false} assume !false; {20365#false} is VALID [2022-04-08 15:11:49,591 INFO L290 TraceCheckUtils]: 57: Hoare triple {20365#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,591 INFO L290 TraceCheckUtils]: 58: Hoare triple {20365#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,591 INFO L290 TraceCheckUtils]: 59: Hoare triple {20365#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,591 INFO L290 TraceCheckUtils]: 60: Hoare triple {20365#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,591 INFO L290 TraceCheckUtils]: 61: Hoare triple {20365#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,591 INFO L290 TraceCheckUtils]: 62: Hoare triple {20365#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,591 INFO L290 TraceCheckUtils]: 63: Hoare triple {20365#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,592 INFO L290 TraceCheckUtils]: 64: Hoare triple {20365#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,592 INFO L290 TraceCheckUtils]: 65: Hoare triple {20365#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,592 INFO L290 TraceCheckUtils]: 66: Hoare triple {20365#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,592 INFO L290 TraceCheckUtils]: 67: Hoare triple {20365#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,592 INFO L290 TraceCheckUtils]: 68: Hoare triple {20365#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,592 INFO L290 TraceCheckUtils]: 69: Hoare triple {20365#false} assume 4416 == #t~mem54;havoc #t~mem54; {20365#false} is VALID [2022-04-08 15:11:49,592 INFO L290 TraceCheckUtils]: 70: Hoare triple {20365#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {20365#false} is VALID [2022-04-08 15:11:49,592 INFO L290 TraceCheckUtils]: 71: Hoare triple {20365#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {20365#false} is VALID [2022-04-08 15:11:49,592 INFO L290 TraceCheckUtils]: 72: Hoare triple {20365#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {20365#false} is VALID [2022-04-08 15:11:49,592 INFO L290 TraceCheckUtils]: 73: Hoare triple {20365#false} assume !(0 == ~tmp___6~0); {20365#false} is VALID [2022-04-08 15:11:49,592 INFO L290 TraceCheckUtils]: 74: Hoare triple {20365#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,592 INFO L290 TraceCheckUtils]: 75: Hoare triple {20365#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {20365#false} is VALID [2022-04-08 15:11:49,593 INFO L290 TraceCheckUtils]: 76: Hoare triple {20365#false} ~skip~0 := 0; {20365#false} is VALID [2022-04-08 15:11:49,593 INFO L290 TraceCheckUtils]: 77: Hoare triple {20365#false} assume !false; {20365#false} is VALID [2022-04-08 15:11:49,593 INFO L290 TraceCheckUtils]: 78: Hoare triple {20365#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,593 INFO L290 TraceCheckUtils]: 79: Hoare triple {20365#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,593 INFO L290 TraceCheckUtils]: 80: Hoare triple {20365#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,593 INFO L290 TraceCheckUtils]: 81: Hoare triple {20365#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,593 INFO L290 TraceCheckUtils]: 82: Hoare triple {20365#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,593 INFO L290 TraceCheckUtils]: 83: Hoare triple {20365#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,593 INFO L290 TraceCheckUtils]: 84: Hoare triple {20365#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,593 INFO L290 TraceCheckUtils]: 85: Hoare triple {20365#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,593 INFO L290 TraceCheckUtils]: 86: Hoare triple {20365#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,593 INFO L290 TraceCheckUtils]: 87: Hoare triple {20365#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,594 INFO L290 TraceCheckUtils]: 88: Hoare triple {20365#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,594 INFO L290 TraceCheckUtils]: 89: Hoare triple {20365#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,594 INFO L290 TraceCheckUtils]: 90: Hoare triple {20365#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,594 INFO L290 TraceCheckUtils]: 91: Hoare triple {20365#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-08 15:11:49,594 INFO L290 TraceCheckUtils]: 92: Hoare triple {20365#false} assume 4432 == #t~mem56;havoc #t~mem56; {20365#false} is VALID [2022-04-08 15:11:49,594 INFO L290 TraceCheckUtils]: 93: Hoare triple {20365#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {20365#false} is VALID [2022-04-08 15:11:49,594 INFO L290 TraceCheckUtils]: 94: Hoare triple {20365#false} assume 5 == ~blastFlag~0; {20365#false} is VALID [2022-04-08 15:11:49,594 INFO L290 TraceCheckUtils]: 95: Hoare triple {20365#false} assume !false; {20365#false} is VALID [2022-04-08 15:11:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-08 15:11:49,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:11:49,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85604006] [2022-04-08 15:11:49,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85604006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:49,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:49,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:11:49,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:11:49,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1038310448] [2022-04-08 15:11:49,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1038310448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:49,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:49,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:11:49,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043984158] [2022-04-08 15:11:49,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:11:49,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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 96 [2022-04-08 15:11:49,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:11:49,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-08 15:11:49,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:49,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:11:49,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:49,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:11:49,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:11:49,669 INFO L87 Difference]: Start difference. First operand 398 states and 625 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-08 15:11:51,693 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-08 15:11:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:52,723 INFO L93 Difference]: Finished difference Result 616 states and 968 transitions. [2022-04-08 15:11:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:11:52,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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 96 [2022-04-08 15:11:52,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:11:52,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-08 15:11:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 387 transitions. [2022-04-08 15:11:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-08 15:11:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 387 transitions. [2022-04-08 15:11:52,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 387 transitions. [2022-04-08 15:11:53,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:53,037 INFO L225 Difference]: With dead ends: 616 [2022-04-08 15:11:53,037 INFO L226 Difference]: Without dead ends: 414 [2022-04-08 15:11:53,038 INFO L912 BasicCegarLoop]: 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-08 15:11:53,038 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 35 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 488 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.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:11:53,039 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 488 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 353 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:11:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-04-08 15:11:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 398. [2022-04-08 15:11:53,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:11:53,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 414 states. Second operand has 398 states, 393 states have (on average 1.5776081424936388) internal successors, (620), 393 states have internal predecessors, (620), 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-08 15:11:53,058 INFO L74 IsIncluded]: Start isIncluded. First operand 414 states. Second operand has 398 states, 393 states have (on average 1.5776081424936388) internal successors, (620), 393 states have internal predecessors, (620), 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-08 15:11:53,059 INFO L87 Difference]: Start difference. First operand 414 states. Second operand has 398 states, 393 states have (on average 1.5776081424936388) internal successors, (620), 393 states have internal predecessors, (620), 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-08 15:11:53,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:53,069 INFO L93 Difference]: Finished difference Result 414 states and 645 transitions. [2022-04-08 15:11:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 645 transitions. [2022-04-08 15:11:53,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:53,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:53,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 398 states, 393 states have (on average 1.5776081424936388) internal successors, (620), 393 states have internal predecessors, (620), 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 414 states. [2022-04-08 15:11:53,072 INFO L87 Difference]: Start difference. First operand has 398 states, 393 states have (on average 1.5776081424936388) internal successors, (620), 393 states have internal predecessors, (620), 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 414 states. [2022-04-08 15:11:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:53,082 INFO L93 Difference]: Finished difference Result 414 states and 645 transitions. [2022-04-08 15:11:53,082 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 645 transitions. [2022-04-08 15:11:53,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:53,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:53,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:11:53,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:11:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 393 states have (on average 1.5776081424936388) internal successors, (620), 393 states have internal predecessors, (620), 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-08 15:11:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 624 transitions. [2022-04-08 15:11:53,096 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 624 transitions. Word has length 96 [2022-04-08 15:11:53,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:11:53,096 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 624 transitions. [2022-04-08 15:11:53,097 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-08 15:11:53,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 398 states and 624 transitions. [2022-04-08 15:11:53,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 624 edges. 624 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 624 transitions. [2022-04-08 15:11:53,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-08 15:11:53,595 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:11:53,595 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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, 1, 1] [2022-04-08 15:11:53,596 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 15:11:53,596 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:11:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:11:53,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2018061342, now seen corresponding path program 1 times [2022-04-08 15:11:53,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:53,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1485003120] [2022-04-08 15:12:30,805 WARN L232 SmtUtils]: Spent 31.08s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:12:46,149 WARN L232 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:12:47,556 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:12:47,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2018061342, now seen corresponding path program 2 times [2022-04-08 15:12:47,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:12:47,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234735166] [2022-04-08 15:12:47,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:12:47,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:12:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:12:47,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:12:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:12:47,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {23239#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {23232#true} is VALID [2022-04-08 15:12:47,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {23232#true} assume true; {23232#true} is VALID [2022-04-08 15:12:47,742 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23232#true} {23232#true} #591#return; {23232#true} is VALID [2022-04-08 15:12:47,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {23232#true} call ULTIMATE.init(); {23239#(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-08 15:12:47,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {23239#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {23232#true} is VALID [2022-04-08 15:12:47,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {23232#true} assume true; {23232#true} is VALID [2022-04-08 15:12:47,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23232#true} {23232#true} #591#return; {23232#true} is VALID [2022-04-08 15:12:47,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {23232#true} call #t~ret159 := main(); {23232#true} is VALID [2022-04-08 15:12:47,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {23232#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {23232#true} is VALID [2022-04-08 15:12:47,744 INFO L272 TraceCheckUtils]: 6: Hoare triple {23232#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {23232#true} is VALID [2022-04-08 15:12:47,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {23232#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {23232#true} is VALID [2022-04-08 15:12:47,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {23232#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {23232#true} is VALID [2022-04-08 15:12:47,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {23232#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {23232#true} is VALID [2022-04-08 15:12:47,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {23232#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23232#true} is VALID [2022-04-08 15:12:47,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {23232#true} assume !false; {23232#true} is VALID [2022-04-08 15:12:47,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {23232#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23232#true} is VALID [2022-04-08 15:12:47,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {23232#true} assume 12292 == #t~mem43;havoc #t~mem43; {23232#true} is VALID [2022-04-08 15:12:47,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {23232#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {23232#true} is VALID [2022-04-08 15:12:47,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {23232#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {23232#true} is VALID [2022-04-08 15:12:47,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {23232#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {23232#true} is VALID [2022-04-08 15:12:47,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {23232#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {23232#true} is VALID [2022-04-08 15:12:47,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {23232#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {23232#true} is VALID [2022-04-08 15:12:47,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {23232#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {23232#true} is VALID [2022-04-08 15:12:47,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {23232#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {23232#true} is VALID [2022-04-08 15:12:47,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {23232#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {23232#true} is VALID [2022-04-08 15:12:47,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {23232#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {23232#true} is VALID [2022-04-08 15:12:47,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {23232#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {23232#true} is VALID [2022-04-08 15:12:47,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {23232#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {23232#true} is VALID [2022-04-08 15:12:47,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {23232#true} ~skip~0 := 0; {23232#true} is VALID [2022-04-08 15:12:47,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {23232#true} assume !false; {23232#true} is VALID [2022-04-08 15:12:47,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {23232#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23232#true} is VALID [2022-04-08 15:12:47,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {23232#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {23232#true} is VALID [2022-04-08 15:12:47,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {23232#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {23232#true} is VALID [2022-04-08 15:12:47,746 INFO L290 TraceCheckUtils]: 30: Hoare triple {23232#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {23232#true} is VALID [2022-04-08 15:12:47,746 INFO L290 TraceCheckUtils]: 31: Hoare triple {23232#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23232#true} is VALID [2022-04-08 15:12:47,746 INFO L290 TraceCheckUtils]: 32: Hoare triple {23232#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23232#true} is VALID [2022-04-08 15:12:47,746 INFO L290 TraceCheckUtils]: 33: Hoare triple {23232#true} assume 4368 == #t~mem48;havoc #t~mem48; {23232#true} is VALID [2022-04-08 15:12:47,746 INFO L290 TraceCheckUtils]: 34: Hoare triple {23232#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {23232#true} is VALID [2022-04-08 15:12:47,746 INFO L290 TraceCheckUtils]: 35: Hoare triple {23232#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {23232#true} is VALID [2022-04-08 15:12:47,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {23232#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:12:47,748 INFO L290 TraceCheckUtils]: 37: Hoare triple {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:12:47,748 INFO L290 TraceCheckUtils]: 38: Hoare triple {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:12:47,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:12:47,749 INFO L290 TraceCheckUtils]: 40: Hoare triple {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} ~skip~0 := 0; {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:12:47,749 INFO L290 TraceCheckUtils]: 41: Hoare triple {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !false; {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:12:47,749 INFO L290 TraceCheckUtils]: 42: Hoare triple {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:12:47,750 INFO L290 TraceCheckUtils]: 43: Hoare triple {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-08 15:12:47,750 INFO L290 TraceCheckUtils]: 44: Hoare triple {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {23238#(= |ssl3_connect_#t~mem45| 4384)} is VALID [2022-04-08 15:12:47,750 INFO L290 TraceCheckUtils]: 45: Hoare triple {23238#(= |ssl3_connect_#t~mem45| 4384)} assume 4096 == #t~mem45;havoc #t~mem45; {23233#false} is VALID [2022-04-08 15:12:47,751 INFO L290 TraceCheckUtils]: 46: Hoare triple {23233#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,751 INFO L290 TraceCheckUtils]: 47: Hoare triple {23233#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {23233#false} is VALID [2022-04-08 15:12:47,751 INFO L290 TraceCheckUtils]: 48: Hoare triple {23233#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,751 INFO L290 TraceCheckUtils]: 49: Hoare triple {23233#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {23233#false} is VALID [2022-04-08 15:12:47,751 INFO L290 TraceCheckUtils]: 50: Hoare triple {23233#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {23233#false} is VALID [2022-04-08 15:12:47,751 INFO L290 TraceCheckUtils]: 51: Hoare triple {23233#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {23233#false} is VALID [2022-04-08 15:12:47,751 INFO L290 TraceCheckUtils]: 52: Hoare triple {23233#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {23233#false} is VALID [2022-04-08 15:12:47,751 INFO L290 TraceCheckUtils]: 53: Hoare triple {23233#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,751 INFO L290 TraceCheckUtils]: 54: Hoare triple {23233#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,751 INFO L290 TraceCheckUtils]: 55: Hoare triple {23233#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {23233#false} is VALID [2022-04-08 15:12:47,751 INFO L290 TraceCheckUtils]: 56: Hoare triple {23233#false} ~skip~0 := 0; {23233#false} is VALID [2022-04-08 15:12:47,752 INFO L290 TraceCheckUtils]: 57: Hoare triple {23233#false} assume !false; {23233#false} is VALID [2022-04-08 15:12:47,752 INFO L290 TraceCheckUtils]: 58: Hoare triple {23233#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,752 INFO L290 TraceCheckUtils]: 59: Hoare triple {23233#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,752 INFO L290 TraceCheckUtils]: 60: Hoare triple {23233#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,752 INFO L290 TraceCheckUtils]: 61: Hoare triple {23233#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,752 INFO L290 TraceCheckUtils]: 62: Hoare triple {23233#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,752 INFO L290 TraceCheckUtils]: 63: Hoare triple {23233#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,752 INFO L290 TraceCheckUtils]: 64: Hoare triple {23233#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,752 INFO L290 TraceCheckUtils]: 65: Hoare triple {23233#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,752 INFO L290 TraceCheckUtils]: 66: Hoare triple {23233#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,752 INFO L290 TraceCheckUtils]: 67: Hoare triple {23233#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,753 INFO L290 TraceCheckUtils]: 68: Hoare triple {23233#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {23233#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {23233#false} assume 4416 == #t~mem54;havoc #t~mem54; {23233#false} is VALID [2022-04-08 15:12:47,753 INFO L290 TraceCheckUtils]: 71: Hoare triple {23233#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {23233#false} is VALID [2022-04-08 15:12:47,753 INFO L290 TraceCheckUtils]: 72: Hoare triple {23233#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {23233#false} is VALID [2022-04-08 15:12:47,753 INFO L290 TraceCheckUtils]: 73: Hoare triple {23233#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {23233#false} is VALID [2022-04-08 15:12:47,753 INFO L290 TraceCheckUtils]: 74: Hoare triple {23233#false} assume !(0 == ~tmp___6~0); {23233#false} is VALID [2022-04-08 15:12:47,753 INFO L290 TraceCheckUtils]: 75: Hoare triple {23233#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,753 INFO L290 TraceCheckUtils]: 76: Hoare triple {23233#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {23233#false} is VALID [2022-04-08 15:12:47,753 INFO L290 TraceCheckUtils]: 77: Hoare triple {23233#false} ~skip~0 := 0; {23233#false} is VALID [2022-04-08 15:12:47,753 INFO L290 TraceCheckUtils]: 78: Hoare triple {23233#false} assume !false; {23233#false} is VALID [2022-04-08 15:12:47,753 INFO L290 TraceCheckUtils]: 79: Hoare triple {23233#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,754 INFO L290 TraceCheckUtils]: 80: Hoare triple {23233#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,754 INFO L290 TraceCheckUtils]: 81: Hoare triple {23233#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,754 INFO L290 TraceCheckUtils]: 82: Hoare triple {23233#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,754 INFO L290 TraceCheckUtils]: 83: Hoare triple {23233#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,754 INFO L290 TraceCheckUtils]: 84: Hoare triple {23233#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,757 INFO L290 TraceCheckUtils]: 85: Hoare triple {23233#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,757 INFO L290 TraceCheckUtils]: 86: Hoare triple {23233#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,757 INFO L290 TraceCheckUtils]: 87: Hoare triple {23233#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,757 INFO L290 TraceCheckUtils]: 88: Hoare triple {23233#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,757 INFO L290 TraceCheckUtils]: 89: Hoare triple {23233#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,757 INFO L290 TraceCheckUtils]: 90: Hoare triple {23233#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,757 INFO L290 TraceCheckUtils]: 91: Hoare triple {23233#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,758 INFO L290 TraceCheckUtils]: 92: Hoare triple {23233#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-08 15:12:47,758 INFO L290 TraceCheckUtils]: 93: Hoare triple {23233#false} assume 4432 == #t~mem56;havoc #t~mem56; {23233#false} is VALID [2022-04-08 15:12:47,758 INFO L290 TraceCheckUtils]: 94: Hoare triple {23233#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {23233#false} is VALID [2022-04-08 15:12:47,758 INFO L290 TraceCheckUtils]: 95: Hoare triple {23233#false} assume 5 == ~blastFlag~0; {23233#false} is VALID [2022-04-08 15:12:47,758 INFO L290 TraceCheckUtils]: 96: Hoare triple {23233#false} assume !false; {23233#false} is VALID [2022-04-08 15:12:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-08 15:12:47,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:12:47,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234735166] [2022-04-08 15:12:47,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234735166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:12:47,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:12:47,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:12:47,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:12:47,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1485003120] [2022-04-08 15:12:47,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1485003120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:12:47,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:12:47,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:12:47,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233033508] [2022-04-08 15:12:47,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:12:47,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 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-08 15:12:47,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:12:47,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 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-08 15:12:47,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:12:47,827 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:12:47,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:12:47,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:12:47,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:12:47,828 INFO L87 Difference]: Start difference. First operand 398 states and 624 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 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-08 15:12:49,856 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-08 15:12:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:12:50,988 INFO L93 Difference]: Finished difference Result 616 states and 966 transitions. [2022-04-08 15:12:50,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:12:50,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 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-08 15:12:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:12:50,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 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-08 15:12:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-08 15:12:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 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-08 15:12:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-08 15:12:50,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 386 transitions. [2022-04-08 15:12:51,297 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-08 15:12:51,309 INFO L225 Difference]: With dead ends: 616 [2022-04-08 15:12:51,309 INFO L226 Difference]: Without dead ends: 414 [2022-04-08 15:12:51,310 INFO L912 BasicCegarLoop]: 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-08 15:12:51,310 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:12:51,311 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 486 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:12:51,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-04-08 15:12:51,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 398. [2022-04-08 15:12:51,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:12:51,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 414 states. Second operand has 398 states, 393 states have (on average 1.575063613231552) internal successors, (619), 393 states have internal predecessors, (619), 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-08 15:12:51,330 INFO L74 IsIncluded]: Start isIncluded. First operand 414 states. Second operand has 398 states, 393 states have (on average 1.575063613231552) internal successors, (619), 393 states have internal predecessors, (619), 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-08 15:12:51,330 INFO L87 Difference]: Start difference. First operand 414 states. Second operand has 398 states, 393 states have (on average 1.575063613231552) internal successors, (619), 393 states have internal predecessors, (619), 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-08 15:12:51,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:12:51,341 INFO L93 Difference]: Finished difference Result 414 states and 644 transitions. [2022-04-08 15:12:51,341 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 644 transitions. [2022-04-08 15:12:51,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:12:51,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:12:51,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 398 states, 393 states have (on average 1.575063613231552) internal successors, (619), 393 states have internal predecessors, (619), 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 414 states. [2022-04-08 15:12:51,343 INFO L87 Difference]: Start difference. First operand has 398 states, 393 states have (on average 1.575063613231552) internal successors, (619), 393 states have internal predecessors, (619), 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 414 states. [2022-04-08 15:12:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:12:51,354 INFO L93 Difference]: Finished difference Result 414 states and 644 transitions. [2022-04-08 15:12:51,354 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 644 transitions. [2022-04-08 15:12:51,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:12:51,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:12:51,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:12:51,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:12:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 393 states have (on average 1.575063613231552) internal successors, (619), 393 states have internal predecessors, (619), 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-08 15:12:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 623 transitions. [2022-04-08 15:12:51,367 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 623 transitions. Word has length 97 [2022-04-08 15:12:51,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:12:51,368 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 623 transitions. [2022-04-08 15:12:51,368 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 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-08 15:12:51,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 398 states and 623 transitions. [2022-04-08 15:12:51,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 623 edges. 623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:12:51,875 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 623 transitions. [2022-04-08 15:12:51,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-08 15:12:51,876 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:12:51,876 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2022-04-08 15:12:51,876 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 15:12:51,877 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:12:51,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:12:51,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1320629736, now seen corresponding path program 1 times [2022-04-08 15:12:51,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:12:51,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [46268633] [2022-04-08 15:13:05,505 WARN L232 SmtUtils]: Spent 7.97s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:13:14,021 WARN L232 SmtUtils]: Spent 5.27s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:13:15,211 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:15,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1320629736, now seen corresponding path program 2 times [2022-04-08 15:13:15,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:15,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793362005] [2022-04-08 15:13:15,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:15,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:15,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:15,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {26107#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {26100#true} is VALID [2022-04-08 15:13:15,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {26100#true} assume true; {26100#true} is VALID [2022-04-08 15:13:15,388 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26100#true} {26100#true} #591#return; {26100#true} is VALID [2022-04-08 15:13:15,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {26100#true} call ULTIMATE.init(); {26107#(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-08 15:13:15,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {26107#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {26100#true} is VALID [2022-04-08 15:13:15,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {26100#true} assume true; {26100#true} is VALID [2022-04-08 15:13:15,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26100#true} {26100#true} #591#return; {26100#true} is VALID [2022-04-08 15:13:15,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {26100#true} call #t~ret159 := main(); {26100#true} is VALID [2022-04-08 15:13:15,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {26100#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {26100#true} is VALID [2022-04-08 15:13:15,389 INFO L272 TraceCheckUtils]: 6: Hoare triple {26100#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {26100#true} is VALID [2022-04-08 15:13:15,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {26100#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {26100#true} is VALID [2022-04-08 15:13:15,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {26100#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {26100#true} is VALID [2022-04-08 15:13:15,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {26100#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {26100#true} is VALID [2022-04-08 15:13:15,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {26100#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {26100#true} is VALID [2022-04-08 15:13:15,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {26100#true} assume !false; {26100#true} is VALID [2022-04-08 15:13:15,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {26100#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {26100#true} is VALID [2022-04-08 15:13:15,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {26100#true} assume 12292 == #t~mem43;havoc #t~mem43; {26100#true} is VALID [2022-04-08 15:13:15,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {26100#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {26100#true} is VALID [2022-04-08 15:13:15,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {26100#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {26100#true} is VALID [2022-04-08 15:13:15,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {26100#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {26100#true} is VALID [2022-04-08 15:13:15,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {26100#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {26100#true} is VALID [2022-04-08 15:13:15,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {26100#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {26100#true} is VALID [2022-04-08 15:13:15,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {26100#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {26100#true} is VALID [2022-04-08 15:13:15,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {26100#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {26100#true} is VALID [2022-04-08 15:13:15,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {26100#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {26100#true} is VALID [2022-04-08 15:13:15,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {26100#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {26100#true} is VALID [2022-04-08 15:13:15,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {26100#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {26100#true} is VALID [2022-04-08 15:13:15,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {26100#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {26100#true} is VALID [2022-04-08 15:13:15,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {26100#true} ~skip~0 := 0; {26100#true} is VALID [2022-04-08 15:13:15,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {26100#true} assume !false; {26100#true} is VALID [2022-04-08 15:13:15,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {26100#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {26100#true} is VALID [2022-04-08 15:13:15,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {26100#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {26100#true} is VALID [2022-04-08 15:13:15,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {26100#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {26100#true} is VALID [2022-04-08 15:13:15,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {26100#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {26100#true} is VALID [2022-04-08 15:13:15,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {26100#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {26100#true} is VALID [2022-04-08 15:13:15,392 INFO L290 TraceCheckUtils]: 32: Hoare triple {26100#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {26100#true} is VALID [2022-04-08 15:13:15,392 INFO L290 TraceCheckUtils]: 33: Hoare triple {26100#true} assume 4368 == #t~mem48;havoc #t~mem48; {26100#true} is VALID [2022-04-08 15:13:15,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {26100#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {26100#true} is VALID [2022-04-08 15:13:15,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {26100#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {26100#true} is VALID [2022-04-08 15:13:15,393 INFO L290 TraceCheckUtils]: 36: Hoare triple {26100#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:15,394 INFO L290 TraceCheckUtils]: 37: Hoare triple {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:15,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:15,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:15,395 INFO L290 TraceCheckUtils]: 40: Hoare triple {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:15,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:15,396 INFO L290 TraceCheckUtils]: 42: Hoare triple {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:15,396 INFO L290 TraceCheckUtils]: 43: Hoare triple {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:15,397 INFO L290 TraceCheckUtils]: 44: Hoare triple {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:15,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {26106#(not (= |ssl3_connect_#t~mem46| 20480))} is VALID [2022-04-08 15:13:15,397 INFO L290 TraceCheckUtils]: 46: Hoare triple {26106#(not (= |ssl3_connect_#t~mem46| 20480))} assume 20480 == #t~mem46;havoc #t~mem46; {26101#false} is VALID [2022-04-08 15:13:15,397 INFO L290 TraceCheckUtils]: 47: Hoare triple {26101#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,398 INFO L290 TraceCheckUtils]: 48: Hoare triple {26101#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {26101#false} is VALID [2022-04-08 15:13:15,398 INFO L290 TraceCheckUtils]: 49: Hoare triple {26101#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,398 INFO L290 TraceCheckUtils]: 50: Hoare triple {26101#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {26101#false} is VALID [2022-04-08 15:13:15,398 INFO L290 TraceCheckUtils]: 51: Hoare triple {26101#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {26101#false} is VALID [2022-04-08 15:13:15,398 INFO L290 TraceCheckUtils]: 52: Hoare triple {26101#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {26101#false} is VALID [2022-04-08 15:13:15,398 INFO L290 TraceCheckUtils]: 53: Hoare triple {26101#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {26101#false} is VALID [2022-04-08 15:13:15,398 INFO L290 TraceCheckUtils]: 54: Hoare triple {26101#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,398 INFO L290 TraceCheckUtils]: 55: Hoare triple {26101#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,398 INFO L290 TraceCheckUtils]: 56: Hoare triple {26101#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {26101#false} is VALID [2022-04-08 15:13:15,398 INFO L290 TraceCheckUtils]: 57: Hoare triple {26101#false} ~skip~0 := 0; {26101#false} is VALID [2022-04-08 15:13:15,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {26101#false} assume !false; {26101#false} is VALID [2022-04-08 15:13:15,399 INFO L290 TraceCheckUtils]: 59: Hoare triple {26101#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,399 INFO L290 TraceCheckUtils]: 60: Hoare triple {26101#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,399 INFO L290 TraceCheckUtils]: 61: Hoare triple {26101#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,399 INFO L290 TraceCheckUtils]: 62: Hoare triple {26101#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,399 INFO L290 TraceCheckUtils]: 63: Hoare triple {26101#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,399 INFO L290 TraceCheckUtils]: 64: Hoare triple {26101#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,399 INFO L290 TraceCheckUtils]: 65: Hoare triple {26101#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,399 INFO L290 TraceCheckUtils]: 66: Hoare triple {26101#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,399 INFO L290 TraceCheckUtils]: 67: Hoare triple {26101#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,399 INFO L290 TraceCheckUtils]: 68: Hoare triple {26101#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,399 INFO L290 TraceCheckUtils]: 69: Hoare triple {26101#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,399 INFO L290 TraceCheckUtils]: 70: Hoare triple {26101#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,400 INFO L290 TraceCheckUtils]: 71: Hoare triple {26101#false} assume 4416 == #t~mem54;havoc #t~mem54; {26101#false} is VALID [2022-04-08 15:13:15,400 INFO L290 TraceCheckUtils]: 72: Hoare triple {26101#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {26101#false} is VALID [2022-04-08 15:13:15,400 INFO L290 TraceCheckUtils]: 73: Hoare triple {26101#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {26101#false} is VALID [2022-04-08 15:13:15,400 INFO L290 TraceCheckUtils]: 74: Hoare triple {26101#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {26101#false} is VALID [2022-04-08 15:13:15,400 INFO L290 TraceCheckUtils]: 75: Hoare triple {26101#false} assume !(0 == ~tmp___6~0); {26101#false} is VALID [2022-04-08 15:13:15,400 INFO L290 TraceCheckUtils]: 76: Hoare triple {26101#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,400 INFO L290 TraceCheckUtils]: 77: Hoare triple {26101#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {26101#false} is VALID [2022-04-08 15:13:15,400 INFO L290 TraceCheckUtils]: 78: Hoare triple {26101#false} ~skip~0 := 0; {26101#false} is VALID [2022-04-08 15:13:15,400 INFO L290 TraceCheckUtils]: 79: Hoare triple {26101#false} assume !false; {26101#false} is VALID [2022-04-08 15:13:15,400 INFO L290 TraceCheckUtils]: 80: Hoare triple {26101#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,400 INFO L290 TraceCheckUtils]: 81: Hoare triple {26101#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,401 INFO L290 TraceCheckUtils]: 82: Hoare triple {26101#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,401 INFO L290 TraceCheckUtils]: 83: Hoare triple {26101#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,401 INFO L290 TraceCheckUtils]: 84: Hoare triple {26101#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,401 INFO L290 TraceCheckUtils]: 85: Hoare triple {26101#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,401 INFO L290 TraceCheckUtils]: 86: Hoare triple {26101#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,401 INFO L290 TraceCheckUtils]: 87: Hoare triple {26101#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,401 INFO L290 TraceCheckUtils]: 88: Hoare triple {26101#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,401 INFO L290 TraceCheckUtils]: 89: Hoare triple {26101#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,401 INFO L290 TraceCheckUtils]: 90: Hoare triple {26101#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,401 INFO L290 TraceCheckUtils]: 91: Hoare triple {26101#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,401 INFO L290 TraceCheckUtils]: 92: Hoare triple {26101#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,401 INFO L290 TraceCheckUtils]: 93: Hoare triple {26101#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-08 15:13:15,402 INFO L290 TraceCheckUtils]: 94: Hoare triple {26101#false} assume 4432 == #t~mem56;havoc #t~mem56; {26101#false} is VALID [2022-04-08 15:13:15,402 INFO L290 TraceCheckUtils]: 95: Hoare triple {26101#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {26101#false} is VALID [2022-04-08 15:13:15,402 INFO L290 TraceCheckUtils]: 96: Hoare triple {26101#false} assume 5 == ~blastFlag~0; {26101#false} is VALID [2022-04-08 15:13:15,402 INFO L290 TraceCheckUtils]: 97: Hoare triple {26101#false} assume !false; {26101#false} is VALID [2022-04-08 15:13:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-08 15:13:15,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:15,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793362005] [2022-04-08 15:13:15,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793362005] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:15,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:15,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:15,403 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:15,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [46268633] [2022-04-08 15:13:15,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [46268633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:15,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:15,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:15,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641594898] [2022-04-08 15:13:15,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:15,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 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 98 [2022-04-08 15:13:15,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:15,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 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-08 15:13:15,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:15,471 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:15,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:15,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:15,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:15,472 INFO L87 Difference]: Start difference. First operand 398 states and 623 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 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-08 15:13:17,494 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-08 15:13:18,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:18,504 INFO L93 Difference]: Finished difference Result 911 states and 1406 transitions. [2022-04-08 15:13:18,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:18,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 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 98 [2022-04-08 15:13:18,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 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-08 15:13:18,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-08 15:13:18,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 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-08 15:13:18,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-08 15:13:18,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-08 15:13:18,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:18,865 INFO L225 Difference]: With dead ends: 911 [2022-04-08 15:13:18,865 INFO L226 Difference]: Without dead ends: 529 [2022-04-08 15:13:18,866 INFO L912 BasicCegarLoop]: 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-08 15:13:18,866 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 116 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:18,866 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 298 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 391 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:13:18,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-04-08 15:13:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 398. [2022-04-08 15:13:18,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:18,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 529 states. Second operand has 398 states, 393 states have (on average 1.5572519083969465) internal successors, (612), 393 states have internal predecessors, (612), 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-08 15:13:18,890 INFO L74 IsIncluded]: Start isIncluded. First operand 529 states. Second operand has 398 states, 393 states have (on average 1.5572519083969465) internal successors, (612), 393 states have internal predecessors, (612), 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-08 15:13:18,890 INFO L87 Difference]: Start difference. First operand 529 states. Second operand has 398 states, 393 states have (on average 1.5572519083969465) internal successors, (612), 393 states have internal predecessors, (612), 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-08 15:13:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:18,904 INFO L93 Difference]: Finished difference Result 529 states and 796 transitions. [2022-04-08 15:13:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 796 transitions. [2022-04-08 15:13:18,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:18,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:18,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 398 states, 393 states have (on average 1.5572519083969465) internal successors, (612), 393 states have internal predecessors, (612), 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 529 states. [2022-04-08 15:13:18,906 INFO L87 Difference]: Start difference. First operand has 398 states, 393 states have (on average 1.5572519083969465) internal successors, (612), 393 states have internal predecessors, (612), 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 529 states. [2022-04-08 15:13:18,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:18,921 INFO L93 Difference]: Finished difference Result 529 states and 796 transitions. [2022-04-08 15:13:18,922 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 796 transitions. [2022-04-08 15:13:18,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:18,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:18,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:18,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 393 states have (on average 1.5572519083969465) internal successors, (612), 393 states have internal predecessors, (612), 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-08 15:13:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 616 transitions. [2022-04-08 15:13:18,935 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 616 transitions. Word has length 98 [2022-04-08 15:13:18,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:18,935 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 616 transitions. [2022-04-08 15:13:18,935 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 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-08 15:13:18,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 398 states and 616 transitions. [2022-04-08 15:13:19,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 616 edges. 616 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 616 transitions. [2022-04-08 15:13:19,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 15:13:19,491 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:19,491 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2022-04-08 15:13:19,491 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 15:13:19,491 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:19,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:19,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2105012025, now seen corresponding path program 1 times [2022-04-08 15:13:19,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:19,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1256099424] [2022-04-08 15:13:42,339 WARN L232 SmtUtils]: Spent 16.75s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:13:52,584 WARN L232 SmtUtils]: Spent 6.53s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:13:53,777 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:53,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2105012025, now seen corresponding path program 2 times [2022-04-08 15:13:53,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:53,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992163394] [2022-04-08 15:13:53,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:53,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:53,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:54,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {29795#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {29788#true} is VALID [2022-04-08 15:13:54,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {29788#true} assume true; {29788#true} is VALID [2022-04-08 15:13:54,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29788#true} {29788#true} #591#return; {29788#true} is VALID [2022-04-08 15:13:54,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {29788#true} call ULTIMATE.init(); {29795#(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-08 15:13:54,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {29795#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {29788#true} is VALID [2022-04-08 15:13:54,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {29788#true} assume true; {29788#true} is VALID [2022-04-08 15:13:54,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29788#true} {29788#true} #591#return; {29788#true} is VALID [2022-04-08 15:13:54,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {29788#true} call #t~ret159 := main(); {29788#true} is VALID [2022-04-08 15:13:54,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {29788#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {29788#true} is VALID [2022-04-08 15:13:54,004 INFO L272 TraceCheckUtils]: 6: Hoare triple {29788#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {29788#true} is VALID [2022-04-08 15:13:54,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {29788#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {29788#true} is VALID [2022-04-08 15:13:54,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {29788#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {29788#true} is VALID [2022-04-08 15:13:54,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {29788#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {29788#true} is VALID [2022-04-08 15:13:54,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {29788#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {29788#true} is VALID [2022-04-08 15:13:54,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {29788#true} assume !false; {29788#true} is VALID [2022-04-08 15:13:54,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {29788#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {29788#true} is VALID [2022-04-08 15:13:54,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {29788#true} assume 12292 == #t~mem43;havoc #t~mem43; {29788#true} is VALID [2022-04-08 15:13:54,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {29788#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {29788#true} is VALID [2022-04-08 15:13:54,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {29788#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {29788#true} is VALID [2022-04-08 15:13:54,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {29788#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {29788#true} is VALID [2022-04-08 15:13:54,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {29788#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {29788#true} is VALID [2022-04-08 15:13:54,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {29788#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {29788#true} is VALID [2022-04-08 15:13:54,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {29788#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {29788#true} is VALID [2022-04-08 15:13:54,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {29788#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {29788#true} is VALID [2022-04-08 15:13:54,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {29788#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {29788#true} is VALID [2022-04-08 15:13:54,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {29788#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {29788#true} is VALID [2022-04-08 15:13:54,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {29788#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {29788#true} is VALID [2022-04-08 15:13:54,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {29788#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {29788#true} is VALID [2022-04-08 15:13:54,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {29788#true} ~skip~0 := 0; {29788#true} is VALID [2022-04-08 15:13:54,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {29788#true} assume !false; {29788#true} is VALID [2022-04-08 15:13:54,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {29788#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {29788#true} is VALID [2022-04-08 15:13:54,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {29788#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {29788#true} is VALID [2022-04-08 15:13:54,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {29788#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {29788#true} is VALID [2022-04-08 15:13:54,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {29788#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {29788#true} is VALID [2022-04-08 15:13:54,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {29788#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {29788#true} is VALID [2022-04-08 15:13:54,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {29788#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {29788#true} is VALID [2022-04-08 15:13:54,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {29788#true} assume 4368 == #t~mem48;havoc #t~mem48; {29788#true} is VALID [2022-04-08 15:13:54,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {29788#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {29788#true} is VALID [2022-04-08 15:13:54,014 INFO L290 TraceCheckUtils]: 35: Hoare triple {29788#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {29788#true} is VALID [2022-04-08 15:13:54,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {29788#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:54,016 INFO L290 TraceCheckUtils]: 37: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:54,016 INFO L290 TraceCheckUtils]: 38: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:54,017 INFO L290 TraceCheckUtils]: 39: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:54,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:54,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:54,018 INFO L290 TraceCheckUtils]: 42: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:54,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:54,019 INFO L290 TraceCheckUtils]: 44: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:54,019 INFO L290 TraceCheckUtils]: 45: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:54,020 INFO L290 TraceCheckUtils]: 46: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {29794#(not (= |ssl3_connect_#t~mem47| 4099))} is VALID [2022-04-08 15:13:54,020 INFO L290 TraceCheckUtils]: 47: Hoare triple {29794#(not (= |ssl3_connect_#t~mem47| 4099))} assume 4099 == #t~mem47;havoc #t~mem47; {29789#false} is VALID [2022-04-08 15:13:54,020 INFO L290 TraceCheckUtils]: 48: Hoare triple {29789#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,020 INFO L290 TraceCheckUtils]: 49: Hoare triple {29789#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {29789#false} is VALID [2022-04-08 15:13:54,020 INFO L290 TraceCheckUtils]: 50: Hoare triple {29789#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,020 INFO L290 TraceCheckUtils]: 51: Hoare triple {29789#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {29789#false} is VALID [2022-04-08 15:13:54,020 INFO L290 TraceCheckUtils]: 52: Hoare triple {29789#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {29789#false} is VALID [2022-04-08 15:13:54,020 INFO L290 TraceCheckUtils]: 53: Hoare triple {29789#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {29789#false} is VALID [2022-04-08 15:13:54,020 INFO L290 TraceCheckUtils]: 54: Hoare triple {29789#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {29789#false} is VALID [2022-04-08 15:13:54,021 INFO L290 TraceCheckUtils]: 55: Hoare triple {29789#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,021 INFO L290 TraceCheckUtils]: 56: Hoare triple {29789#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,021 INFO L290 TraceCheckUtils]: 57: Hoare triple {29789#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {29789#false} is VALID [2022-04-08 15:13:54,021 INFO L290 TraceCheckUtils]: 58: Hoare triple {29789#false} ~skip~0 := 0; {29789#false} is VALID [2022-04-08 15:13:54,021 INFO L290 TraceCheckUtils]: 59: Hoare triple {29789#false} assume !false; {29789#false} is VALID [2022-04-08 15:13:54,021 INFO L290 TraceCheckUtils]: 60: Hoare triple {29789#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,021 INFO L290 TraceCheckUtils]: 61: Hoare triple {29789#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,021 INFO L290 TraceCheckUtils]: 62: Hoare triple {29789#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,021 INFO L290 TraceCheckUtils]: 63: Hoare triple {29789#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,021 INFO L290 TraceCheckUtils]: 64: Hoare triple {29789#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,021 INFO L290 TraceCheckUtils]: 65: Hoare triple {29789#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,021 INFO L290 TraceCheckUtils]: 66: Hoare triple {29789#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,021 INFO L290 TraceCheckUtils]: 67: Hoare triple {29789#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,022 INFO L290 TraceCheckUtils]: 68: Hoare triple {29789#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,022 INFO L290 TraceCheckUtils]: 69: Hoare triple {29789#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,022 INFO L290 TraceCheckUtils]: 70: Hoare triple {29789#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,022 INFO L290 TraceCheckUtils]: 71: Hoare triple {29789#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,022 INFO L290 TraceCheckUtils]: 72: Hoare triple {29789#false} assume 4416 == #t~mem54;havoc #t~mem54; {29789#false} is VALID [2022-04-08 15:13:54,022 INFO L290 TraceCheckUtils]: 73: Hoare triple {29789#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {29789#false} is VALID [2022-04-08 15:13:54,022 INFO L290 TraceCheckUtils]: 74: Hoare triple {29789#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {29789#false} is VALID [2022-04-08 15:13:54,022 INFO L290 TraceCheckUtils]: 75: Hoare triple {29789#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {29789#false} is VALID [2022-04-08 15:13:54,022 INFO L290 TraceCheckUtils]: 76: Hoare triple {29789#false} assume !(0 == ~tmp___6~0); {29789#false} is VALID [2022-04-08 15:13:54,022 INFO L290 TraceCheckUtils]: 77: Hoare triple {29789#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,022 INFO L290 TraceCheckUtils]: 78: Hoare triple {29789#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {29789#false} is VALID [2022-04-08 15:13:54,023 INFO L290 TraceCheckUtils]: 79: Hoare triple {29789#false} ~skip~0 := 0; {29789#false} is VALID [2022-04-08 15:13:54,023 INFO L290 TraceCheckUtils]: 80: Hoare triple {29789#false} assume !false; {29789#false} is VALID [2022-04-08 15:13:54,023 INFO L290 TraceCheckUtils]: 81: Hoare triple {29789#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,023 INFO L290 TraceCheckUtils]: 82: Hoare triple {29789#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,023 INFO L290 TraceCheckUtils]: 83: Hoare triple {29789#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,023 INFO L290 TraceCheckUtils]: 84: Hoare triple {29789#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,023 INFO L290 TraceCheckUtils]: 85: Hoare triple {29789#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,023 INFO L290 TraceCheckUtils]: 86: Hoare triple {29789#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,023 INFO L290 TraceCheckUtils]: 87: Hoare triple {29789#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,023 INFO L290 TraceCheckUtils]: 88: Hoare triple {29789#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,023 INFO L290 TraceCheckUtils]: 89: Hoare triple {29789#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,023 INFO L290 TraceCheckUtils]: 90: Hoare triple {29789#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,024 INFO L290 TraceCheckUtils]: 91: Hoare triple {29789#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,024 INFO L290 TraceCheckUtils]: 92: Hoare triple {29789#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,024 INFO L290 TraceCheckUtils]: 93: Hoare triple {29789#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,024 INFO L290 TraceCheckUtils]: 94: Hoare triple {29789#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-08 15:13:54,024 INFO L290 TraceCheckUtils]: 95: Hoare triple {29789#false} assume 4432 == #t~mem56;havoc #t~mem56; {29789#false} is VALID [2022-04-08 15:13:54,024 INFO L290 TraceCheckUtils]: 96: Hoare triple {29789#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {29789#false} is VALID [2022-04-08 15:13:54,024 INFO L290 TraceCheckUtils]: 97: Hoare triple {29789#false} assume 5 == ~blastFlag~0; {29789#false} is VALID [2022-04-08 15:13:54,024 INFO L290 TraceCheckUtils]: 98: Hoare triple {29789#false} assume !false; {29789#false} is VALID [2022-04-08 15:13:54,025 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-08 15:13:54,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:54,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992163394] [2022-04-08 15:13:54,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992163394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:54,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:54,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:54,026 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:54,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1256099424] [2022-04-08 15:13:54,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1256099424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:54,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:54,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:54,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343876114] [2022-04-08 15:13:54,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:54,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 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 99 [2022-04-08 15:13:54,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:54,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 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-08 15:13:54,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:54,091 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:54,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:54,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:54,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:54,093 INFO L87 Difference]: Start difference. First operand 398 states and 616 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 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-08 15:13:56,119 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-08 15:13:57,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:57,126 INFO L93 Difference]: Finished difference Result 911 states and 1392 transitions. [2022-04-08 15:13:57,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:57,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 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 99 [2022-04-08 15:13:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 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-08 15:13:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-08 15:13:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 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-08 15:13:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-08 15:13:57,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-08 15:13:57,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:57,490 INFO L225 Difference]: With dead ends: 911 [2022-04-08 15:13:57,490 INFO L226 Difference]: Without dead ends: 529 [2022-04-08 15:13:57,491 INFO L912 BasicCegarLoop]: 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-08 15:13:57,491 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 114 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:57,491 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 298 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 391 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:13:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-04-08 15:13:57,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 398. [2022-04-08 15:13:57,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:57,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 529 states. Second operand has 398 states, 393 states have (on average 1.539440203562341) internal successors, (605), 393 states have internal predecessors, (605), 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-08 15:13:57,512 INFO L74 IsIncluded]: Start isIncluded. First operand 529 states. Second operand has 398 states, 393 states have (on average 1.539440203562341) internal successors, (605), 393 states have internal predecessors, (605), 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-08 15:13:57,512 INFO L87 Difference]: Start difference. First operand 529 states. Second operand has 398 states, 393 states have (on average 1.539440203562341) internal successors, (605), 393 states have internal predecessors, (605), 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-08 15:13:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:57,527 INFO L93 Difference]: Finished difference Result 529 states and 789 transitions. [2022-04-08 15:13:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 789 transitions. [2022-04-08 15:13:57,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:57,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:57,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 398 states, 393 states have (on average 1.539440203562341) internal successors, (605), 393 states have internal predecessors, (605), 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 529 states. [2022-04-08 15:13:57,529 INFO L87 Difference]: Start difference. First operand has 398 states, 393 states have (on average 1.539440203562341) internal successors, (605), 393 states have internal predecessors, (605), 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 529 states. [2022-04-08 15:13:57,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:57,544 INFO L93 Difference]: Finished difference Result 529 states and 789 transitions. [2022-04-08 15:13:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 789 transitions. [2022-04-08 15:13:57,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:57,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:57,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:57,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:57,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 393 states have (on average 1.539440203562341) internal successors, (605), 393 states have internal predecessors, (605), 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-08 15:13:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 609 transitions. [2022-04-08 15:13:57,557 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 609 transitions. Word has length 99 [2022-04-08 15:13:57,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:57,557 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 609 transitions. [2022-04-08 15:13:57,557 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 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-08 15:13:57,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 398 states and 609 transitions. [2022-04-08 15:13:58,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:58,078 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 609 transitions. [2022-04-08 15:13:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 15:13:58,079 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:58,080 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:13:58,080 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 15:13:58,080 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:58,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:58,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1726018170, now seen corresponding path program 1 times [2022-04-08 15:13:58,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:58,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2114553261] [2022-04-08 15:13:58,081 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:58,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1726018170, now seen corresponding path program 2 times [2022-04-08 15:13:58,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:58,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366499484] [2022-04-08 15:13:58,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:58,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:58,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:58,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {33482#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {33476#true} is VALID [2022-04-08 15:13:58,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {33476#true} assume true; {33476#true} is VALID [2022-04-08 15:13:58,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33476#true} {33476#true} #591#return; {33476#true} is VALID [2022-04-08 15:13:58,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {33476#true} call ULTIMATE.init(); {33482#(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-08 15:13:58,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {33482#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {33476#true} is VALID [2022-04-08 15:13:58,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {33476#true} assume true; {33476#true} is VALID [2022-04-08 15:13:58,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33476#true} {33476#true} #591#return; {33476#true} is VALID [2022-04-08 15:13:58,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {33476#true} call #t~ret159 := main(); {33476#true} is VALID [2022-04-08 15:13:58,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {33476#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {33476#true} is VALID [2022-04-08 15:13:58,266 INFO L272 TraceCheckUtils]: 6: Hoare triple {33476#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {33476#true} is VALID [2022-04-08 15:13:58,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {33476#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {33476#true} is VALID [2022-04-08 15:13:58,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {33476#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {33476#true} is VALID [2022-04-08 15:13:58,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {33476#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {33476#true} is VALID [2022-04-08 15:13:58,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {33476#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {33476#true} is VALID [2022-04-08 15:13:58,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {33476#true} assume !false; {33476#true} is VALID [2022-04-08 15:13:58,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {33476#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {33476#true} assume 12292 == #t~mem43;havoc #t~mem43; {33476#true} is VALID [2022-04-08 15:13:58,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {33476#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {33476#true} is VALID [2022-04-08 15:13:58,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {33476#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {33476#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {33476#true} is VALID [2022-04-08 15:13:58,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {33476#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {33476#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {33476#true} is VALID [2022-04-08 15:13:58,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {33476#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {33476#true} is VALID [2022-04-08 15:13:58,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {33476#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {33476#true} is VALID [2022-04-08 15:13:58,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {33476#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {33476#true} is VALID [2022-04-08 15:13:58,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {33476#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {33476#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {33476#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {33476#true} is VALID [2022-04-08 15:13:58,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {33476#true} ~skip~0 := 0; {33476#true} is VALID [2022-04-08 15:13:58,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {33476#true} assume !false; {33476#true} is VALID [2022-04-08 15:13:58,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {33476#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {33476#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {33476#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {33476#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {33476#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {33476#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {33476#true} assume 4368 == #t~mem48;havoc #t~mem48; {33476#true} is VALID [2022-04-08 15:13:58,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {33476#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {33476#true} is VALID [2022-04-08 15:13:58,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {33476#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {33476#true} is VALID [2022-04-08 15:13:58,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {33476#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {33476#true} is VALID [2022-04-08 15:13:58,269 INFO L290 TraceCheckUtils]: 37: Hoare triple {33476#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {33476#true} is VALID [2022-04-08 15:13:58,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {33476#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {33476#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {33476#true} is VALID [2022-04-08 15:13:58,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {33476#true} ~skip~0 := 0; {33476#true} is VALID [2022-04-08 15:13:58,269 INFO L290 TraceCheckUtils]: 41: Hoare triple {33476#true} assume !false; {33476#true} is VALID [2022-04-08 15:13:58,269 INFO L290 TraceCheckUtils]: 42: Hoare triple {33476#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,269 INFO L290 TraceCheckUtils]: 43: Hoare triple {33476#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,269 INFO L290 TraceCheckUtils]: 44: Hoare triple {33476#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,269 INFO L290 TraceCheckUtils]: 45: Hoare triple {33476#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,269 INFO L290 TraceCheckUtils]: 46: Hoare triple {33476#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,269 INFO L290 TraceCheckUtils]: 47: Hoare triple {33476#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,270 INFO L290 TraceCheckUtils]: 48: Hoare triple {33476#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {33476#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-08 15:13:58,270 INFO L290 TraceCheckUtils]: 50: Hoare triple {33476#true} assume 4384 == #t~mem50;havoc #t~mem50; {33476#true} is VALID [2022-04-08 15:13:58,270 INFO L290 TraceCheckUtils]: 51: Hoare triple {33476#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {33476#true} is VALID [2022-04-08 15:13:58,270 INFO L290 TraceCheckUtils]: 52: Hoare triple {33476#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,271 INFO L290 TraceCheckUtils]: 53: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,271 INFO L290 TraceCheckUtils]: 54: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,271 INFO L290 TraceCheckUtils]: 55: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,271 INFO L290 TraceCheckUtils]: 56: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,272 INFO L290 TraceCheckUtils]: 57: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,272 INFO L290 TraceCheckUtils]: 58: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,272 INFO L290 TraceCheckUtils]: 59: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,273 INFO L290 TraceCheckUtils]: 60: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,273 INFO L290 TraceCheckUtils]: 61: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,273 INFO L290 TraceCheckUtils]: 62: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,274 INFO L290 TraceCheckUtils]: 63: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,274 INFO L290 TraceCheckUtils]: 64: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,274 INFO L290 TraceCheckUtils]: 65: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,275 INFO L290 TraceCheckUtils]: 66: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,275 INFO L290 TraceCheckUtils]: 67: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,275 INFO L290 TraceCheckUtils]: 68: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,276 INFO L290 TraceCheckUtils]: 69: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,276 INFO L290 TraceCheckUtils]: 70: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,276 INFO L290 TraceCheckUtils]: 71: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,276 INFO L290 TraceCheckUtils]: 72: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume 4416 == #t~mem54;havoc #t~mem54; {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,277 INFO L290 TraceCheckUtils]: 73: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:58,277 INFO L290 TraceCheckUtils]: 74: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {33477#false} is VALID [2022-04-08 15:13:58,277 INFO L290 TraceCheckUtils]: 75: Hoare triple {33477#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {33477#false} is VALID [2022-04-08 15:13:58,277 INFO L290 TraceCheckUtils]: 76: Hoare triple {33477#false} assume !(0 == ~tmp___6~0); {33477#false} is VALID [2022-04-08 15:13:58,277 INFO L290 TraceCheckUtils]: 77: Hoare triple {33477#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {33477#false} is VALID [2022-04-08 15:13:58,278 INFO L290 TraceCheckUtils]: 78: Hoare triple {33477#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {33477#false} is VALID [2022-04-08 15:13:58,278 INFO L290 TraceCheckUtils]: 79: Hoare triple {33477#false} ~skip~0 := 0; {33477#false} is VALID [2022-04-08 15:13:58,278 INFO L290 TraceCheckUtils]: 80: Hoare triple {33477#false} assume !false; {33477#false} is VALID [2022-04-08 15:13:58,278 INFO L290 TraceCheckUtils]: 81: Hoare triple {33477#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-08 15:13:58,278 INFO L290 TraceCheckUtils]: 82: Hoare triple {33477#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-08 15:13:58,278 INFO L290 TraceCheckUtils]: 83: Hoare triple {33477#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-08 15:13:58,278 INFO L290 TraceCheckUtils]: 84: Hoare triple {33477#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-08 15:13:58,278 INFO L290 TraceCheckUtils]: 85: Hoare triple {33477#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-08 15:13:58,278 INFO L290 TraceCheckUtils]: 86: Hoare triple {33477#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-08 15:13:58,278 INFO L290 TraceCheckUtils]: 87: Hoare triple {33477#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-08 15:13:58,278 INFO L290 TraceCheckUtils]: 88: Hoare triple {33477#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-08 15:13:58,278 INFO L290 TraceCheckUtils]: 89: Hoare triple {33477#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-08 15:13:58,279 INFO L290 TraceCheckUtils]: 90: Hoare triple {33477#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-08 15:13:58,279 INFO L290 TraceCheckUtils]: 91: Hoare triple {33477#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-08 15:13:58,279 INFO L290 TraceCheckUtils]: 92: Hoare triple {33477#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-08 15:13:58,279 INFO L290 TraceCheckUtils]: 93: Hoare triple {33477#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-08 15:13:58,279 INFO L290 TraceCheckUtils]: 94: Hoare triple {33477#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-08 15:13:58,279 INFO L290 TraceCheckUtils]: 95: Hoare triple {33477#false} assume 4432 == #t~mem56;havoc #t~mem56; {33477#false} is VALID [2022-04-08 15:13:58,279 INFO L290 TraceCheckUtils]: 96: Hoare triple {33477#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {33477#false} is VALID [2022-04-08 15:13:58,279 INFO L290 TraceCheckUtils]: 97: Hoare triple {33477#false} assume 5 == ~blastFlag~0; {33477#false} is VALID [2022-04-08 15:13:58,279 INFO L290 TraceCheckUtils]: 98: Hoare triple {33477#false} assume !false; {33477#false} is VALID [2022-04-08 15:13:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-08 15:13:58,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:58,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366499484] [2022-04-08 15:13:58,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366499484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:58,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:58,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:13:58,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:58,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2114553261] [2022-04-08 15:13:58,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2114553261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:58,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:58,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:13:58,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042148860] [2022-04-08 15:13:58,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:58,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 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 99 [2022-04-08 15:13:58,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:58,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 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-08 15:13:58,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:58,352 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:13:58,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:58,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:13:58,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:13:58,353 INFO L87 Difference]: Start difference. First operand 398 states and 609 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 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-08 15:14:00,379 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-08 15:14:01,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:01,364 INFO L93 Difference]: Finished difference Result 799 states and 1231 transitions. [2022-04-08 15:14:01,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:14:01,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 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 99 [2022-04-08 15:14:01,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 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-08 15:14:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-08 15:14:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 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-08 15:14:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-08 15:14:01,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 495 transitions. [2022-04-08 15:14:01,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:01,711 INFO L225 Difference]: With dead ends: 799 [2022-04-08 15:14:01,711 INFO L226 Difference]: Without dead ends: 597 [2022-04-08 15:14:01,712 INFO L912 BasicCegarLoop]: 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-08 15:14:01,712 INFO L913 BasicCegarLoop]: 319 mSDtfsCounter, 130 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:01,713 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 483 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:14:01,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-04-08 15:14:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2022-04-08 15:14:01,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:01,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 597 states. Second operand has 597 states, 592 states have (on average 1.535472972972973) internal successors, (909), 592 states have internal predecessors, (909), 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-08 15:14:01,744 INFO L74 IsIncluded]: Start isIncluded. First operand 597 states. Second operand has 597 states, 592 states have (on average 1.535472972972973) internal successors, (909), 592 states have internal predecessors, (909), 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-08 15:14:01,745 INFO L87 Difference]: Start difference. First operand 597 states. Second operand has 597 states, 592 states have (on average 1.535472972972973) internal successors, (909), 592 states have internal predecessors, (909), 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-08 15:14:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:01,759 INFO L93 Difference]: Finished difference Result 597 states and 913 transitions. [2022-04-08 15:14:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 913 transitions. [2022-04-08 15:14:01,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:01,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:01,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 597 states, 592 states have (on average 1.535472972972973) internal successors, (909), 592 states have internal predecessors, (909), 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 597 states. [2022-04-08 15:14:01,762 INFO L87 Difference]: Start difference. First operand has 597 states, 592 states have (on average 1.535472972972973) internal successors, (909), 592 states have internal predecessors, (909), 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 597 states. [2022-04-08 15:14:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:01,780 INFO L93 Difference]: Finished difference Result 597 states and 913 transitions. [2022-04-08 15:14:01,780 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 913 transitions. [2022-04-08 15:14:01,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:01,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:01,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:01,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:01,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 592 states have (on average 1.535472972972973) internal successors, (909), 592 states have internal predecessors, (909), 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-08 15:14:01,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 913 transitions. [2022-04-08 15:14:01,802 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 913 transitions. Word has length 99 [2022-04-08 15:14:01,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:01,803 INFO L478 AbstractCegarLoop]: Abstraction has 597 states and 913 transitions. [2022-04-08 15:14:01,803 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 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-08 15:14:01,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 597 states and 913 transitions. [2022-04-08 15:14:02,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 913 edges. 913 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:02,549 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 913 transitions. [2022-04-08 15:14:02,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 15:14:02,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:02,550 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:14:02,550 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 15:14:02,550 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:02,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:02,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1372929788, now seen corresponding path program 1 times [2022-04-08 15:14:02,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:02,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [815406445] [2022-04-08 15:14:02,551 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:02,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1372929788, now seen corresponding path program 2 times [2022-04-08 15:14:02,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:02,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107206190] [2022-04-08 15:14:02,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:02,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:02,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:02,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {37477#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {37471#true} is VALID [2022-04-08 15:14:02,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {37471#true} assume true; {37471#true} is VALID [2022-04-08 15:14:02,702 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37471#true} {37471#true} #591#return; {37471#true} is VALID [2022-04-08 15:14:02,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {37471#true} call ULTIMATE.init(); {37477#(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-08 15:14:02,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {37477#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {37471#true} is VALID [2022-04-08 15:14:02,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {37471#true} assume true; {37471#true} is VALID [2022-04-08 15:14:02,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37471#true} {37471#true} #591#return; {37471#true} is VALID [2022-04-08 15:14:02,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {37471#true} call #t~ret159 := main(); {37471#true} is VALID [2022-04-08 15:14:02,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {37471#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {37471#true} is VALID [2022-04-08 15:14:02,704 INFO L272 TraceCheckUtils]: 6: Hoare triple {37471#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {37471#true} is VALID [2022-04-08 15:14:02,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {37471#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {37471#true} is VALID [2022-04-08 15:14:02,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {37471#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {37471#true} is VALID [2022-04-08 15:14:02,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {37471#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {37471#true} is VALID [2022-04-08 15:14:02,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {37471#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37471#true} is VALID [2022-04-08 15:14:02,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {37471#true} assume !false; {37471#true} is VALID [2022-04-08 15:14:02,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {37471#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37471#true} is VALID [2022-04-08 15:14:02,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {37471#true} assume 12292 == #t~mem43;havoc #t~mem43; {37471#true} is VALID [2022-04-08 15:14:02,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {37471#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {37471#true} is VALID [2022-04-08 15:14:02,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {37471#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {37471#true} is VALID [2022-04-08 15:14:02,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {37471#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {37471#true} is VALID [2022-04-08 15:14:02,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {37471#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {37471#true} is VALID [2022-04-08 15:14:02,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {37471#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {37471#true} is VALID [2022-04-08 15:14:02,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {37471#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {37471#true} is VALID [2022-04-08 15:14:02,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {37471#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {37471#true} is VALID [2022-04-08 15:14:02,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {37471#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {37471#true} is VALID [2022-04-08 15:14:02,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {37471#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {37471#true} is VALID [2022-04-08 15:14:02,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {37471#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {37471#true} is VALID [2022-04-08 15:14:02,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {37471#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {37471#true} is VALID [2022-04-08 15:14:02,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {37471#true} ~skip~0 := 0; {37471#true} is VALID [2022-04-08 15:14:02,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {37471#true} assume !false; {37471#true} is VALID [2022-04-08 15:14:02,706 INFO L290 TraceCheckUtils]: 27: Hoare triple {37471#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37471#true} is VALID [2022-04-08 15:14:02,706 INFO L290 TraceCheckUtils]: 28: Hoare triple {37471#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37471#true} is VALID [2022-04-08 15:14:02,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {37471#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37471#true} is VALID [2022-04-08 15:14:02,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {37471#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37471#true} is VALID [2022-04-08 15:14:02,706 INFO L290 TraceCheckUtils]: 31: Hoare triple {37471#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37471#true} is VALID [2022-04-08 15:14:02,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {37471#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37471#true} is VALID [2022-04-08 15:14:02,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {37471#true} assume 4368 == #t~mem48;havoc #t~mem48; {37471#true} is VALID [2022-04-08 15:14:02,706 INFO L290 TraceCheckUtils]: 34: Hoare triple {37471#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {37471#true} is VALID [2022-04-08 15:14:02,707 INFO L290 TraceCheckUtils]: 35: Hoare triple {37471#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:14:02,707 INFO L290 TraceCheckUtils]: 36: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:14:02,707 INFO L290 TraceCheckUtils]: 37: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:14:02,707 INFO L290 TraceCheckUtils]: 38: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:14:02,708 INFO L290 TraceCheckUtils]: 39: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:14:02,708 INFO L290 TraceCheckUtils]: 40: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:14:02,708 INFO L290 TraceCheckUtils]: 41: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !false; {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:14:02,709 INFO L290 TraceCheckUtils]: 42: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:14:02,709 INFO L290 TraceCheckUtils]: 43: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:14:02,709 INFO L290 TraceCheckUtils]: 44: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:14:02,710 INFO L290 TraceCheckUtils]: 45: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:14:02,710 INFO L290 TraceCheckUtils]: 46: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:14:02,710 INFO L290 TraceCheckUtils]: 47: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:14:02,710 INFO L290 TraceCheckUtils]: 48: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:14:02,711 INFO L290 TraceCheckUtils]: 49: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:14:02,711 INFO L290 TraceCheckUtils]: 50: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem50;havoc #t~mem50; {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:14:02,711 INFO L290 TraceCheckUtils]: 51: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:14:02,712 INFO L290 TraceCheckUtils]: 52: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {37472#false} is VALID [2022-04-08 15:14:02,712 INFO L290 TraceCheckUtils]: 53: Hoare triple {37472#false} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,712 INFO L290 TraceCheckUtils]: 54: Hoare triple {37472#false} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,712 INFO L290 TraceCheckUtils]: 55: Hoare triple {37472#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,712 INFO L290 TraceCheckUtils]: 56: Hoare triple {37472#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,712 INFO L290 TraceCheckUtils]: 57: Hoare triple {37472#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {37472#false} is VALID [2022-04-08 15:14:02,712 INFO L290 TraceCheckUtils]: 58: Hoare triple {37472#false} ~skip~0 := 0; {37472#false} is VALID [2022-04-08 15:14:02,712 INFO L290 TraceCheckUtils]: 59: Hoare triple {37472#false} assume !false; {37472#false} is VALID [2022-04-08 15:14:02,712 INFO L290 TraceCheckUtils]: 60: Hoare triple {37472#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,712 INFO L290 TraceCheckUtils]: 61: Hoare triple {37472#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,712 INFO L290 TraceCheckUtils]: 62: Hoare triple {37472#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,713 INFO L290 TraceCheckUtils]: 63: Hoare triple {37472#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,713 INFO L290 TraceCheckUtils]: 64: Hoare triple {37472#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,713 INFO L290 TraceCheckUtils]: 65: Hoare triple {37472#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,713 INFO L290 TraceCheckUtils]: 66: Hoare triple {37472#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,713 INFO L290 TraceCheckUtils]: 67: Hoare triple {37472#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,713 INFO L290 TraceCheckUtils]: 68: Hoare triple {37472#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,713 INFO L290 TraceCheckUtils]: 69: Hoare triple {37472#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,713 INFO L290 TraceCheckUtils]: 70: Hoare triple {37472#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,713 INFO L290 TraceCheckUtils]: 71: Hoare triple {37472#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,713 INFO L290 TraceCheckUtils]: 72: Hoare triple {37472#false} assume 4416 == #t~mem54;havoc #t~mem54; {37472#false} is VALID [2022-04-08 15:14:02,713 INFO L290 TraceCheckUtils]: 73: Hoare triple {37472#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {37472#false} is VALID [2022-04-08 15:14:02,713 INFO L290 TraceCheckUtils]: 74: Hoare triple {37472#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {37472#false} is VALID [2022-04-08 15:14:02,714 INFO L290 TraceCheckUtils]: 75: Hoare triple {37472#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {37472#false} is VALID [2022-04-08 15:14:02,714 INFO L290 TraceCheckUtils]: 76: Hoare triple {37472#false} assume !(0 == ~tmp___6~0); {37472#false} is VALID [2022-04-08 15:14:02,714 INFO L290 TraceCheckUtils]: 77: Hoare triple {37472#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,714 INFO L290 TraceCheckUtils]: 78: Hoare triple {37472#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {37472#false} is VALID [2022-04-08 15:14:02,714 INFO L290 TraceCheckUtils]: 79: Hoare triple {37472#false} ~skip~0 := 0; {37472#false} is VALID [2022-04-08 15:14:02,714 INFO L290 TraceCheckUtils]: 80: Hoare triple {37472#false} assume !false; {37472#false} is VALID [2022-04-08 15:14:02,714 INFO L290 TraceCheckUtils]: 81: Hoare triple {37472#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,714 INFO L290 TraceCheckUtils]: 82: Hoare triple {37472#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,714 INFO L290 TraceCheckUtils]: 83: Hoare triple {37472#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,714 INFO L290 TraceCheckUtils]: 84: Hoare triple {37472#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,714 INFO L290 TraceCheckUtils]: 85: Hoare triple {37472#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,714 INFO L290 TraceCheckUtils]: 86: Hoare triple {37472#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,714 INFO L290 TraceCheckUtils]: 87: Hoare triple {37472#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,715 INFO L290 TraceCheckUtils]: 88: Hoare triple {37472#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,715 INFO L290 TraceCheckUtils]: 89: Hoare triple {37472#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,715 INFO L290 TraceCheckUtils]: 90: Hoare triple {37472#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,715 INFO L290 TraceCheckUtils]: 91: Hoare triple {37472#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,715 INFO L290 TraceCheckUtils]: 92: Hoare triple {37472#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,715 INFO L290 TraceCheckUtils]: 93: Hoare triple {37472#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,715 INFO L290 TraceCheckUtils]: 94: Hoare triple {37472#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-08 15:14:02,715 INFO L290 TraceCheckUtils]: 95: Hoare triple {37472#false} assume 4432 == #t~mem56;havoc #t~mem56; {37472#false} is VALID [2022-04-08 15:14:02,715 INFO L290 TraceCheckUtils]: 96: Hoare triple {37472#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {37472#false} is VALID [2022-04-08 15:14:02,715 INFO L290 TraceCheckUtils]: 97: Hoare triple {37472#false} assume 5 == ~blastFlag~0; {37472#false} is VALID [2022-04-08 15:14:02,715 INFO L290 TraceCheckUtils]: 98: Hoare triple {37472#false} assume !false; {37472#false} is VALID [2022-04-08 15:14:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-08 15:14:02,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:02,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107206190] [2022-04-08 15:14:02,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107206190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:02,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:02,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:14:02,716 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:02,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [815406445] [2022-04-08 15:14:02,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [815406445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:02,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:02,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:14:02,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734581071] [2022-04-08 15:14:02,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:02,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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 99 [2022-04-08 15:14:02,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:02,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-08 15:14:02,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:02,795 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:14:02,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:02,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:14:02,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:14:02,796 INFO L87 Difference]: Start difference. First operand 597 states and 913 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-08 15:14:04,822 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-08 15:14:05,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:05,464 INFO L93 Difference]: Finished difference Result 1022 states and 1563 transitions. [2022-04-08 15:14:05,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:14:05,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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 99 [2022-04-08 15:14:05,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-08 15:14:05,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2022-04-08 15:14:05,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-08 15:14:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2022-04-08 15:14:05,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 371 transitions. [2022-04-08 15:14:05,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:05,727 INFO L225 Difference]: With dead ends: 1022 [2022-04-08 15:14:05,727 INFO L226 Difference]: Without dead ends: 621 [2022-04-08 15:14:05,728 INFO L912 BasicCegarLoop]: 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-08 15:14:05,728 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 15 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:05,728 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 363 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 215 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 15:14:05,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2022-04-08 15:14:05,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2022-04-08 15:14:05,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:05,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 621 states. Second operand has 621 states, 616 states have (on average 1.5275974025974026) internal successors, (941), 616 states have internal predecessors, (941), 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-08 15:14:05,772 INFO L74 IsIncluded]: Start isIncluded. First operand 621 states. Second operand has 621 states, 616 states have (on average 1.5275974025974026) internal successors, (941), 616 states have internal predecessors, (941), 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-08 15:14:05,772 INFO L87 Difference]: Start difference. First operand 621 states. Second operand has 621 states, 616 states have (on average 1.5275974025974026) internal successors, (941), 616 states have internal predecessors, (941), 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-08 15:14:05,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:05,791 INFO L93 Difference]: Finished difference Result 621 states and 945 transitions. [2022-04-08 15:14:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 945 transitions. [2022-04-08 15:14:05,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:05,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:05,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 621 states, 616 states have (on average 1.5275974025974026) internal successors, (941), 616 states have internal predecessors, (941), 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 621 states. [2022-04-08 15:14:05,794 INFO L87 Difference]: Start difference. First operand has 621 states, 616 states have (on average 1.5275974025974026) internal successors, (941), 616 states have internal predecessors, (941), 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 621 states. [2022-04-08 15:14:05,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:05,813 INFO L93 Difference]: Finished difference Result 621 states and 945 transitions. [2022-04-08 15:14:05,813 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 945 transitions. [2022-04-08 15:14:05,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:05,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:05,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:05,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 616 states have (on average 1.5275974025974026) internal successors, (941), 616 states have internal predecessors, (941), 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-08 15:14:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 945 transitions. [2022-04-08 15:14:05,841 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 945 transitions. Word has length 99 [2022-04-08 15:14:05,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:05,841 INFO L478 AbstractCegarLoop]: Abstraction has 621 states and 945 transitions. [2022-04-08 15:14:05,841 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-08 15:14:05,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 621 states and 945 transitions. [2022-04-08 15:14:06,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 945 edges. 945 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 945 transitions. [2022-04-08 15:14:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-08 15:14:06,611 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:06,611 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:14:06,611 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 15:14:06,611 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:06,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:06,611 INFO L85 PathProgramCache]: Analyzing trace with hash -816970310, now seen corresponding path program 1 times [2022-04-08 15:14:06,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:06,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1773436845] [2022-04-08 15:14:06,612 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:06,612 INFO L85 PathProgramCache]: Analyzing trace with hash -816970310, now seen corresponding path program 2 times [2022-04-08 15:14:06,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:06,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451161787] [2022-04-08 15:14:06,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:06,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:06,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:06,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {42014#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {42008#true} is VALID [2022-04-08 15:14:06,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {42008#true} assume true; {42008#true} is VALID [2022-04-08 15:14:06,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42008#true} {42008#true} #591#return; {42008#true} is VALID [2022-04-08 15:14:06,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {42008#true} call ULTIMATE.init(); {42014#(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-08 15:14:06,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {42014#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {42008#true} is VALID [2022-04-08 15:14:06,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {42008#true} assume true; {42008#true} is VALID [2022-04-08 15:14:06,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42008#true} {42008#true} #591#return; {42008#true} is VALID [2022-04-08 15:14:06,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {42008#true} call #t~ret159 := main(); {42008#true} is VALID [2022-04-08 15:14:06,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {42008#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {42008#true} is VALID [2022-04-08 15:14:06,796 INFO L272 TraceCheckUtils]: 6: Hoare triple {42008#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {42008#true} is VALID [2022-04-08 15:14:06,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {42008#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {42008#true} is VALID [2022-04-08 15:14:06,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {42008#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {42008#true} is VALID [2022-04-08 15:14:06,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {42008#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {42008#true} is VALID [2022-04-08 15:14:06,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {42008#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {42008#true} is VALID [2022-04-08 15:14:06,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {42008#true} assume !false; {42008#true} is VALID [2022-04-08 15:14:06,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {42008#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {42008#true} assume 12292 == #t~mem43;havoc #t~mem43; {42008#true} is VALID [2022-04-08 15:14:06,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {42008#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {42008#true} is VALID [2022-04-08 15:14:06,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {42008#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {42008#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {42008#true} is VALID [2022-04-08 15:14:06,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {42008#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {42008#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {42008#true} is VALID [2022-04-08 15:14:06,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {42008#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {42008#true} is VALID [2022-04-08 15:14:06,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {42008#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {42008#true} is VALID [2022-04-08 15:14:06,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {42008#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {42008#true} is VALID [2022-04-08 15:14:06,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {42008#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {42008#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {42008#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {42008#true} is VALID [2022-04-08 15:14:06,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {42008#true} ~skip~0 := 0; {42008#true} is VALID [2022-04-08 15:14:06,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {42008#true} assume !false; {42008#true} is VALID [2022-04-08 15:14:06,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {42008#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {42008#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {42008#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {42008#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {42008#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {42008#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {42008#true} assume 4368 == #t~mem48;havoc #t~mem48; {42008#true} is VALID [2022-04-08 15:14:06,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {42008#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {42008#true} is VALID [2022-04-08 15:14:06,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {42008#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42008#true} is VALID [2022-04-08 15:14:06,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {42008#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {42008#true} is VALID [2022-04-08 15:14:06,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {42008#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {42008#true} is VALID [2022-04-08 15:14:06,799 INFO L290 TraceCheckUtils]: 38: Hoare triple {42008#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {42008#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {42008#true} is VALID [2022-04-08 15:14:06,799 INFO L290 TraceCheckUtils]: 40: Hoare triple {42008#true} ~skip~0 := 0; {42008#true} is VALID [2022-04-08 15:14:06,799 INFO L290 TraceCheckUtils]: 41: Hoare triple {42008#true} assume !false; {42008#true} is VALID [2022-04-08 15:14:06,799 INFO L290 TraceCheckUtils]: 42: Hoare triple {42008#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,799 INFO L290 TraceCheckUtils]: 43: Hoare triple {42008#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {42008#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,799 INFO L290 TraceCheckUtils]: 45: Hoare triple {42008#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,799 INFO L290 TraceCheckUtils]: 46: Hoare triple {42008#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {42008#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,800 INFO L290 TraceCheckUtils]: 48: Hoare triple {42008#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,800 INFO L290 TraceCheckUtils]: 49: Hoare triple {42008#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,800 INFO L290 TraceCheckUtils]: 50: Hoare triple {42008#true} assume 4384 == #t~mem50;havoc #t~mem50; {42008#true} is VALID [2022-04-08 15:14:06,800 INFO L290 TraceCheckUtils]: 51: Hoare triple {42008#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {42008#true} is VALID [2022-04-08 15:14:06,800 INFO L290 TraceCheckUtils]: 52: Hoare triple {42008#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {42008#true} is VALID [2022-04-08 15:14:06,800 INFO L290 TraceCheckUtils]: 53: Hoare triple {42008#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,800 INFO L290 TraceCheckUtils]: 54: Hoare triple {42008#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,800 INFO L290 TraceCheckUtils]: 55: Hoare triple {42008#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,800 INFO L290 TraceCheckUtils]: 56: Hoare triple {42008#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,800 INFO L290 TraceCheckUtils]: 57: Hoare triple {42008#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {42008#true} is VALID [2022-04-08 15:14:06,800 INFO L290 TraceCheckUtils]: 58: Hoare triple {42008#true} ~skip~0 := 0; {42008#true} is VALID [2022-04-08 15:14:06,800 INFO L290 TraceCheckUtils]: 59: Hoare triple {42008#true} assume !false; {42008#true} is VALID [2022-04-08 15:14:06,801 INFO L290 TraceCheckUtils]: 60: Hoare triple {42008#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,801 INFO L290 TraceCheckUtils]: 61: Hoare triple {42008#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,801 INFO L290 TraceCheckUtils]: 62: Hoare triple {42008#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,801 INFO L290 TraceCheckUtils]: 63: Hoare triple {42008#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,801 INFO L290 TraceCheckUtils]: 64: Hoare triple {42008#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,801 INFO L290 TraceCheckUtils]: 65: Hoare triple {42008#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,801 INFO L290 TraceCheckUtils]: 66: Hoare triple {42008#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,801 INFO L290 TraceCheckUtils]: 67: Hoare triple {42008#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,801 INFO L290 TraceCheckUtils]: 68: Hoare triple {42008#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,801 INFO L290 TraceCheckUtils]: 69: Hoare triple {42008#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,801 INFO L290 TraceCheckUtils]: 70: Hoare triple {42008#true} assume 4400 == #t~mem52;havoc #t~mem52; {42008#true} is VALID [2022-04-08 15:14:06,801 INFO L290 TraceCheckUtils]: 71: Hoare triple {42008#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {42008#true} is VALID [2022-04-08 15:14:06,802 INFO L290 TraceCheckUtils]: 72: Hoare triple {42008#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {42008#true} is VALID [2022-04-08 15:14:06,802 INFO L290 TraceCheckUtils]: 73: Hoare triple {42008#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {42008#true} is VALID [2022-04-08 15:14:06,802 INFO L290 TraceCheckUtils]: 74: Hoare triple {42008#true} assume !(~ret~0 <= 0); {42008#true} is VALID [2022-04-08 15:14:06,802 INFO L290 TraceCheckUtils]: 75: Hoare triple {42008#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,802 INFO L290 TraceCheckUtils]: 76: Hoare triple {42008#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,802 INFO L290 TraceCheckUtils]: 77: Hoare triple {42008#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {42008#true} is VALID [2022-04-08 15:14:06,802 INFO L290 TraceCheckUtils]: 78: Hoare triple {42008#true} ~skip~0 := 0; {42008#true} is VALID [2022-04-08 15:14:06,802 INFO L290 TraceCheckUtils]: 79: Hoare triple {42008#true} assume !false; {42008#true} is VALID [2022-04-08 15:14:06,802 INFO L290 TraceCheckUtils]: 80: Hoare triple {42008#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,802 INFO L290 TraceCheckUtils]: 81: Hoare triple {42008#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,802 INFO L290 TraceCheckUtils]: 82: Hoare triple {42008#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,802 INFO L290 TraceCheckUtils]: 83: Hoare triple {42008#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,803 INFO L290 TraceCheckUtils]: 84: Hoare triple {42008#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,803 INFO L290 TraceCheckUtils]: 85: Hoare triple {42008#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,803 INFO L290 TraceCheckUtils]: 86: Hoare triple {42008#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,803 INFO L290 TraceCheckUtils]: 87: Hoare triple {42008#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,803 INFO L290 TraceCheckUtils]: 88: Hoare triple {42008#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,803 INFO L290 TraceCheckUtils]: 89: Hoare triple {42008#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,803 INFO L290 TraceCheckUtils]: 90: Hoare triple {42008#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,803 INFO L290 TraceCheckUtils]: 91: Hoare triple {42008#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-08 15:14:06,803 INFO L290 TraceCheckUtils]: 92: Hoare triple {42008#true} assume 4416 == #t~mem54;havoc #t~mem54; {42008#true} is VALID [2022-04-08 15:14:06,803 INFO L290 TraceCheckUtils]: 93: Hoare triple {42008#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {42008#true} is VALID [2022-04-08 15:14:06,804 INFO L290 TraceCheckUtils]: 94: Hoare triple {42008#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,804 INFO L290 TraceCheckUtils]: 95: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,804 INFO L290 TraceCheckUtils]: 96: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,805 INFO L290 TraceCheckUtils]: 97: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,805 INFO L290 TraceCheckUtils]: 98: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,805 INFO L290 TraceCheckUtils]: 99: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,806 INFO L290 TraceCheckUtils]: 100: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !false; {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,806 INFO L290 TraceCheckUtils]: 101: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,806 INFO L290 TraceCheckUtils]: 102: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,807 INFO L290 TraceCheckUtils]: 103: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,807 INFO L290 TraceCheckUtils]: 104: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,807 INFO L290 TraceCheckUtils]: 105: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,807 INFO L290 TraceCheckUtils]: 106: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,808 INFO L290 TraceCheckUtils]: 107: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,808 INFO L290 TraceCheckUtils]: 108: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,808 INFO L290 TraceCheckUtils]: 109: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,809 INFO L290 TraceCheckUtils]: 110: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,809 INFO L290 TraceCheckUtils]: 111: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,809 INFO L290 TraceCheckUtils]: 112: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,810 INFO L290 TraceCheckUtils]: 113: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,810 INFO L290 TraceCheckUtils]: 114: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,810 INFO L290 TraceCheckUtils]: 115: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem56;havoc #t~mem56; {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,811 INFO L290 TraceCheckUtils]: 116: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:14:06,811 INFO L290 TraceCheckUtils]: 117: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {42009#false} is VALID [2022-04-08 15:14:06,811 INFO L290 TraceCheckUtils]: 118: Hoare triple {42009#false} assume !false; {42009#false} is VALID [2022-04-08 15:14:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-08 15:14:06,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:06,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451161787] [2022-04-08 15:14:06,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451161787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:06,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:06,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:14:06,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:06,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1773436845] [2022-04-08 15:14:06,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1773436845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:06,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:06,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:14:06,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155445811] [2022-04-08 15:14:06,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:06,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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 119 [2022-04-08 15:14:06,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:06,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-08 15:14:06,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:06,884 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:14:06,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:06,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:14:06,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:14:06,885 INFO L87 Difference]: Start difference. First operand 621 states and 945 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-08 15:14:08,918 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-08 15:14:09,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:09,897 INFO L93 Difference]: Finished difference Result 1245 states and 1901 transitions. [2022-04-08 15:14:09,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:14:09,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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 119 [2022-04-08 15:14:09,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:09,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-08 15:14:09,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-08 15:14:09,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-08 15:14:09,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-08 15:14:09,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 493 transitions. [2022-04-08 15:14:10,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:10,253 INFO L225 Difference]: With dead ends: 1245 [2022-04-08 15:14:10,254 INFO L226 Difference]: Without dead ends: 820 [2022-04-08 15:14:10,254 INFO L912 BasicCegarLoop]: 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-08 15:14:10,255 INFO L913 BasicCegarLoop]: 318 mSDtfsCounter, 127 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:10,255 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 482 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 341 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:14:10,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2022-04-08 15:14:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 818. [2022-04-08 15:14:10,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:10,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 820 states. Second operand has 818 states, 813 states have (on average 1.5276752767527675) internal successors, (1242), 813 states have internal predecessors, (1242), 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-08 15:14:10,299 INFO L74 IsIncluded]: Start isIncluded. First operand 820 states. Second operand has 818 states, 813 states have (on average 1.5276752767527675) internal successors, (1242), 813 states have internal predecessors, (1242), 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-08 15:14:10,300 INFO L87 Difference]: Start difference. First operand 820 states. Second operand has 818 states, 813 states have (on average 1.5276752767527675) internal successors, (1242), 813 states have internal predecessors, (1242), 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-08 15:14:10,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:10,337 INFO L93 Difference]: Finished difference Result 820 states and 1247 transitions. [2022-04-08 15:14:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1247 transitions. [2022-04-08 15:14:10,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:10,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:10,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 818 states, 813 states have (on average 1.5276752767527675) internal successors, (1242), 813 states have internal predecessors, (1242), 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 820 states. [2022-04-08 15:14:10,340 INFO L87 Difference]: Start difference. First operand has 818 states, 813 states have (on average 1.5276752767527675) internal successors, (1242), 813 states have internal predecessors, (1242), 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 820 states. [2022-04-08 15:14:10,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:10,374 INFO L93 Difference]: Finished difference Result 820 states and 1247 transitions. [2022-04-08 15:14:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1247 transitions. [2022-04-08 15:14:10,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:10,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:10,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:10,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 813 states have (on average 1.5276752767527675) internal successors, (1242), 813 states have internal predecessors, (1242), 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-08 15:14:10,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1246 transitions. [2022-04-08 15:14:10,415 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1246 transitions. Word has length 119 [2022-04-08 15:14:10,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:10,415 INFO L478 AbstractCegarLoop]: Abstraction has 818 states and 1246 transitions. [2022-04-08 15:14:10,415 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-08 15:14:10,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 818 states and 1246 transitions. [2022-04-08 15:14:11,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1246 edges. 1246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:11,422 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1246 transitions. [2022-04-08 15:14:11,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-08 15:14:11,423 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:11,423 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:14:11,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 15:14:11,423 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:11,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:11,424 INFO L85 PathProgramCache]: Analyzing trace with hash -676421700, now seen corresponding path program 1 times [2022-04-08 15:14:11,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:11,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [52887339] [2022-04-08 15:14:11,424 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:11,424 INFO L85 PathProgramCache]: Analyzing trace with hash -676421700, now seen corresponding path program 2 times [2022-04-08 15:14:11,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:11,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369286701] [2022-04-08 15:14:11,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:11,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:11,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:11,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {47789#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {47783#true} is VALID [2022-04-08 15:14:11,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {47783#true} assume true; {47783#true} is VALID [2022-04-08 15:14:11,614 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47783#true} {47783#true} #591#return; {47783#true} is VALID [2022-04-08 15:14:11,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {47783#true} call ULTIMATE.init(); {47789#(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-08 15:14:11,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {47789#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {47783#true} is VALID [2022-04-08 15:14:11,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {47783#true} assume true; {47783#true} is VALID [2022-04-08 15:14:11,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47783#true} {47783#true} #591#return; {47783#true} is VALID [2022-04-08 15:14:11,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {47783#true} call #t~ret159 := main(); {47783#true} is VALID [2022-04-08 15:14:11,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {47783#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {47783#true} is VALID [2022-04-08 15:14:11,615 INFO L272 TraceCheckUtils]: 6: Hoare triple {47783#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {47783#true} is VALID [2022-04-08 15:14:11,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {47783#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {47783#true} is VALID [2022-04-08 15:14:11,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {47783#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {47783#true} is VALID [2022-04-08 15:14:11,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {47783#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {47783#true} is VALID [2022-04-08 15:14:11,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {47783#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {47783#true} is VALID [2022-04-08 15:14:11,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {47783#true} assume !false; {47783#true} is VALID [2022-04-08 15:14:11,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {47783#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {47783#true} assume 12292 == #t~mem43;havoc #t~mem43; {47783#true} is VALID [2022-04-08 15:14:11,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {47783#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {47783#true} is VALID [2022-04-08 15:14:11,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {47783#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {47783#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {47783#true} is VALID [2022-04-08 15:14:11,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {47783#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {47783#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {47783#true} is VALID [2022-04-08 15:14:11,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {47783#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {47783#true} is VALID [2022-04-08 15:14:11,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {47783#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {47783#true} is VALID [2022-04-08 15:14:11,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {47783#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {47783#true} is VALID [2022-04-08 15:14:11,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {47783#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {47783#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {47783#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {47783#true} is VALID [2022-04-08 15:14:11,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {47783#true} ~skip~0 := 0; {47783#true} is VALID [2022-04-08 15:14:11,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {47783#true} assume !false; {47783#true} is VALID [2022-04-08 15:14:11,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {47783#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {47783#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {47783#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {47783#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {47783#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,617 INFO L290 TraceCheckUtils]: 32: Hoare triple {47783#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,617 INFO L290 TraceCheckUtils]: 33: Hoare triple {47783#true} assume 4368 == #t~mem48;havoc #t~mem48; {47783#true} is VALID [2022-04-08 15:14:11,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {47783#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {47783#true} is VALID [2022-04-08 15:14:11,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {47783#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {47783#true} is VALID [2022-04-08 15:14:11,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {47783#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {47783#true} is VALID [2022-04-08 15:14:11,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {47783#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {47783#true} is VALID [2022-04-08 15:14:11,618 INFO L290 TraceCheckUtils]: 38: Hoare triple {47783#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {47783#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {47783#true} is VALID [2022-04-08 15:14:11,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {47783#true} ~skip~0 := 0; {47783#true} is VALID [2022-04-08 15:14:11,618 INFO L290 TraceCheckUtils]: 41: Hoare triple {47783#true} assume !false; {47783#true} is VALID [2022-04-08 15:14:11,618 INFO L290 TraceCheckUtils]: 42: Hoare triple {47783#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,618 INFO L290 TraceCheckUtils]: 43: Hoare triple {47783#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,618 INFO L290 TraceCheckUtils]: 44: Hoare triple {47783#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,618 INFO L290 TraceCheckUtils]: 45: Hoare triple {47783#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,618 INFO L290 TraceCheckUtils]: 46: Hoare triple {47783#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,618 INFO L290 TraceCheckUtils]: 47: Hoare triple {47783#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,618 INFO L290 TraceCheckUtils]: 48: Hoare triple {47783#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,618 INFO L290 TraceCheckUtils]: 49: Hoare triple {47783#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,619 INFO L290 TraceCheckUtils]: 50: Hoare triple {47783#true} assume 4384 == #t~mem50;havoc #t~mem50; {47783#true} is VALID [2022-04-08 15:14:11,619 INFO L290 TraceCheckUtils]: 51: Hoare triple {47783#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {47783#true} is VALID [2022-04-08 15:14:11,619 INFO L290 TraceCheckUtils]: 52: Hoare triple {47783#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {47783#true} is VALID [2022-04-08 15:14:11,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {47783#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,619 INFO L290 TraceCheckUtils]: 54: Hoare triple {47783#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,619 INFO L290 TraceCheckUtils]: 55: Hoare triple {47783#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,619 INFO L290 TraceCheckUtils]: 56: Hoare triple {47783#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,619 INFO L290 TraceCheckUtils]: 57: Hoare triple {47783#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {47783#true} is VALID [2022-04-08 15:14:11,619 INFO L290 TraceCheckUtils]: 58: Hoare triple {47783#true} ~skip~0 := 0; {47783#true} is VALID [2022-04-08 15:14:11,619 INFO L290 TraceCheckUtils]: 59: Hoare triple {47783#true} assume !false; {47783#true} is VALID [2022-04-08 15:14:11,619 INFO L290 TraceCheckUtils]: 60: Hoare triple {47783#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,619 INFO L290 TraceCheckUtils]: 61: Hoare triple {47783#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,620 INFO L290 TraceCheckUtils]: 62: Hoare triple {47783#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,620 INFO L290 TraceCheckUtils]: 63: Hoare triple {47783#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,620 INFO L290 TraceCheckUtils]: 64: Hoare triple {47783#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,620 INFO L290 TraceCheckUtils]: 65: Hoare triple {47783#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,620 INFO L290 TraceCheckUtils]: 66: Hoare triple {47783#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,620 INFO L290 TraceCheckUtils]: 67: Hoare triple {47783#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,620 INFO L290 TraceCheckUtils]: 68: Hoare triple {47783#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,620 INFO L290 TraceCheckUtils]: 69: Hoare triple {47783#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-08 15:14:11,620 INFO L290 TraceCheckUtils]: 70: Hoare triple {47783#true} assume 4400 == #t~mem52;havoc #t~mem52; {47783#true} is VALID [2022-04-08 15:14:11,620 INFO L290 TraceCheckUtils]: 71: Hoare triple {47783#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {47783#true} is VALID [2022-04-08 15:14:11,620 INFO L290 TraceCheckUtils]: 72: Hoare triple {47783#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {47783#true} is VALID [2022-04-08 15:14:11,621 INFO L290 TraceCheckUtils]: 73: Hoare triple {47783#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,621 INFO L290 TraceCheckUtils]: 74: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,621 INFO L290 TraceCheckUtils]: 75: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,622 INFO L290 TraceCheckUtils]: 76: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,622 INFO L290 TraceCheckUtils]: 77: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,622 INFO L290 TraceCheckUtils]: 78: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,622 INFO L290 TraceCheckUtils]: 79: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,623 INFO L290 TraceCheckUtils]: 80: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,623 INFO L290 TraceCheckUtils]: 81: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,623 INFO L290 TraceCheckUtils]: 82: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,624 INFO L290 TraceCheckUtils]: 83: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,624 INFO L290 TraceCheckUtils]: 84: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,624 INFO L290 TraceCheckUtils]: 85: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,624 INFO L290 TraceCheckUtils]: 86: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,625 INFO L290 TraceCheckUtils]: 87: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,625 INFO L290 TraceCheckUtils]: 88: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,625 INFO L290 TraceCheckUtils]: 89: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,626 INFO L290 TraceCheckUtils]: 90: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,626 INFO L290 TraceCheckUtils]: 91: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,626 INFO L290 TraceCheckUtils]: 92: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume 4416 == #t~mem54;havoc #t~mem54; {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,626 INFO L290 TraceCheckUtils]: 93: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:14:11,627 INFO L290 TraceCheckUtils]: 94: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(3 == ~blastFlag~0); {47784#false} is VALID [2022-04-08 15:14:11,627 INFO L290 TraceCheckUtils]: 95: Hoare triple {47784#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {47784#false} is VALID [2022-04-08 15:14:11,627 INFO L290 TraceCheckUtils]: 96: Hoare triple {47784#false} assume !(0 == ~tmp___6~0); {47784#false} is VALID [2022-04-08 15:14:11,627 INFO L290 TraceCheckUtils]: 97: Hoare triple {47784#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {47784#false} is VALID [2022-04-08 15:14:11,627 INFO L290 TraceCheckUtils]: 98: Hoare triple {47784#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {47784#false} is VALID [2022-04-08 15:14:11,627 INFO L290 TraceCheckUtils]: 99: Hoare triple {47784#false} ~skip~0 := 0; {47784#false} is VALID [2022-04-08 15:14:11,627 INFO L290 TraceCheckUtils]: 100: Hoare triple {47784#false} assume !false; {47784#false} is VALID [2022-04-08 15:14:11,627 INFO L290 TraceCheckUtils]: 101: Hoare triple {47784#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-08 15:14:11,627 INFO L290 TraceCheckUtils]: 102: Hoare triple {47784#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-08 15:14:11,627 INFO L290 TraceCheckUtils]: 103: Hoare triple {47784#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-08 15:14:11,628 INFO L290 TraceCheckUtils]: 104: Hoare triple {47784#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-08 15:14:11,628 INFO L290 TraceCheckUtils]: 105: Hoare triple {47784#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-08 15:14:11,628 INFO L290 TraceCheckUtils]: 106: Hoare triple {47784#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-08 15:14:11,628 INFO L290 TraceCheckUtils]: 107: Hoare triple {47784#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-08 15:14:11,628 INFO L290 TraceCheckUtils]: 108: Hoare triple {47784#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-08 15:14:11,628 INFO L290 TraceCheckUtils]: 109: Hoare triple {47784#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-08 15:14:11,628 INFO L290 TraceCheckUtils]: 110: Hoare triple {47784#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-08 15:14:11,628 INFO L290 TraceCheckUtils]: 111: Hoare triple {47784#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-08 15:14:11,628 INFO L290 TraceCheckUtils]: 112: Hoare triple {47784#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-08 15:14:11,628 INFO L290 TraceCheckUtils]: 113: Hoare triple {47784#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-08 15:14:11,628 INFO L290 TraceCheckUtils]: 114: Hoare triple {47784#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-08 15:14:11,628 INFO L290 TraceCheckUtils]: 115: Hoare triple {47784#false} assume 4432 == #t~mem56;havoc #t~mem56; {47784#false} is VALID [2022-04-08 15:14:11,628 INFO L290 TraceCheckUtils]: 116: Hoare triple {47784#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {47784#false} is VALID [2022-04-08 15:14:11,629 INFO L290 TraceCheckUtils]: 117: Hoare triple {47784#false} assume 5 == ~blastFlag~0; {47784#false} is VALID [2022-04-08 15:14:11,629 INFO L290 TraceCheckUtils]: 118: Hoare triple {47784#false} assume !false; {47784#false} is VALID [2022-04-08 15:14:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 15:14:11,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:11,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369286701] [2022-04-08 15:14:11,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369286701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:11,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:11,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:14:11,632 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:11,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [52887339] [2022-04-08 15:14:11,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [52887339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:11,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:11,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:14:11,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120478194] [2022-04-08 15:14:11,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:11,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 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 119 [2022-04-08 15:14:11,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:11,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 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-08 15:14:11,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:11,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:14:11,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:11,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:14:11,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:14:11,709 INFO L87 Difference]: Start difference. First operand 818 states and 1246 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 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-08 15:14:13,736 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:14:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:14,757 INFO L93 Difference]: Finished difference Result 1414 states and 2152 transitions. [2022-04-08 15:14:14,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:14:14,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 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 119 [2022-04-08 15:14:14,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:14,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 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-08 15:14:14,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-08 15:14:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 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-08 15:14:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-08 15:14:14,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 492 transitions. [2022-04-08 15:14:15,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 492 edges. 492 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:15,127 INFO L225 Difference]: With dead ends: 1414 [2022-04-08 15:14:15,127 INFO L226 Difference]: Without dead ends: 792 [2022-04-08 15:14:15,128 INFO L912 BasicCegarLoop]: 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-08 15:14:15,129 INFO L913 BasicCegarLoop]: 317 mSDtfsCounter, 130 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:15,129 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 481 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 340 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:14:15,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2022-04-08 15:14:15,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2022-04-08 15:14:15,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:15,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 792 states. Second operand has 792 states, 787 states have (on average 1.5158831003811943) internal successors, (1193), 787 states have internal predecessors, (1193), 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-08 15:14:15,170 INFO L74 IsIncluded]: Start isIncluded. First operand 792 states. Second operand has 792 states, 787 states have (on average 1.5158831003811943) internal successors, (1193), 787 states have internal predecessors, (1193), 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-08 15:14:15,171 INFO L87 Difference]: Start difference. First operand 792 states. Second operand has 792 states, 787 states have (on average 1.5158831003811943) internal successors, (1193), 787 states have internal predecessors, (1193), 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-08 15:14:15,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:15,200 INFO L93 Difference]: Finished difference Result 792 states and 1197 transitions. [2022-04-08 15:14:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1197 transitions. [2022-04-08 15:14:15,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:15,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:15,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 792 states, 787 states have (on average 1.5158831003811943) internal successors, (1193), 787 states have internal predecessors, (1193), 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 792 states. [2022-04-08 15:14:15,202 INFO L87 Difference]: Start difference. First operand has 792 states, 787 states have (on average 1.5158831003811943) internal successors, (1193), 787 states have internal predecessors, (1193), 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 792 states. [2022-04-08 15:14:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:15,229 INFO L93 Difference]: Finished difference Result 792 states and 1197 transitions. [2022-04-08 15:14:15,229 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1197 transitions. [2022-04-08 15:14:15,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:15,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:15,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:15,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 787 states have (on average 1.5158831003811943) internal successors, (1193), 787 states have internal predecessors, (1193), 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-08 15:14:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1197 transitions. [2022-04-08 15:14:15,258 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1197 transitions. Word has length 119 [2022-04-08 15:14:15,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:15,258 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 1197 transitions. [2022-04-08 15:14:15,258 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 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-08 15:14:15,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 792 states and 1197 transitions. [2022-04-08 15:14:16,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1197 edges. 1197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:16,249 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1197 transitions. [2022-04-08 15:14:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-08 15:14:16,251 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:16,251 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2022-04-08 15:14:16,251 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 15:14:16,251 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:16,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:16,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1107867599, now seen corresponding path program 1 times [2022-04-08 15:14:16,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:16,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1974009653] [2022-04-08 15:14:16,252 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:16,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1107867599, now seen corresponding path program 2 times [2022-04-08 15:14:16,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:16,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925741858] [2022-04-08 15:14:16,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:16,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:16,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:16,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {53795#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {53788#true} is VALID [2022-04-08 15:14:16,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {53788#true} assume true; {53788#true} is VALID [2022-04-08 15:14:16,454 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53788#true} {53788#true} #591#return; {53788#true} is VALID [2022-04-08 15:14:16,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {53788#true} call ULTIMATE.init(); {53795#(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-08 15:14:16,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {53795#(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(196, 4);#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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {53788#true} is VALID [2022-04-08 15:14:16,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {53788#true} assume true; {53788#true} is VALID [2022-04-08 15:14:16,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53788#true} {53788#true} #591#return; {53788#true} is VALID [2022-04-08 15:14:16,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {53788#true} call #t~ret159 := main(); {53788#true} is VALID [2022-04-08 15:14:16,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {53788#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {53788#true} is VALID [2022-04-08 15:14:16,456 INFO L272 TraceCheckUtils]: 6: Hoare triple {53788#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {53788#true} is VALID [2022-04-08 15:14:16,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {53788#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {53788#true} is VALID [2022-04-08 15:14:16,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {53788#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {53788#true} is VALID [2022-04-08 15:14:16,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {53788#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {53788#true} is VALID [2022-04-08 15:14:16,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {53788#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {53788#true} is VALID [2022-04-08 15:14:16,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {53788#true} assume !false; {53788#true} is VALID [2022-04-08 15:14:16,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {53788#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {53788#true} assume 12292 == #t~mem43;havoc #t~mem43; {53788#true} is VALID [2022-04-08 15:14:16,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {53788#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {53788#true} is VALID [2022-04-08 15:14:16,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {53788#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {53788#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {53788#true} is VALID [2022-04-08 15:14:16,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {53788#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {53788#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {53788#true} is VALID [2022-04-08 15:14:16,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {53788#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {53788#true} is VALID [2022-04-08 15:14:16,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {53788#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {53788#true} is VALID [2022-04-08 15:14:16,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {53788#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {53788#true} is VALID [2022-04-08 15:14:16,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {53788#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {53788#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {53788#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {53788#true} is VALID [2022-04-08 15:14:16,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {53788#true} ~skip~0 := 0; {53788#true} is VALID [2022-04-08 15:14:16,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {53788#true} assume !false; {53788#true} is VALID [2022-04-08 15:14:16,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {53788#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {53788#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {53788#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,458 INFO L290 TraceCheckUtils]: 30: Hoare triple {53788#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {53788#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,458 INFO L290 TraceCheckUtils]: 32: Hoare triple {53788#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,458 INFO L290 TraceCheckUtils]: 33: Hoare triple {53788#true} assume 4368 == #t~mem48;havoc #t~mem48; {53788#true} is VALID [2022-04-08 15:14:16,458 INFO L290 TraceCheckUtils]: 34: Hoare triple {53788#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {53788#true} is VALID [2022-04-08 15:14:16,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {53788#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {53788#true} is VALID [2022-04-08 15:14:16,458 INFO L290 TraceCheckUtils]: 36: Hoare triple {53788#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {53788#true} is VALID [2022-04-08 15:14:16,458 INFO L290 TraceCheckUtils]: 37: Hoare triple {53788#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {53788#true} is VALID [2022-04-08 15:14:16,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {53788#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {53788#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {53788#true} is VALID [2022-04-08 15:14:16,459 INFO L290 TraceCheckUtils]: 40: Hoare triple {53788#true} ~skip~0 := 0; {53788#true} is VALID [2022-04-08 15:14:16,459 INFO L290 TraceCheckUtils]: 41: Hoare triple {53788#true} assume !false; {53788#true} is VALID [2022-04-08 15:14:16,459 INFO L290 TraceCheckUtils]: 42: Hoare triple {53788#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,459 INFO L290 TraceCheckUtils]: 43: Hoare triple {53788#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,459 INFO L290 TraceCheckUtils]: 44: Hoare triple {53788#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,459 INFO L290 TraceCheckUtils]: 45: Hoare triple {53788#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,459 INFO L290 TraceCheckUtils]: 46: Hoare triple {53788#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,459 INFO L290 TraceCheckUtils]: 47: Hoare triple {53788#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,459 INFO L290 TraceCheckUtils]: 48: Hoare triple {53788#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {53788#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,459 INFO L290 TraceCheckUtils]: 50: Hoare triple {53788#true} assume 4384 == #t~mem50;havoc #t~mem50; {53788#true} is VALID [2022-04-08 15:14:16,459 INFO L290 TraceCheckUtils]: 51: Hoare triple {53788#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {53788#true} is VALID [2022-04-08 15:14:16,459 INFO L290 TraceCheckUtils]: 52: Hoare triple {53788#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {53788#true} is VALID [2022-04-08 15:14:16,460 INFO L290 TraceCheckUtils]: 53: Hoare triple {53788#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {53788#true} is VALID [2022-04-08 15:14:16,460 INFO L290 TraceCheckUtils]: 54: Hoare triple {53788#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-08 15:14:16,461 INFO L290 TraceCheckUtils]: 55: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-08 15:14:16,462 INFO L290 TraceCheckUtils]: 56: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-08 15:14:16,462 INFO L290 TraceCheckUtils]: 57: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-08 15:14:16,462 INFO L290 TraceCheckUtils]: 58: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} ~skip~0 := 0; {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-08 15:14:16,462 INFO L290 TraceCheckUtils]: 59: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !false; {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-08 15:14:16,463 INFO L290 TraceCheckUtils]: 60: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-08 15:14:16,463 INFO L290 TraceCheckUtils]: 61: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-08 15:14:16,463 INFO L290 TraceCheckUtils]: 62: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-08 15:14:16,464 INFO L290 TraceCheckUtils]: 63: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-08 15:14:16,464 INFO L290 TraceCheckUtils]: 64: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-08 15:14:16,464 INFO L290 TraceCheckUtils]: 65: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-08 15:14:16,465 INFO L290 TraceCheckUtils]: 66: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-08 15:14:16,465 INFO L290 TraceCheckUtils]: 67: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-08 15:14:16,465 INFO L290 TraceCheckUtils]: 68: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-08 15:14:16,466 INFO L290 TraceCheckUtils]: 69: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {53794#(= |ssl3_connect_#t~mem52| 4560)} is VALID [2022-04-08 15:14:16,466 INFO L290 TraceCheckUtils]: 70: Hoare triple {53794#(= |ssl3_connect_#t~mem52| 4560)} assume 4400 == #t~mem52;havoc #t~mem52; {53789#false} is VALID [2022-04-08 15:14:16,466 INFO L290 TraceCheckUtils]: 71: Hoare triple {53789#false} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {53789#false} is VALID [2022-04-08 15:14:16,466 INFO L290 TraceCheckUtils]: 72: Hoare triple {53789#false} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {53789#false} is VALID [2022-04-08 15:14:16,466 INFO L290 TraceCheckUtils]: 73: Hoare triple {53789#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {53789#false} is VALID [2022-04-08 15:14:16,466 INFO L290 TraceCheckUtils]: 74: Hoare triple {53789#false} assume !(~ret~0 <= 0); {53789#false} is VALID [2022-04-08 15:14:16,466 INFO L290 TraceCheckUtils]: 75: Hoare triple {53789#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,467 INFO L290 TraceCheckUtils]: 76: Hoare triple {53789#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,467 INFO L290 TraceCheckUtils]: 77: Hoare triple {53789#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {53789#false} is VALID [2022-04-08 15:14:16,467 INFO L290 TraceCheckUtils]: 78: Hoare triple {53789#false} ~skip~0 := 0; {53789#false} is VALID [2022-04-08 15:14:16,467 INFO L290 TraceCheckUtils]: 79: Hoare triple {53789#false} assume !false; {53789#false} is VALID [2022-04-08 15:14:16,467 INFO L290 TraceCheckUtils]: 80: Hoare triple {53789#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,467 INFO L290 TraceCheckUtils]: 81: Hoare triple {53789#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,467 INFO L290 TraceCheckUtils]: 82: Hoare triple {53789#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,467 INFO L290 TraceCheckUtils]: 83: Hoare triple {53789#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,467 INFO L290 TraceCheckUtils]: 84: Hoare triple {53789#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,467 INFO L290 TraceCheckUtils]: 85: Hoare triple {53789#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,467 INFO L290 TraceCheckUtils]: 86: Hoare triple {53789#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,467 INFO L290 TraceCheckUtils]: 87: Hoare triple {53789#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,468 INFO L290 TraceCheckUtils]: 88: Hoare triple {53789#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,468 INFO L290 TraceCheckUtils]: 89: Hoare triple {53789#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,468 INFO L290 TraceCheckUtils]: 90: Hoare triple {53789#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,468 INFO L290 TraceCheckUtils]: 91: Hoare triple {53789#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,468 INFO L290 TraceCheckUtils]: 92: Hoare triple {53789#false} assume 4416 == #t~mem54;havoc #t~mem54; {53789#false} is VALID [2022-04-08 15:14:16,468 INFO L290 TraceCheckUtils]: 93: Hoare triple {53789#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {53789#false} is VALID [2022-04-08 15:14:16,468 INFO L290 TraceCheckUtils]: 94: Hoare triple {53789#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {53789#false} is VALID [2022-04-08 15:14:16,468 INFO L290 TraceCheckUtils]: 95: Hoare triple {53789#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {53789#false} is VALID [2022-04-08 15:14:16,468 INFO L290 TraceCheckUtils]: 96: Hoare triple {53789#false} assume !(0 == ~tmp___6~0); {53789#false} is VALID [2022-04-08 15:14:16,468 INFO L290 TraceCheckUtils]: 97: Hoare triple {53789#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,468 INFO L290 TraceCheckUtils]: 98: Hoare triple {53789#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {53789#false} is VALID [2022-04-08 15:14:16,468 INFO L290 TraceCheckUtils]: 99: Hoare triple {53789#false} ~skip~0 := 0; {53789#false} is VALID [2022-04-08 15:14:16,469 INFO L290 TraceCheckUtils]: 100: Hoare triple {53789#false} assume !false; {53789#false} is VALID [2022-04-08 15:14:16,469 INFO L290 TraceCheckUtils]: 101: Hoare triple {53789#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,469 INFO L290 TraceCheckUtils]: 102: Hoare triple {53789#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,469 INFO L290 TraceCheckUtils]: 103: Hoare triple {53789#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,469 INFO L290 TraceCheckUtils]: 104: Hoare triple {53789#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,469 INFO L290 TraceCheckUtils]: 105: Hoare triple {53789#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,469 INFO L290 TraceCheckUtils]: 106: Hoare triple {53789#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,469 INFO L290 TraceCheckUtils]: 107: Hoare triple {53789#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,469 INFO L290 TraceCheckUtils]: 108: Hoare triple {53789#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,469 INFO L290 TraceCheckUtils]: 109: Hoare triple {53789#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,469 INFO L290 TraceCheckUtils]: 110: Hoare triple {53789#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,469 INFO L290 TraceCheckUtils]: 111: Hoare triple {53789#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,469 INFO L290 TraceCheckUtils]: 112: Hoare triple {53789#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,470 INFO L290 TraceCheckUtils]: 113: Hoare triple {53789#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,470 INFO L290 TraceCheckUtils]: 114: Hoare triple {53789#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,470 INFO L290 TraceCheckUtils]: 115: Hoare triple {53789#false} assume 4432 == #t~mem56;havoc #t~mem56; {53789#false} is VALID [2022-04-08 15:14:16,470 INFO L290 TraceCheckUtils]: 116: Hoare triple {53789#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {53789#false} is VALID [2022-04-08 15:14:16,470 INFO L290 TraceCheckUtils]: 117: Hoare triple {53789#false} assume !(5 == ~blastFlag~0); {53789#false} is VALID [2022-04-08 15:14:16,470 INFO L290 TraceCheckUtils]: 118: Hoare triple {53789#false} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,470 INFO L290 TraceCheckUtils]: 119: Hoare triple {53789#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,470 INFO L290 TraceCheckUtils]: 120: Hoare triple {53789#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {53789#false} is VALID [2022-04-08 15:14:16,470 INFO L290 TraceCheckUtils]: 121: Hoare triple {53789#false} ~skip~0 := 0; {53789#false} is VALID [2022-04-08 15:14:16,470 INFO L290 TraceCheckUtils]: 122: Hoare triple {53789#false} assume !false; {53789#false} is VALID [2022-04-08 15:14:16,470 INFO L290 TraceCheckUtils]: 123: Hoare triple {53789#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,471 INFO L290 TraceCheckUtils]: 124: Hoare triple {53789#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,471 INFO L290 TraceCheckUtils]: 125: Hoare triple {53789#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,471 INFO L290 TraceCheckUtils]: 126: Hoare triple {53789#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,471 INFO L290 TraceCheckUtils]: 127: Hoare triple {53789#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,471 INFO L290 TraceCheckUtils]: 128: Hoare triple {53789#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,471 INFO L290 TraceCheckUtils]: 129: Hoare triple {53789#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,471 INFO L290 TraceCheckUtils]: 130: Hoare triple {53789#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,471 INFO L290 TraceCheckUtils]: 131: Hoare triple {53789#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,471 INFO L290 TraceCheckUtils]: 132: Hoare triple {53789#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,471 INFO L290 TraceCheckUtils]: 133: Hoare triple {53789#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,471 INFO L290 TraceCheckUtils]: 134: Hoare triple {53789#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,471 INFO L290 TraceCheckUtils]: 135: Hoare triple {53789#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,471 INFO L290 TraceCheckUtils]: 136: Hoare triple {53789#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,472 INFO L290 TraceCheckUtils]: 137: Hoare triple {53789#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,472 INFO L290 TraceCheckUtils]: 138: Hoare triple {53789#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-08 15:14:16,472 INFO L290 TraceCheckUtils]: 139: Hoare triple {53789#false} assume 4448 == #t~mem58;havoc #t~mem58; {53789#false} is VALID [2022-04-08 15:14:16,472 INFO L290 TraceCheckUtils]: 140: Hoare triple {53789#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {53789#false} is VALID [2022-04-08 15:14:16,472 INFO L290 TraceCheckUtils]: 141: Hoare triple {53789#false} assume 4 == ~blastFlag~0; {53789#false} is VALID [2022-04-08 15:14:16,472 INFO L290 TraceCheckUtils]: 142: Hoare triple {53789#false} assume !false; {53789#false} is VALID [2022-04-08 15:14:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-08 15:14:16,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:16,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925741858] [2022-04-08 15:14:16,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925741858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:16,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:16,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:16,473 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:16,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1974009653] [2022-04-08 15:14:16,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1974009653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:16,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:16,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:16,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743430418] [2022-04-08 15:14:16,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:16,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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 143 [2022-04-08 15:14:16,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:16,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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-08 15:14:16,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:16,550 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:16,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:16,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:16,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:16,551 INFO L87 Difference]: Start difference. First operand 792 states and 1197 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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-08 15:14:18,577 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-08 15:14:20,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:20,095 INFO L93 Difference]: Finished difference Result 1910 states and 2864 transitions. [2022-04-08 15:14:20,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:20,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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 143 [2022-04-08 15:14:20,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:20,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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-08 15:14:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-08 15:14:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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-08 15:14:20,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-08 15:14:20,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-08 15:14:20,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 461 edges. 461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:20,471 INFO L225 Difference]: With dead ends: 1910 [2022-04-08 15:14:20,471 INFO L226 Difference]: Without dead ends: 1134 [2022-04-08 15:14:20,473 INFO L912 BasicCegarLoop]: 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-08 15:14:20,473 INFO L913 BasicCegarLoop]: 233 mSDtfsCounter, 87 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:20,473 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 557 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 525 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:14:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2022-04-08 15:14:20,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 876. [2022-04-08 15:14:20,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:20,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1134 states. Second operand has 876 states, 871 states have (on average 1.521239954075775) internal successors, (1325), 871 states have internal predecessors, (1325), 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-08 15:14:20,527 INFO L74 IsIncluded]: Start isIncluded. First operand 1134 states. Second operand has 876 states, 871 states have (on average 1.521239954075775) internal successors, (1325), 871 states have internal predecessors, (1325), 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-08 15:14:20,528 INFO L87 Difference]: Start difference. First operand 1134 states. Second operand has 876 states, 871 states have (on average 1.521239954075775) internal successors, (1325), 871 states have internal predecessors, (1325), 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-08 15:14:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:20,584 INFO L93 Difference]: Finished difference Result 1134 states and 1683 transitions. [2022-04-08 15:14:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1683 transitions. [2022-04-08 15:14:20,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:20,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:20,588 INFO L74 IsIncluded]: Start isIncluded. First operand has 876 states, 871 states have (on average 1.521239954075775) internal successors, (1325), 871 states have internal predecessors, (1325), 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 1134 states. [2022-04-08 15:14:20,589 INFO L87 Difference]: Start difference. First operand has 876 states, 871 states have (on average 1.521239954075775) internal successors, (1325), 871 states have internal predecessors, (1325), 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 1134 states. [2022-04-08 15:14:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:20,645 INFO L93 Difference]: Finished difference Result 1134 states and 1683 transitions. [2022-04-08 15:14:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1683 transitions. [2022-04-08 15:14:20,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:20,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:20,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:20,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 871 states have (on average 1.521239954075775) internal successors, (1325), 871 states have internal predecessors, (1325), 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-08 15:14:20,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1329 transitions. [2022-04-08 15:14:20,691 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1329 transitions. Word has length 143 [2022-04-08 15:14:20,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:20,691 INFO L478 AbstractCegarLoop]: Abstraction has 876 states and 1329 transitions. [2022-04-08 15:14:20,692 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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-08 15:14:20,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 876 states and 1329 transitions. [2022-04-08 15:14:21,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1329 edges. 1329 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1329 transitions. [2022-04-08 15:14:21,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-08 15:14:21,820 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:21,820 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2022-04-08 15:14:21,820 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 15:14:21,820 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:21,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:21,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1878601165, now seen corresponding path program 1 times [2022-04-08 15:14:21,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:21,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1845223974] [2022-04-08 15:14:21,821 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:21,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1878601165, now seen corresponding path program 2 times [2022-04-08 15:14:21,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:21,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181897020] [2022-04-08 15:14:21,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:21,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 15:14:23,854 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 15:14:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 15:14:24,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 15:14:24,425 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 15:14:24,425 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 15:14:24,431 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 15:14:24,433 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 15:14:24,435 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 15:14:24,438 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 15:14:24,489 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 15:14:24,489 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 15:14:24,489 WARN L170 areAnnotationChecker]: ssl3_get_client_methodENTRY has no Hoare annotation [2022-04-08 15:14:24,489 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 15:14:24,489 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 15:14:24,489 WARN L170 areAnnotationChecker]: ssl3_connectENTRY has no Hoare annotation [2022-04-08 15:14:24,489 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 15:14:24,489 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: SSLv3_client_methodENTRY has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: L1133 has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: L1133 has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: L1678 has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: L1678 has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-08 15:14:24,490 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: ssl3_get_client_methodFINAL has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: L1136-2 has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: L1136 has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: L1136 has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: L1098-1 has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: L1678-1 has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: L1064-1 has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: SSLv3_client_methodFINAL has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: L1144 has no Hoare annotation [2022-04-08 15:14:24,491 WARN L170 areAnnotationChecker]: L1144 has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: L1153-1 has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: L1153-1 has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: L1153-1 has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: SSLv3_client_methodEXIT has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: L1658 has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: L1154 has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: L1066-1 has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: L1662 has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: L1662 has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: L1156 has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: L1156 has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: L1662-2 has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: L1157 has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: L1159 has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: L1159 has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: ssl3_connectFINAL has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: L1262 has no Hoare annotation [2022-04-08 15:14:24,492 WARN L170 areAnnotationChecker]: L1162 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1162 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: ssl3_connectEXIT has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1267 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1267 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1165 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1165 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1267-2 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1279 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1279 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1175 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1174 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1174 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1281 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1281 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1279-2 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1313 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1313 has no Hoare annotation [2022-04-08 15:14:24,493 WARN L170 areAnnotationChecker]: L1177 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1177 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1292 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1292 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1313-2 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1313-2 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1181 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1180 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1180 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1299 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1299 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1325 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1325 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1183 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1183 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1591 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1334-2 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1334-2 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1187 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1186 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1186 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1627 has no Hoare annotation [2022-04-08 15:14:24,494 WARN L170 areAnnotationChecker]: L1627 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1344 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1344 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1353 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1353 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1627-1 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1344-2 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1353-2 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1357 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1357 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1193 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1357-2 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1357-2 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1374 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1374 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1195 has no Hoare annotation [2022-04-08 15:14:24,495 WARN L170 areAnnotationChecker]: L1195 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1631 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1631 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1629-2 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1629-2 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1374-2 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1374-2 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1199 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1198 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1198 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1397 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1397 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1414 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1414 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1402 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1402 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1205 has no Hoare annotation [2022-04-08 15:14:24,496 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1217 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1210 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1210 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1435 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1435 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1423-2 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1216 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1216 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1223 has no Hoare annotation [2022-04-08 15:14:24,497 WARN L170 areAnnotationChecker]: L1222 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1222 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1446 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1446 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1452 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1452 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1229 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1228 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1228 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1452-2 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1463 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1463 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1235 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1475 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1475 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1237 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1237 has no Hoare annotation [2022-04-08 15:14:24,498 WARN L170 areAnnotationChecker]: L1483 has no Hoare annotation [2022-04-08 15:14:24,499 WARN L170 areAnnotationChecker]: L1483 has no Hoare annotation [2022-04-08 15:14:24,499 WARN L170 areAnnotationChecker]: L1241 has no Hoare annotation [2022-04-08 15:14:24,499 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-08 15:14:24,499 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-08 15:14:24,499 WARN L170 areAnnotationChecker]: L1483-2 has no Hoare annotation [2022-04-08 15:14:24,499 WARN L170 areAnnotationChecker]: L1506 has no Hoare annotation [2022-04-08 15:14:24,499 WARN L170 areAnnotationChecker]: L1506 has no Hoare annotation [2022-04-08 15:14:24,499 WARN L170 areAnnotationChecker]: L1243 has no Hoare annotation [2022-04-08 15:14:24,499 WARN L170 areAnnotationChecker]: L1243 has no Hoare annotation [2022-04-08 15:14:24,499 WARN L170 areAnnotationChecker]: L1489 has no Hoare annotation [2022-04-08 15:14:24,499 WARN L170 areAnnotationChecker]: L1489 has no Hoare annotation [2022-04-08 15:14:24,499 WARN L170 areAnnotationChecker]: L1513 has no Hoare annotation [2022-04-08 15:14:24,499 WARN L170 areAnnotationChecker]: L1513 has no Hoare annotation [2022-04-08 15:14:24,499 WARN L170 areAnnotationChecker]: L1247 has no Hoare annotation [2022-04-08 15:14:24,499 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-08 15:14:24,499 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-08 15:14:24,499 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1515 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1515 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1513-1 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1530 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1530 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1535 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1535 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1250 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1535-2 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1544 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1544 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1253 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1256 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1548 has no Hoare annotation [2022-04-08 15:14:24,500 WARN L170 areAnnotationChecker]: L1548 has no Hoare annotation [2022-04-08 15:14:24,501 WARN L170 areAnnotationChecker]: L1544-2 has no Hoare annotation [2022-04-08 15:14:24,501 WARN L170 areAnnotationChecker]: L1561 has no Hoare annotation [2022-04-08 15:14:24,502 WARN L170 areAnnotationChecker]: L1561 has no Hoare annotation [2022-04-08 15:14:24,502 WARN L170 areAnnotationChecker]: L1561-2 has no Hoare annotation [2022-04-08 15:14:24,502 WARN L170 areAnnotationChecker]: L1566 has no Hoare annotation [2022-04-08 15:14:24,502 WARN L170 areAnnotationChecker]: L1566 has no Hoare annotation [2022-04-08 15:14:24,502 WARN L170 areAnnotationChecker]: L1566-2 has no Hoare annotation [2022-04-08 15:14:24,502 WARN L170 areAnnotationChecker]: L1573 has no Hoare annotation [2022-04-08 15:14:24,502 WARN L170 areAnnotationChecker]: L1573 has no Hoare annotation [2022-04-08 15:14:24,502 WARN L170 areAnnotationChecker]: L1573-2 has no Hoare annotation [2022-04-08 15:14:24,502 WARN L170 areAnnotationChecker]: L1581 has no Hoare annotation [2022-04-08 15:14:24,502 WARN L170 areAnnotationChecker]: L1581 has no Hoare annotation [2022-04-08 15:14:24,502 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-08 15:14:24,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 03:14:24 BoogieIcfgContainer [2022-04-08 15:14:24,505 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 15:14:24,506 INFO L158 Benchmark]: Toolchain (without parser) took 246677.16ms. Allocated memory was 186.6MB in the beginning and 332.4MB in the end (delta: 145.8MB). Free memory was 137.3MB in the beginning and 179.3MB in the end (delta: -42.0MB). Peak memory consumption was 184.3MB. Max. memory is 8.0GB. [2022-04-08 15:14:24,506 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 186.6MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 15:14:24,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 650.66ms. Allocated memory is still 186.6MB. Free memory was 137.2MB in the beginning and 143.2MB in the end (delta: -6.0MB). Peak memory consumption was 14.8MB. Max. memory is 8.0GB. [2022-04-08 15:14:24,507 INFO L158 Benchmark]: Boogie Preprocessor took 120.10ms. Allocated memory is still 186.6MB. Free memory was 143.2MB in the beginning and 133.9MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 15:14:24,507 INFO L158 Benchmark]: RCFGBuilder took 2327.99ms. Allocated memory is still 186.6MB. Free memory was 133.9MB in the beginning and 94.6MB in the end (delta: 39.2MB). Peak memory consumption was 39.7MB. Max. memory is 8.0GB. [2022-04-08 15:14:24,507 INFO L158 Benchmark]: TraceAbstraction took 243569.55ms. Allocated memory was 186.6MB in the beginning and 332.4MB in the end (delta: 145.8MB). Free memory was 94.1MB in the beginning and 179.3MB in the end (delta: -85.2MB). Peak memory consumption was 140.3MB. Max. memory is 8.0GB. [2022-04-08 15:14:24,507 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.25ms. Allocated memory is still 186.6MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 650.66ms. Allocated memory is still 186.6MB. Free memory was 137.2MB in the beginning and 143.2MB in the end (delta: -6.0MB). Peak memory consumption was 14.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 120.10ms. Allocated memory is still 186.6MB. Free memory was 143.2MB in the beginning and 133.9MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2327.99ms. Allocated memory is still 186.6MB. Free memory was 133.9MB in the beginning and 94.6MB in the end (delta: 39.2MB). Peak memory consumption was 39.7MB. Max. memory is 8.0GB. * TraceAbstraction took 243569.55ms. Allocated memory was 186.6MB in the beginning and 332.4MB in the end (delta: 145.8MB). Free memory was 94.1MB in the beginning and 179.3MB in the end (delta: -85.2MB). Peak memory consumption was 140.3MB. Max. memory is 8.0GB. * 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: 1668]: 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 1353. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; [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) [L1104] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [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 ; [L1116] int tmp___4 ; [L1117] int tmp___5 ; [L1118] int tmp___6 ; [L1119] int tmp___7 ; [L1120] int tmp___8 ; [L1121] long tmp___9 ; [L1123] int blastFlag ; [L1126] blastFlag = 0 [L1127] s->hit=__VERIFIER_nondet_int () [L1128] s->state = 12292 [L1129] tmp = __VERIFIER_nondet_int() [L1130] cb = (void (*)())((void *)0) [L1131] ret = -1 [L1132] skip = 0 [L1133] EXPR s->info_callback [L1133] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1134] EXPR s->info_callback [L1134] cb = s->info_callback [L1142] EXPR s->in_handshake [L1142] s->in_handshake += 1 [L1143] COND FALSE !(tmp___1 & 12288) [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND TRUE s->state == 12292 [L1259] s->new_session = 1 [L1260] s->state = 4096 [L1261] EXPR s->ctx [L1261] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1261] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1266] s->server = 0 [L1267] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) [L1272] EXPR s->version [L1272] COND FALSE !((s->version & 65280) != 768) [L1278] s->type = 4096 [L1279] EXPR s->init_buf [L1279] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1291] tmp___4 = __VERIFIER_nondet_int() [L1292] COND FALSE !(! tmp___4) [L1298] tmp___5 = __VERIFIER_nondet_int() [L1299] COND FALSE !(! tmp___5) [L1305] s->state = 4368 [L1306] EXPR s->ctx [L1306] EXPR (s->ctx)->stats.sess_connect [L1306] (s->ctx)->stats.sess_connect += 1 [L1307] s->init_num = 0 [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state [L1171] COND TRUE s->state == 4368 [L1311] s->shutdown = 0 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 0 [L1314] blastFlag = 1 [L1318] COND FALSE !(ret <= 0) [L1323] s->state = 4384 [L1324] s->init_num = 0 [L1325] EXPR s->bbio [L1325] EXPR s->wbio [L1325] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state [L1177] COND TRUE s->state == 4384 [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 1 [L1335] blastFlag = 2 [L1339] COND FALSE !(ret <= 0) [L1344] s->hit [L1344] COND FALSE !(s->hit) [L1347] s->state = 4400 [L1349] s->init_num = 0 [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state [L1183] COND TRUE s->state == 4400 [L1353] EXPR s->s3 [L1353] EXPR (s->s3)->tmp.new_cipher [L1353] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1353] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 2 [L1358] blastFlag = 3 [L1362] COND FALSE !(ret <= 0) [L1368] s->state = 4416 [L1369] s->init_num = 0 [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state [L1189] COND TRUE s->state == 4416 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND TRUE blastFlag == 3 [L1375] blastFlag = 4 [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4432 [L1385] s->init_num = 0 [L1386] tmp___6 = __VERIFIER_nondet_int() [L1387] COND FALSE !(! tmp___6) [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state [L1195] COND TRUE s->state == 4432 [L1396] ret = __VERIFIER_nondet_int() [L1397] COND FALSE !(blastFlag == 5) [L1402] COND FALSE !(ret <= 0) [L1407] s->state = 4448 [L1408] s->init_num = 0 [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state [L1195] COND FALSE !(s->state == 4432) [L1198] EXPR s->state [L1198] COND FALSE !(s->state == 4433) [L1201] EXPR s->state [L1201] COND TRUE s->state == 4448 [L1412] ret = __VERIFIER_nondet_int() [L1413] COND TRUE blastFlag == 4 [L1668] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 171 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 243.5s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 59.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 17 mSolverCounterUnknown, 1443 SdHoareTripleChecker+Valid, 40.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1443 mSDsluCounter, 6933 SdHoareTripleChecker+Invalid, 40.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3760 mSDsCounter, 346 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6043 IncrementalHoareTripleChecker+Invalid, 6406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 346 mSolverCounterUnsat, 3173 mSDtfsCounter, 6043 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=876occurred in iteration=17, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 1057 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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-08 15:14:24,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...