/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_srvr.blast.02.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 15:13:25,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 15:13:25,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 15:13:25,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 15:13:25,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 15:13:25,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 15:13:25,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 15:13:25,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 15:13:25,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 15:13:25,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 15:13:25,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 15:13:25,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 15:13:25,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 15:13:25,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 15:13:25,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 15:13:25,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 15:13:25,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 15:13:25,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 15:13:25,083 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 15:13:25,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 15:13:25,085 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 15:13:25,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 15:13:25,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 15:13:25,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 15:13:25,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 15:13:25,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 15:13:25,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 15:13:25,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 15:13:25,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 15:13:25,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 15:13:25,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 15:13:25,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 15:13:25,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 15:13:25,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 15:13:25,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 15:13:25,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 15:13:25,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 15:13:25,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 15:13:25,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 15:13:25,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 15:13:25,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 15:13:25,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 15:13:25,114 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:13:25,125 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 15:13:25,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 15:13:25,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 15:13:25,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 15:13:25,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 15:13:25,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 15:13:25,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 15:13:25,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 15:13:25,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 15:13:25,128 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 15:13:25,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 15:13:25,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 15:13:25,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 15:13:25,128 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 15:13:25,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 15:13:25,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 15:13:25,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 15:13:25,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 15:13:25,129 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 15:13:25,129 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 15:13:25,129 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 15:13:25,129 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 15:13:25,129 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:13:25,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 15:13:25,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 15:13:25,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 15:13:25,374 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 15:13:25,375 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 15:13:25,376 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.02.i.cil-1.c [2022-04-08 15:13:25,435 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91cf8bba/c2c903a4fd6d46088773fe425cddd457/FLAGb0a607120 [2022-04-08 15:13:25,896 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 15:13:25,900 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.02.i.cil-1.c [2022-04-08 15:13:25,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91cf8bba/c2c903a4fd6d46088773fe425cddd457/FLAGb0a607120 [2022-04-08 15:13:25,946 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91cf8bba/c2c903a4fd6d46088773fe425cddd457 [2022-04-08 15:13:25,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 15:13:25,950 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 15:13:25,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 15:13:25,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 15:13:25,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 15:13:25,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:13:25" (1/1) ... [2022-04-08 15:13:25,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@563eb1dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:25, skipping insertion in model container [2022-04-08 15:13:25,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:13:25" (1/1) ... [2022-04-08 15:13:25,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 15:13:26,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 15:13:26,339 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_srvr.blast.02.i.cil-1.c[72502,72515] [2022-04-08 15:13:26,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 15:13:26,359 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 15:13:26,483 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_srvr.blast.02.i.cil-1.c[72502,72515] [2022-04-08 15:13:26,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 15:13:26,510 INFO L208 MainTranslator]: Completed translation [2022-04-08 15:13:26,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:26 WrapperNode [2022-04-08 15:13:26,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 15:13:26,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 15:13:26,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 15:13:26,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 15:13:26,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:26" (1/1) ... [2022-04-08 15:13:26,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:26" (1/1) ... [2022-04-08 15:13:26,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:26" (1/1) ... [2022-04-08 15:13:26,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:26" (1/1) ... [2022-04-08 15:13:26,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:26" (1/1) ... [2022-04-08 15:13:26,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:26" (1/1) ... [2022-04-08 15:13:26,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:26" (1/1) ... [2022-04-08 15:13:26,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 15:13:26,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 15:13:26,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 15:13:26,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 15:13:26,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:26" (1/1) ... [2022-04-08 15:13:26,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 15:13:26,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 15:13:26,716 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:13:26,728 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:13:26,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 15:13:26,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 15:13:26,758 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 15:13:26,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-08 15:13:26,759 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-08 15:13:26,759 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 15:13:26,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-08 15:13:26,759 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 15:13:26,759 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 15:13:26,760 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 15:13:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 15:13:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 15:13:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 15:13:26,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 15:13:26,761 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 15:13:26,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 15:13:26,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 15:13:26,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 15:13:26,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 15:13:26,764 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 15:13:26,764 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-08 15:13:26,764 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 15:13:26,764 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-08 15:13:26,765 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-08 15:13:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 15:13:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 15:13:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 15:13:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 15:13:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 15:13:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 15:13:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 15:13:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 15:13:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 15:13:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 15:13:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 15:13:26,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 15:13:26,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 15:13:26,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 15:13:26,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 15:13:26,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 15:13:26,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 15:13:26,943 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 15:13:26,945 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 15:13:28,541 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:13:29,071 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-08 15:13:29,072 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-08 15:13:29,085 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 15:13:29,096 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 15:13:29,096 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 15:13:29,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:13:29 BoogieIcfgContainer [2022-04-08 15:13:29,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 15:13:29,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 15:13:29,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 15:13:29,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 15:13:29,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:13:25" (1/3) ... [2022-04-08 15:13:29,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d54a1b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:13:29, skipping insertion in model container [2022-04-08 15:13:29,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:26" (2/3) ... [2022-04-08 15:13:29,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d54a1b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:13:29, skipping insertion in model container [2022-04-08 15:13:29,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:13:29" (3/3) ... [2022-04-08 15:13:29,111 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2022-04-08 15:13:29,120 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 15:13:29,121 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 15:13:29,163 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 15:13:29,179 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:13:29,179 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 15:13:29,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 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:13:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 15:13:29,215 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:29,215 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, 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:29,216 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:29,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:29,219 INFO L85 PathProgramCache]: Analyzing trace with hash -2027838722, now seen corresponding path program 1 times [2022-04-08 15:13:29,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:29,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1786683011] [2022-04-08 15:13:29,233 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:13:29,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2027838722, now seen corresponding path program 2 times [2022-04-08 15:13:29,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:29,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808504990] [2022-04-08 15:13:29,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:29,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:29,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:29,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {156#true} is VALID [2022-04-08 15:13:29,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-08 15:13:29,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #661#return; {156#true} is VALID [2022-04-08 15:13:29,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:13:29,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {156#true} is VALID [2022-04-08 15:13:29,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-08 15:13:29,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #661#return; {156#true} is VALID [2022-04-08 15:13:29,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret161 := main(); {156#true} is VALID [2022-04-08 15:13:29,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {156#true} is VALID [2022-04-08 15:13:29,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {156#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {156#true} is VALID [2022-04-08 15:13:29,742 INFO L272 TraceCheckUtils]: 7: Hoare triple {156#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {156#true} is VALID [2022-04-08 15:13:29,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {156#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:29,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:29,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:29,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:29,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:29,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:29,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:29,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:29,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:29,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:29,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:29,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:29,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:29,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:29,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:29,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {162#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-08 15:13:29,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {162#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {157#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {157#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {157#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {157#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {157#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {157#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {157#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,757 INFO L290 TraceCheckUtils]: 32: Hoare triple {157#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {157#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,758 INFO L290 TraceCheckUtils]: 34: Hoare triple {157#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {157#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,758 INFO L290 TraceCheckUtils]: 36: Hoare triple {157#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {157#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,759 INFO L290 TraceCheckUtils]: 38: Hoare triple {157#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,759 INFO L290 TraceCheckUtils]: 39: Hoare triple {157#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,759 INFO L290 TraceCheckUtils]: 40: Hoare triple {157#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,759 INFO L290 TraceCheckUtils]: 41: Hoare triple {157#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,759 INFO L290 TraceCheckUtils]: 42: Hoare triple {157#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,760 INFO L290 TraceCheckUtils]: 43: Hoare triple {157#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,760 INFO L290 TraceCheckUtils]: 44: Hoare triple {157#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,760 INFO L290 TraceCheckUtils]: 45: Hoare triple {157#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,760 INFO L290 TraceCheckUtils]: 46: Hoare triple {157#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,760 INFO L290 TraceCheckUtils]: 47: Hoare triple {157#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-08 15:13:29,761 INFO L290 TraceCheckUtils]: 48: Hoare triple {157#false} assume 8672 == #t~mem79;havoc #t~mem79; {157#false} is VALID [2022-04-08 15:13:29,761 INFO L290 TraceCheckUtils]: 49: Hoare triple {157#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {157#false} is VALID [2022-04-08 15:13:29,761 INFO L290 TraceCheckUtils]: 50: Hoare triple {157#false} assume 3 == ~blastFlag~0; {157#false} is VALID [2022-04-08 15:13:29,761 INFO L290 TraceCheckUtils]: 51: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-08 15:13:29,762 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:13:29,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:29,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808504990] [2022-04-08 15:13:29,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808504990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:29,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:29,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:29,766 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:29,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1786683011] [2022-04-08 15:13:29,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1786683011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:29,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:29,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:29,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762964387] [2022-04-08 15:13:29,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:29,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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 52 [2022-04-08 15:13:29,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:29,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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:29,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:29,839 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:29,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:29,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:29,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:29,862 INFO L87 Difference]: Start difference. First operand has 153 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 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 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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:31,907 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:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:33,438 INFO L93 Difference]: Finished difference Result 324 states and 540 transitions. [2022-04-08 15:13:33,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:33,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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 52 [2022-04-08 15:13:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-04-08 15:13:33,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-04-08 15:13:33,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 540 transitions. [2022-04-08 15:13:33,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 540 edges. 540 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:33,917 INFO L225 Difference]: With dead ends: 324 [2022-04-08 15:13:33,917 INFO L226 Difference]: Without dead ends: 165 [2022-04-08 15:13:33,919 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:13:33,922 INFO L913 BasicCegarLoop]: 219 mSDtfsCounter, 34 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:33,923 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 577 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 401 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:13:33,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-08 15:13:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2022-04-08 15:13:33,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:33,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 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:33,973 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 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:33,974 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 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:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:33,985 INFO L93 Difference]: Finished difference Result 165 states and 245 transitions. [2022-04-08 15:13:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2022-04-08 15:13:33,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:33,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:33,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 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 165 states. [2022-04-08 15:13:33,995 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 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 165 states. [2022-04-08 15:13:34,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:34,003 INFO L93 Difference]: Finished difference Result 165 states and 245 transitions. [2022-04-08 15:13:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2022-04-08 15:13:34,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:34,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:34,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:34,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 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:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 224 transitions. [2022-04-08 15:13:34,015 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 224 transitions. Word has length 52 [2022-04-08 15:13:34,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:34,016 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 224 transitions. [2022-04-08 15:13:34,016 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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:34,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 224 transitions. [2022-04-08 15:13:34,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 224 transitions. [2022-04-08 15:13:34,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 15:13:34,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:34,203 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 15:13:34,203 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:34,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:34,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1075038228, now seen corresponding path program 1 times [2022-04-08 15:13:34,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:34,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [554709369] [2022-04-08 15:13:34,226 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:13:34,226 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:34,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1075038228, now seen corresponding path program 2 times [2022-04-08 15:13:34,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:34,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468235732] [2022-04-08 15:13:34,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:34,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:34,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:34,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {1449#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1442#true} is VALID [2022-04-08 15:13:34,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-08 15:13:34,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1442#true} {1442#true} #661#return; {1442#true} is VALID [2022-04-08 15:13:34,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {1442#true} call ULTIMATE.init(); {1449#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:13:34,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {1449#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1442#true} is VALID [2022-04-08 15:13:34,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-08 15:13:34,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1442#true} {1442#true} #661#return; {1442#true} is VALID [2022-04-08 15:13:34,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {1442#true} call #t~ret161 := main(); {1442#true} is VALID [2022-04-08 15:13:34,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {1442#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1442#true} is VALID [2022-04-08 15:13:34,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {1442#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {1442#true} is VALID [2022-04-08 15:13:34,429 INFO L272 TraceCheckUtils]: 7: Hoare triple {1442#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1442#true} is VALID [2022-04-08 15:13:34,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {1442#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:34,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:34,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:34,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:34,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:34,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:34,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:34,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:34,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:34,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:34,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:34,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:34,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1448#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-08 15:13:34,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {1448#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {1443#false} is VALID [2022-04-08 15:13:34,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {1443#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {1443#false} is VALID [2022-04-08 15:13:34,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {1443#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {1443#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {1443#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {1443#false} is VALID [2022-04-08 15:13:34,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {1443#false} ~skip~0 := 0; {1443#false} is VALID [2022-04-08 15:13:34,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {1443#false} assume !false; {1443#false} is VALID [2022-04-08 15:13:34,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {1443#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {1443#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,442 INFO L290 TraceCheckUtils]: 30: Hoare triple {1443#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {1443#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {1443#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {1443#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {1443#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {1443#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {1443#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {1443#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {1443#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {1443#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,445 INFO L290 TraceCheckUtils]: 40: Hoare triple {1443#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,445 INFO L290 TraceCheckUtils]: 41: Hoare triple {1443#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,445 INFO L290 TraceCheckUtils]: 42: Hoare triple {1443#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,446 INFO L290 TraceCheckUtils]: 43: Hoare triple {1443#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,446 INFO L290 TraceCheckUtils]: 44: Hoare triple {1443#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {1443#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {1443#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,446 INFO L290 TraceCheckUtils]: 47: Hoare triple {1443#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,447 INFO L290 TraceCheckUtils]: 48: Hoare triple {1443#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,447 INFO L290 TraceCheckUtils]: 49: Hoare triple {1443#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,447 INFO L290 TraceCheckUtils]: 50: Hoare triple {1443#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,447 INFO L290 TraceCheckUtils]: 51: Hoare triple {1443#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,447 INFO L290 TraceCheckUtils]: 52: Hoare triple {1443#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,448 INFO L290 TraceCheckUtils]: 53: Hoare triple {1443#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,448 INFO L290 TraceCheckUtils]: 54: Hoare triple {1443#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,448 INFO L290 TraceCheckUtils]: 55: Hoare triple {1443#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,448 INFO L290 TraceCheckUtils]: 56: Hoare triple {1443#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,448 INFO L290 TraceCheckUtils]: 57: Hoare triple {1443#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,449 INFO L290 TraceCheckUtils]: 58: Hoare triple {1443#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,449 INFO L290 TraceCheckUtils]: 59: Hoare triple {1443#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,449 INFO L290 TraceCheckUtils]: 60: Hoare triple {1443#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-08 15:13:34,449 INFO L290 TraceCheckUtils]: 61: Hoare triple {1443#false} assume 8672 == #t~mem79;havoc #t~mem79; {1443#false} is VALID [2022-04-08 15:13:34,449 INFO L290 TraceCheckUtils]: 62: Hoare triple {1443#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {1443#false} is VALID [2022-04-08 15:13:34,450 INFO L290 TraceCheckUtils]: 63: Hoare triple {1443#false} assume 3 == ~blastFlag~0; {1443#false} is VALID [2022-04-08 15:13:34,450 INFO L290 TraceCheckUtils]: 64: Hoare triple {1443#false} assume !false; {1443#false} is VALID [2022-04-08 15:13:34,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:13:34,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:34,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468235732] [2022-04-08 15:13:34,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468235732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:34,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:34,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:34,452 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:34,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [554709369] [2022-04-08 15:13:34,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [554709369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:34,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:34,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:34,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749552176] [2022-04-08 15:13:34,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:34,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 15:13:34,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:34,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:34,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:34,505 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:34,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:34,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:34,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:34,506 INFO L87 Difference]: Start difference. First operand 148 states and 224 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:36,531 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:37,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:37,736 INFO L93 Difference]: Finished difference Result 287 states and 431 transitions. [2022-04-08 15:13:37,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:37,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 15:13:37,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 431 transitions. [2022-04-08 15:13:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 431 transitions. [2022-04-08 15:13:37,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 431 transitions. [2022-04-08 15:13:38,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 431 edges. 431 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:38,107 INFO L225 Difference]: With dead ends: 287 [2022-04-08 15:13:38,107 INFO L226 Difference]: Without dead ends: 165 [2022-04-08 15:13:38,108 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:13:38,109 INFO L913 BasicCegarLoop]: 177 mSDtfsCounter, 24 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:38,110 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 453 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:13:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-08 15:13:38,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2022-04-08 15:13:38,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:38,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5314685314685315) internal successors, (219), 143 states have internal predecessors, (219), 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:38,120 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5314685314685315) internal successors, (219), 143 states have internal predecessors, (219), 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:38,121 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5314685314685315) internal successors, (219), 143 states have internal predecessors, (219), 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:38,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:38,126 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2022-04-08 15:13:38,126 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-04-08 15:13:38,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:38,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:38,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5314685314685315) internal successors, (219), 143 states have internal predecessors, (219), 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 165 states. [2022-04-08 15:13:38,128 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5314685314685315) internal successors, (219), 143 states have internal predecessors, (219), 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 165 states. [2022-04-08 15:13:38,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:38,133 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2022-04-08 15:13:38,133 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-04-08 15:13:38,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:38,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:38,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:38,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5314685314685315) internal successors, (219), 143 states have internal predecessors, (219), 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:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 223 transitions. [2022-04-08 15:13:38,138 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 223 transitions. Word has length 65 [2022-04-08 15:13:38,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:38,139 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 223 transitions. [2022-04-08 15:13:38,139 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:38,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 223 transitions. [2022-04-08 15:13:38,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:38,314 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 223 transitions. [2022-04-08 15:13:38,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 15:13:38,315 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:38,315 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, 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:38,316 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 15:13:38,316 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:38,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:38,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1045469476, now seen corresponding path program 1 times [2022-04-08 15:13:38,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:38,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [552304745] [2022-04-08 15:13:38,343 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:13:38,344 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:38,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1045469476, now seen corresponding path program 2 times [2022-04-08 15:13:38,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:38,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392257020] [2022-04-08 15:13:38,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:38,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:38,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:38,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {2661#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2654#true} is VALID [2022-04-08 15:13:38,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {2654#true} assume true; {2654#true} is VALID [2022-04-08 15:13:38,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2654#true} {2654#true} #661#return; {2654#true} is VALID [2022-04-08 15:13:38,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {2654#true} call ULTIMATE.init(); {2661#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:13:38,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {2661#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2654#true} is VALID [2022-04-08 15:13:38,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {2654#true} assume true; {2654#true} is VALID [2022-04-08 15:13:38,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2654#true} {2654#true} #661#return; {2654#true} is VALID [2022-04-08 15:13:38,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {2654#true} call #t~ret161 := main(); {2654#true} is VALID [2022-04-08 15:13:38,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {2654#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {2654#true} is VALID [2022-04-08 15:13:38,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {2654#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {2654#true} is VALID [2022-04-08 15:13:38,564 INFO L272 TraceCheckUtils]: 7: Hoare triple {2654#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2654#true} is VALID [2022-04-08 15:13:38,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {2654#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:38,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:38,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:38,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:38,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:38,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:38,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:38,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {2660#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-08 15:13:38,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {2660#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {2655#false} is VALID [2022-04-08 15:13:38,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {2655#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {2655#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {2655#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {2655#false} is VALID [2022-04-08 15:13:38,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {2655#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {2655#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {2655#false} is VALID [2022-04-08 15:13:38,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {2655#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {2655#false} is VALID [2022-04-08 15:13:38,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {2655#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {2655#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {2655#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {2655#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {2655#false} is VALID [2022-04-08 15:13:38,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {2655#false} ~skip~0 := 0; {2655#false} is VALID [2022-04-08 15:13:38,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {2655#false} assume !false; {2655#false} is VALID [2022-04-08 15:13:38,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {2655#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {2655#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,574 INFO L290 TraceCheckUtils]: 31: Hoare triple {2655#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {2655#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {2655#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {2655#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,574 INFO L290 TraceCheckUtils]: 35: Hoare triple {2655#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,575 INFO L290 TraceCheckUtils]: 36: Hoare triple {2655#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,575 INFO L290 TraceCheckUtils]: 37: Hoare triple {2655#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,575 INFO L290 TraceCheckUtils]: 38: Hoare triple {2655#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,575 INFO L290 TraceCheckUtils]: 39: Hoare triple {2655#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,575 INFO L290 TraceCheckUtils]: 40: Hoare triple {2655#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,575 INFO L290 TraceCheckUtils]: 41: Hoare triple {2655#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,576 INFO L290 TraceCheckUtils]: 42: Hoare triple {2655#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,576 INFO L290 TraceCheckUtils]: 43: Hoare triple {2655#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,576 INFO L290 TraceCheckUtils]: 44: Hoare triple {2655#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,576 INFO L290 TraceCheckUtils]: 45: Hoare triple {2655#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,576 INFO L290 TraceCheckUtils]: 46: Hoare triple {2655#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,576 INFO L290 TraceCheckUtils]: 47: Hoare triple {2655#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,577 INFO L290 TraceCheckUtils]: 48: Hoare triple {2655#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,577 INFO L290 TraceCheckUtils]: 49: Hoare triple {2655#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,577 INFO L290 TraceCheckUtils]: 50: Hoare triple {2655#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,577 INFO L290 TraceCheckUtils]: 51: Hoare triple {2655#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,577 INFO L290 TraceCheckUtils]: 52: Hoare triple {2655#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,577 INFO L290 TraceCheckUtils]: 53: Hoare triple {2655#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,578 INFO L290 TraceCheckUtils]: 54: Hoare triple {2655#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,578 INFO L290 TraceCheckUtils]: 55: Hoare triple {2655#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,578 INFO L290 TraceCheckUtils]: 56: Hoare triple {2655#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,578 INFO L290 TraceCheckUtils]: 57: Hoare triple {2655#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,578 INFO L290 TraceCheckUtils]: 58: Hoare triple {2655#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,578 INFO L290 TraceCheckUtils]: 59: Hoare triple {2655#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,579 INFO L290 TraceCheckUtils]: 60: Hoare triple {2655#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,579 INFO L290 TraceCheckUtils]: 61: Hoare triple {2655#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-08 15:13:38,579 INFO L290 TraceCheckUtils]: 62: Hoare triple {2655#false} assume 8672 == #t~mem79;havoc #t~mem79; {2655#false} is VALID [2022-04-08 15:13:38,579 INFO L290 TraceCheckUtils]: 63: Hoare triple {2655#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {2655#false} is VALID [2022-04-08 15:13:38,579 INFO L290 TraceCheckUtils]: 64: Hoare triple {2655#false} assume 3 == ~blastFlag~0; {2655#false} is VALID [2022-04-08 15:13:38,579 INFO L290 TraceCheckUtils]: 65: Hoare triple {2655#false} assume !false; {2655#false} is VALID [2022-04-08 15:13:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:13:38,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:38,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392257020] [2022-04-08 15:13:38,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392257020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:38,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:38,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:38,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:38,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [552304745] [2022-04-08 15:13:38,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [552304745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:38,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:38,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:38,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136975916] [2022-04-08 15:13:38,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:38,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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 66 [2022-04-08 15:13:38,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:38,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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:38,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:38,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:38,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:38,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:38,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:38,648 INFO L87 Difference]: Start difference. First operand 148 states and 223 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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:40,673 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:41,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:41,689 INFO L93 Difference]: Finished difference Result 286 states and 429 transitions. [2022-04-08 15:13:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:41,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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 66 [2022-04-08 15:13:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:41,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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:41,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-08 15:13:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-08 15:13:41,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 429 transitions. [2022-04-08 15:13:42,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:42,008 INFO L225 Difference]: With dead ends: 286 [2022-04-08 15:13:42,008 INFO L226 Difference]: Without dead ends: 164 [2022-04-08 15:13:42,009 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:13:42,010 INFO L913 BasicCegarLoop]: 178 mSDtfsCounter, 28 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:42,010 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 455 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 348 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:13:42,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-08 15:13:42,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2022-04-08 15:13:42,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:42,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 148 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 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:13:42,019 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 148 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 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:13:42,020 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 148 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 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:13:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:42,024 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2022-04-08 15:13:42,024 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2022-04-08 15:13:42,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:42,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:42,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 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 164 states. [2022-04-08 15:13:42,026 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 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 164 states. [2022-04-08 15:13:42,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:42,030 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2022-04-08 15:13:42,030 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2022-04-08 15:13:42,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:42,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:42,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:42,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 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:13:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 222 transitions. [2022-04-08 15:13:42,035 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 222 transitions. Word has length 66 [2022-04-08 15:13:42,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:42,036 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 222 transitions. [2022-04-08 15:13:42,036 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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:42,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 222 transitions. [2022-04-08 15:13:42,188 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:13:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 222 transitions. [2022-04-08 15:13:42,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 15:13:42,189 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:42,189 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:13:42,189 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 15:13:42,189 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:42,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:42,190 INFO L85 PathProgramCache]: Analyzing trace with hash -207458704, now seen corresponding path program 1 times [2022-04-08 15:13:42,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:42,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1303088118] [2022-04-08 15:13:42,216 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 15:13:42,216 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:42,216 INFO L85 PathProgramCache]: Analyzing trace with hash -207458704, now seen corresponding path program 2 times [2022-04-08 15:13:42,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:42,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514648308] [2022-04-08 15:13:42,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:42,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:42,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:42,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {3869#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3862#true} is VALID [2022-04-08 15:13:42,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {3862#true} assume true; {3862#true} is VALID [2022-04-08 15:13:42,353 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3862#true} {3862#true} #661#return; {3862#true} is VALID [2022-04-08 15:13:42,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {3862#true} call ULTIMATE.init(); {3869#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:13:42,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {3869#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3862#true} is VALID [2022-04-08 15:13:42,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {3862#true} assume true; {3862#true} is VALID [2022-04-08 15:13:42,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3862#true} {3862#true} #661#return; {3862#true} is VALID [2022-04-08 15:13:42,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {3862#true} call #t~ret161 := main(); {3862#true} is VALID [2022-04-08 15:13:42,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {3862#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3862#true} is VALID [2022-04-08 15:13:42,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {3862#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {3862#true} is VALID [2022-04-08 15:13:42,355 INFO L272 TraceCheckUtils]: 7: Hoare triple {3862#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3862#true} is VALID [2022-04-08 15:13:42,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {3862#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:42,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:42,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:42,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:42,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:42,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:42,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:42,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:42,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3868#(= 8464 |ssl3_accept_#t~mem48|)} is VALID [2022-04-08 15:13:42,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {3868#(= 8464 |ssl3_accept_#t~mem48|)} assume 16384 == #t~mem48;havoc #t~mem48; {3863#false} is VALID [2022-04-08 15:13:42,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {3863#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {3863#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {3863#false} is VALID [2022-04-08 15:13:42,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {3863#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {3863#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {3863#false} is VALID [2022-04-08 15:13:42,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {3863#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {3863#false} is VALID [2022-04-08 15:13:42,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {3863#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {3863#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {3863#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {3863#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3863#false} is VALID [2022-04-08 15:13:42,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {3863#false} ~skip~0 := 0; {3863#false} is VALID [2022-04-08 15:13:42,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {3863#false} assume !false; {3863#false} is VALID [2022-04-08 15:13:42,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {3863#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {3863#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {3863#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {3863#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {3863#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {3863#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {3863#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {3863#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {3863#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {3863#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,365 INFO L290 TraceCheckUtils]: 39: Hoare triple {3863#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,365 INFO L290 TraceCheckUtils]: 40: Hoare triple {3863#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,365 INFO L290 TraceCheckUtils]: 41: Hoare triple {3863#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,365 INFO L290 TraceCheckUtils]: 42: Hoare triple {3863#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,365 INFO L290 TraceCheckUtils]: 43: Hoare triple {3863#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,366 INFO L290 TraceCheckUtils]: 44: Hoare triple {3863#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,366 INFO L290 TraceCheckUtils]: 45: Hoare triple {3863#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,366 INFO L290 TraceCheckUtils]: 46: Hoare triple {3863#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,366 INFO L290 TraceCheckUtils]: 47: Hoare triple {3863#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {3863#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {3863#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,366 INFO L290 TraceCheckUtils]: 50: Hoare triple {3863#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,367 INFO L290 TraceCheckUtils]: 51: Hoare triple {3863#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,367 INFO L290 TraceCheckUtils]: 52: Hoare triple {3863#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,367 INFO L290 TraceCheckUtils]: 53: Hoare triple {3863#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,367 INFO L290 TraceCheckUtils]: 54: Hoare triple {3863#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,367 INFO L290 TraceCheckUtils]: 55: Hoare triple {3863#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,367 INFO L290 TraceCheckUtils]: 56: Hoare triple {3863#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,367 INFO L290 TraceCheckUtils]: 57: Hoare triple {3863#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,367 INFO L290 TraceCheckUtils]: 58: Hoare triple {3863#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,368 INFO L290 TraceCheckUtils]: 59: Hoare triple {3863#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,368 INFO L290 TraceCheckUtils]: 60: Hoare triple {3863#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,368 INFO L290 TraceCheckUtils]: 61: Hoare triple {3863#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-08 15:13:42,368 INFO L290 TraceCheckUtils]: 62: Hoare triple {3863#false} assume 8672 == #t~mem79;havoc #t~mem79; {3863#false} is VALID [2022-04-08 15:13:42,368 INFO L290 TraceCheckUtils]: 63: Hoare triple {3863#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {3863#false} is VALID [2022-04-08 15:13:42,368 INFO L290 TraceCheckUtils]: 64: Hoare triple {3863#false} assume 3 == ~blastFlag~0; {3863#false} is VALID [2022-04-08 15:13:42,368 INFO L290 TraceCheckUtils]: 65: Hoare triple {3863#false} assume !false; {3863#false} is VALID [2022-04-08 15:13:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:13:42,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:42,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514648308] [2022-04-08 15:13:42,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514648308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:42,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:42,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:42,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:42,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1303088118] [2022-04-08 15:13:42,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1303088118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:42,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:42,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:42,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190124124] [2022-04-08 15:13:42,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:42,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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 66 [2022-04-08 15:13:42,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:42,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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:42,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:42,421 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:42,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:42,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:42,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:42,422 INFO L87 Difference]: Start difference. First operand 148 states and 222 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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:44,449 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:45,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:45,475 INFO L93 Difference]: Finished difference Result 286 states and 428 transitions. [2022-04-08 15:13:45,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:45,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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 66 [2022-04-08 15:13:45,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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:45,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-08 15:13:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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:45,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-08 15:13:45,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 428 transitions. [2022-04-08 15:13:45,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 428 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:45,786 INFO L225 Difference]: With dead ends: 286 [2022-04-08 15:13:45,786 INFO L226 Difference]: Without dead ends: 164 [2022-04-08 15:13:45,786 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:13:45,787 INFO L913 BasicCegarLoop]: 178 mSDtfsCounter, 26 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:45,787 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 455 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 348 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:13:45,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-08 15:13:45,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2022-04-08 15:13:45,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:45,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 148 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 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:45,796 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 148 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 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:45,796 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 148 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 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:45,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:45,801 INFO L93 Difference]: Finished difference Result 164 states and 241 transitions. [2022-04-08 15:13:45,801 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 241 transitions. [2022-04-08 15:13:45,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:45,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:45,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 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 164 states. [2022-04-08 15:13:45,802 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 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 164 states. [2022-04-08 15:13:45,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:45,806 INFO L93 Difference]: Finished difference Result 164 states and 241 transitions. [2022-04-08 15:13:45,806 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 241 transitions. [2022-04-08 15:13:45,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:45,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:45,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:45,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 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:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 221 transitions. [2022-04-08 15:13:45,811 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 221 transitions. Word has length 66 [2022-04-08 15:13:45,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:45,811 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 221 transitions. [2022-04-08 15:13:45,812 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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:45,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 221 transitions. [2022-04-08 15:13:45,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:45,980 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 221 transitions. [2022-04-08 15:13:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 15:13:45,980 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:45,980 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:13:45,981 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 15:13:45,981 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:45,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:45,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1867256871, now seen corresponding path program 1 times [2022-04-08 15:13:45,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:45,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1253486165] [2022-04-08 15:13:46,003 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:13:46,003 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:46,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1867256871, now seen corresponding path program 2 times [2022-04-08 15:13:46,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:46,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836402269] [2022-04-08 15:13:46,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:46,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:46,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:46,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {5077#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5070#true} is VALID [2022-04-08 15:13:46,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {5070#true} assume true; {5070#true} is VALID [2022-04-08 15:13:46,162 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5070#true} {5070#true} #661#return; {5070#true} is VALID [2022-04-08 15:13:46,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {5070#true} call ULTIMATE.init(); {5077#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:13:46,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {5077#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5070#true} is VALID [2022-04-08 15:13:46,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {5070#true} assume true; {5070#true} is VALID [2022-04-08 15:13:46,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5070#true} {5070#true} #661#return; {5070#true} is VALID [2022-04-08 15:13:46,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {5070#true} call #t~ret161 := main(); {5070#true} is VALID [2022-04-08 15:13:46,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {5070#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5070#true} is VALID [2022-04-08 15:13:46,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {5070#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {5070#true} is VALID [2022-04-08 15:13:46,164 INFO L272 TraceCheckUtils]: 7: Hoare triple {5070#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5070#true} is VALID [2022-04-08 15:13:46,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {5070#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:46,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:46,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:46,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:46,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:46,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:46,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:46,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:46,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:46,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:46,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:46,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:46,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:46,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5076#(= 8464 |ssl3_accept_#t~mem53|)} is VALID [2022-04-08 15:13:46,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {5076#(= 8464 |ssl3_accept_#t~mem53|)} assume 8481 == #t~mem53;havoc #t~mem53; {5071#false} is VALID [2022-04-08 15:13:46,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {5071#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {5071#false} is VALID [2022-04-08 15:13:46,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {5071#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {5071#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {5071#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5071#false} is VALID [2022-04-08 15:13:46,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {5071#false} ~skip~0 := 0; {5071#false} is VALID [2022-04-08 15:13:46,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {5071#false} assume !false; {5071#false} is VALID [2022-04-08 15:13:46,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {5071#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {5071#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {5071#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {5071#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {5071#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,174 INFO L290 TraceCheckUtils]: 34: Hoare triple {5071#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,174 INFO L290 TraceCheckUtils]: 35: Hoare triple {5071#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {5071#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {5071#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {5071#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,175 INFO L290 TraceCheckUtils]: 39: Hoare triple {5071#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {5071#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,175 INFO L290 TraceCheckUtils]: 41: Hoare triple {5071#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,175 INFO L290 TraceCheckUtils]: 42: Hoare triple {5071#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,175 INFO L290 TraceCheckUtils]: 43: Hoare triple {5071#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,175 INFO L290 TraceCheckUtils]: 44: Hoare triple {5071#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,175 INFO L290 TraceCheckUtils]: 45: Hoare triple {5071#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,175 INFO L290 TraceCheckUtils]: 46: Hoare triple {5071#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,176 INFO L290 TraceCheckUtils]: 47: Hoare triple {5071#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,176 INFO L290 TraceCheckUtils]: 48: Hoare triple {5071#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,176 INFO L290 TraceCheckUtils]: 49: Hoare triple {5071#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,176 INFO L290 TraceCheckUtils]: 50: Hoare triple {5071#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,176 INFO L290 TraceCheckUtils]: 51: Hoare triple {5071#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,176 INFO L290 TraceCheckUtils]: 52: Hoare triple {5071#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,176 INFO L290 TraceCheckUtils]: 53: Hoare triple {5071#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,176 INFO L290 TraceCheckUtils]: 54: Hoare triple {5071#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,177 INFO L290 TraceCheckUtils]: 55: Hoare triple {5071#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,177 INFO L290 TraceCheckUtils]: 56: Hoare triple {5071#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,177 INFO L290 TraceCheckUtils]: 57: Hoare triple {5071#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,177 INFO L290 TraceCheckUtils]: 58: Hoare triple {5071#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,177 INFO L290 TraceCheckUtils]: 59: Hoare triple {5071#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,177 INFO L290 TraceCheckUtils]: 60: Hoare triple {5071#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,177 INFO L290 TraceCheckUtils]: 61: Hoare triple {5071#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-08 15:13:46,177 INFO L290 TraceCheckUtils]: 62: Hoare triple {5071#false} assume 8672 == #t~mem79;havoc #t~mem79; {5071#false} is VALID [2022-04-08 15:13:46,178 INFO L290 TraceCheckUtils]: 63: Hoare triple {5071#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {5071#false} is VALID [2022-04-08 15:13:46,178 INFO L290 TraceCheckUtils]: 64: Hoare triple {5071#false} assume 3 == ~blastFlag~0; {5071#false} is VALID [2022-04-08 15:13:46,178 INFO L290 TraceCheckUtils]: 65: Hoare triple {5071#false} assume !false; {5071#false} is VALID [2022-04-08 15:13:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:13:46,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:46,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836402269] [2022-04-08 15:13:46,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836402269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:46,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:46,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:46,180 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:46,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1253486165] [2022-04-08 15:13:46,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1253486165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:46,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:46,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:46,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118779007] [2022-04-08 15:13:46,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:46,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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 66 [2022-04-08 15:13:46,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:46,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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:46,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:46,229 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:46,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:46,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:46,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:46,230 INFO L87 Difference]: Start difference. First operand 148 states and 221 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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:49,762 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:13:51,768 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:53,794 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:13:55,816 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:13:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:56,801 INFO L93 Difference]: Finished difference Result 284 states and 425 transitions. [2022-04-08 15:13:56,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:56,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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 66 [2022-04-08 15:13:56,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 425 transitions. [2022-04-08 15:13:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 425 transitions. [2022-04-08 15:13:56,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 425 transitions. [2022-04-08 15:13:57,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:57,158 INFO L225 Difference]: With dead ends: 284 [2022-04-08 15:13:57,158 INFO L226 Difference]: Without dead ends: 162 [2022-04-08 15:13:57,158 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:13:57,159 INFO L913 BasicCegarLoop]: 180 mSDtfsCounter, 20 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:57,159 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 459 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 3 Unknown, 0 Unchecked, 7.8s Time] [2022-04-08 15:13:57,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-04-08 15:13:57,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 148. [2022-04-08 15:13:57,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:57,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 148 states, 143 states have (on average 1.5104895104895104) internal successors, (216), 143 states have internal predecessors, (216), 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,167 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 148 states, 143 states have (on average 1.5104895104895104) internal successors, (216), 143 states have internal predecessors, (216), 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,168 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 148 states, 143 states have (on average 1.5104895104895104) internal successors, (216), 143 states have internal predecessors, (216), 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,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:57,171 INFO L93 Difference]: Finished difference Result 162 states and 238 transitions. [2022-04-08 15:13:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2022-04-08 15:13:57,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:57,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:57,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5104895104895104) internal successors, (216), 143 states have internal predecessors, (216), 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 162 states. [2022-04-08 15:13:57,172 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5104895104895104) internal successors, (216), 143 states have internal predecessors, (216), 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 162 states. [2022-04-08 15:13:57,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:57,175 INFO L93 Difference]: Finished difference Result 162 states and 238 transitions. [2022-04-08 15:13:57,175 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2022-04-08 15:13:57,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:57,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:57,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:57,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5104895104895104) internal successors, (216), 143 states have internal predecessors, (216), 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,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 220 transitions. [2022-04-08 15:13:57,179 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 220 transitions. Word has length 66 [2022-04-08 15:13:57,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:57,179 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 220 transitions. [2022-04-08 15:13:57,179 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 220 transitions. [2022-04-08 15:13:57,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 220 transitions. [2022-04-08 15:13:57,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 15:13:57,356 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:57,357 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:13:57,357 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 15:13:57,357 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:57,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:57,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1927058904, now seen corresponding path program 1 times [2022-04-08 15:13:57,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:57,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1743098176] [2022-04-08 15:13:57,371 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:13:57,371 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:57,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1927058904, now seen corresponding path program 2 times [2022-04-08 15:13:57,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:57,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571934293] [2022-04-08 15:13:57,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:57,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:57,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:57,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {6277#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6270#true} is VALID [2022-04-08 15:13:57,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {6270#true} assume true; {6270#true} is VALID [2022-04-08 15:13:57,495 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6270#true} {6270#true} #661#return; {6270#true} is VALID [2022-04-08 15:13:57,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {6270#true} call ULTIMATE.init(); {6277#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:13:57,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {6277#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6270#true} is VALID [2022-04-08 15:13:57,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {6270#true} assume true; {6270#true} is VALID [2022-04-08 15:13:57,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6270#true} {6270#true} #661#return; {6270#true} is VALID [2022-04-08 15:13:57,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {6270#true} call #t~ret161 := main(); {6270#true} is VALID [2022-04-08 15:13:57,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {6270#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {6270#true} is VALID [2022-04-08 15:13:57,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {6270#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {6270#true} is VALID [2022-04-08 15:13:57,497 INFO L272 TraceCheckUtils]: 7: Hoare triple {6270#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6270#true} is VALID [2022-04-08 15:13:57,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {6270#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:57,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:57,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:57,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:57,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:57,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:57,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:57,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:57,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:57,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:57,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:57,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:57,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:57,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:57,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {6276#(= 8464 |ssl3_accept_#t~mem54|)} is VALID [2022-04-08 15:13:57,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {6276#(= 8464 |ssl3_accept_#t~mem54|)} assume 8482 == #t~mem54;havoc #t~mem54; {6271#false} is VALID [2022-04-08 15:13:57,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {6271#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {6271#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {6271#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {6271#false} is VALID [2022-04-08 15:13:57,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {6271#false} ~skip~0 := 0; {6271#false} is VALID [2022-04-08 15:13:57,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {6271#false} assume !false; {6271#false} is VALID [2022-04-08 15:13:57,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {6271#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {6271#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {6271#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,507 INFO L290 TraceCheckUtils]: 32: Hoare triple {6271#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {6271#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,508 INFO L290 TraceCheckUtils]: 34: Hoare triple {6271#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {6271#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,508 INFO L290 TraceCheckUtils]: 36: Hoare triple {6271#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,508 INFO L290 TraceCheckUtils]: 37: Hoare triple {6271#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {6271#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,508 INFO L290 TraceCheckUtils]: 39: Hoare triple {6271#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,508 INFO L290 TraceCheckUtils]: 40: Hoare triple {6271#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,509 INFO L290 TraceCheckUtils]: 41: Hoare triple {6271#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,509 INFO L290 TraceCheckUtils]: 42: Hoare triple {6271#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,509 INFO L290 TraceCheckUtils]: 43: Hoare triple {6271#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,509 INFO L290 TraceCheckUtils]: 44: Hoare triple {6271#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,509 INFO L290 TraceCheckUtils]: 45: Hoare triple {6271#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,509 INFO L290 TraceCheckUtils]: 46: Hoare triple {6271#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,509 INFO L290 TraceCheckUtils]: 47: Hoare triple {6271#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,509 INFO L290 TraceCheckUtils]: 48: Hoare triple {6271#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,510 INFO L290 TraceCheckUtils]: 49: Hoare triple {6271#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,510 INFO L290 TraceCheckUtils]: 50: Hoare triple {6271#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,510 INFO L290 TraceCheckUtils]: 51: Hoare triple {6271#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,510 INFO L290 TraceCheckUtils]: 52: Hoare triple {6271#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,510 INFO L290 TraceCheckUtils]: 53: Hoare triple {6271#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,510 INFO L290 TraceCheckUtils]: 54: Hoare triple {6271#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,511 INFO L290 TraceCheckUtils]: 55: Hoare triple {6271#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,511 INFO L290 TraceCheckUtils]: 56: Hoare triple {6271#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,511 INFO L290 TraceCheckUtils]: 57: Hoare triple {6271#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,511 INFO L290 TraceCheckUtils]: 58: Hoare triple {6271#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,511 INFO L290 TraceCheckUtils]: 59: Hoare triple {6271#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,511 INFO L290 TraceCheckUtils]: 60: Hoare triple {6271#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,511 INFO L290 TraceCheckUtils]: 61: Hoare triple {6271#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-08 15:13:57,512 INFO L290 TraceCheckUtils]: 62: Hoare triple {6271#false} assume 8672 == #t~mem79;havoc #t~mem79; {6271#false} is VALID [2022-04-08 15:13:57,512 INFO L290 TraceCheckUtils]: 63: Hoare triple {6271#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {6271#false} is VALID [2022-04-08 15:13:57,512 INFO L290 TraceCheckUtils]: 64: Hoare triple {6271#false} assume 3 == ~blastFlag~0; {6271#false} is VALID [2022-04-08 15:13:57,512 INFO L290 TraceCheckUtils]: 65: Hoare triple {6271#false} assume !false; {6271#false} is VALID [2022-04-08 15:13:57,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:13:57,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:57,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571934293] [2022-04-08 15:13:57,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571934293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:57,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:57,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:57,513 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:57,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1743098176] [2022-04-08 15:13:57,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1743098176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:57,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:57,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:57,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262223558] [2022-04-08 15:13:57,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:57,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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 66 [2022-04-08 15:13:57,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:57,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:57,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:57,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:57,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:57,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:57,573 INFO L87 Difference]: Start difference. First operand 148 states and 220 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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:59,600 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:00,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:00,594 INFO L93 Difference]: Finished difference Result 283 states and 423 transitions. [2022-04-08 15:14:00,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:00,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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 66 [2022-04-08 15:14:00,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:00,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-04-08 15:14:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-04-08 15:14:00,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 423 transitions. [2022-04-08 15:14:00,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 423 edges. 423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:00,892 INFO L225 Difference]: With dead ends: 283 [2022-04-08 15:14:00,892 INFO L226 Difference]: Without dead ends: 161 [2022-04-08 15:14:00,892 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:00,893 INFO L913 BasicCegarLoop]: 181 mSDtfsCounter, 18 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:00,893 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 461 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:14:00,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-08 15:14:00,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2022-04-08 15:14:00,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:00,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 143 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:14:00,902 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 143 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:14:00,902 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 143 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:14:00,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:00,905 INFO L93 Difference]: Finished difference Result 161 states and 236 transitions. [2022-04-08 15:14:00,906 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 236 transitions. [2022-04-08 15:14:00,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:00,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:00,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 143 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 161 states. [2022-04-08 15:14:00,907 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 143 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 161 states. [2022-04-08 15:14:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:00,910 INFO L93 Difference]: Finished difference Result 161 states and 236 transitions. [2022-04-08 15:14:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 236 transitions. [2022-04-08 15:14:00,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:00,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:00,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:00,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 143 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:14:00,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 219 transitions. [2022-04-08 15:14:00,914 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 219 transitions. Word has length 66 [2022-04-08 15:14:00,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:00,914 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 219 transitions. [2022-04-08 15:14:00,914 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 219 transitions. [2022-04-08 15:14:01,074 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:14:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 219 transitions. [2022-04-08 15:14:01,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 15:14:01,075 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:01,075 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:14:01,076 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 15:14:01,076 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:01,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:01,076 INFO L85 PathProgramCache]: Analyzing trace with hash 527212629, now seen corresponding path program 1 times [2022-04-08 15:14:01,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:01,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [599398659] [2022-04-08 15:14:01,100 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 15:14:01,100 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:01,100 INFO L85 PathProgramCache]: Analyzing trace with hash 527212629, now seen corresponding path program 2 times [2022-04-08 15:14:01,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:01,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177253162] [2022-04-08 15:14:01,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:01,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:01,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:01,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {7473#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7466#true} is VALID [2022-04-08 15:14:01,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {7466#true} assume true; {7466#true} is VALID [2022-04-08 15:14:01,217 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7466#true} {7466#true} #661#return; {7466#true} is VALID [2022-04-08 15:14:01,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {7466#true} call ULTIMATE.init(); {7473#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:14:01,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {7473#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7466#true} is VALID [2022-04-08 15:14:01,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {7466#true} assume true; {7466#true} is VALID [2022-04-08 15:14:01,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7466#true} {7466#true} #661#return; {7466#true} is VALID [2022-04-08 15:14:01,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {7466#true} call #t~ret161 := main(); {7466#true} is VALID [2022-04-08 15:14:01,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {7466#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {7466#true} is VALID [2022-04-08 15:14:01,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {7466#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {7466#true} is VALID [2022-04-08 15:14:01,219 INFO L272 TraceCheckUtils]: 7: Hoare triple {7466#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7466#true} is VALID [2022-04-08 15:14:01,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {7466#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:01,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:01,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:01,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:01,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:01,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:01,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:01,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:01,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:01,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7472#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-08 15:14:01,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {7472#(= 8464 |ssl3_accept_#t~mem49|)} assume 8192 == #t~mem49;havoc #t~mem49; {7467#false} is VALID [2022-04-08 15:14:01,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {7467#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {7467#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {7467#false} is VALID [2022-04-08 15:14:01,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {7467#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {7467#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {7467#false} is VALID [2022-04-08 15:14:01,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {7467#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {7467#false} is VALID [2022-04-08 15:14:01,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {7467#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {7467#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {7467#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {7467#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7467#false} is VALID [2022-04-08 15:14:01,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {7467#false} ~skip~0 := 0; {7467#false} is VALID [2022-04-08 15:14:01,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {7467#false} assume !false; {7467#false} is VALID [2022-04-08 15:14:01,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {7467#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,229 INFO L290 TraceCheckUtils]: 31: Hoare triple {7467#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,229 INFO L290 TraceCheckUtils]: 32: Hoare triple {7467#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,229 INFO L290 TraceCheckUtils]: 33: Hoare triple {7467#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,229 INFO L290 TraceCheckUtils]: 34: Hoare triple {7467#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,229 INFO L290 TraceCheckUtils]: 35: Hoare triple {7467#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,229 INFO L290 TraceCheckUtils]: 36: Hoare triple {7467#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,229 INFO L290 TraceCheckUtils]: 37: Hoare triple {7467#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,229 INFO L290 TraceCheckUtils]: 38: Hoare triple {7467#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,229 INFO L290 TraceCheckUtils]: 39: Hoare triple {7467#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,230 INFO L290 TraceCheckUtils]: 40: Hoare triple {7467#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,230 INFO L290 TraceCheckUtils]: 41: Hoare triple {7467#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,230 INFO L290 TraceCheckUtils]: 42: Hoare triple {7467#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,230 INFO L290 TraceCheckUtils]: 43: Hoare triple {7467#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,230 INFO L290 TraceCheckUtils]: 44: Hoare triple {7467#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,230 INFO L290 TraceCheckUtils]: 45: Hoare triple {7467#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,230 INFO L290 TraceCheckUtils]: 46: Hoare triple {7467#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,230 INFO L290 TraceCheckUtils]: 47: Hoare triple {7467#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,230 INFO L290 TraceCheckUtils]: 48: Hoare triple {7467#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,231 INFO L290 TraceCheckUtils]: 49: Hoare triple {7467#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,231 INFO L290 TraceCheckUtils]: 50: Hoare triple {7467#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,231 INFO L290 TraceCheckUtils]: 51: Hoare triple {7467#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,231 INFO L290 TraceCheckUtils]: 52: Hoare triple {7467#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,231 INFO L290 TraceCheckUtils]: 53: Hoare triple {7467#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,231 INFO L290 TraceCheckUtils]: 54: Hoare triple {7467#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,231 INFO L290 TraceCheckUtils]: 55: Hoare triple {7467#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,231 INFO L290 TraceCheckUtils]: 56: Hoare triple {7467#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,231 INFO L290 TraceCheckUtils]: 57: Hoare triple {7467#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {7467#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,232 INFO L290 TraceCheckUtils]: 59: Hoare triple {7467#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,232 INFO L290 TraceCheckUtils]: 60: Hoare triple {7467#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,232 INFO L290 TraceCheckUtils]: 61: Hoare triple {7467#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,232 INFO L290 TraceCheckUtils]: 62: Hoare triple {7467#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-08 15:14:01,232 INFO L290 TraceCheckUtils]: 63: Hoare triple {7467#false} assume 8672 == #t~mem79;havoc #t~mem79; {7467#false} is VALID [2022-04-08 15:14:01,232 INFO L290 TraceCheckUtils]: 64: Hoare triple {7467#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {7467#false} is VALID [2022-04-08 15:14:01,233 INFO L290 TraceCheckUtils]: 65: Hoare triple {7467#false} assume 3 == ~blastFlag~0; {7467#false} is VALID [2022-04-08 15:14:01,233 INFO L290 TraceCheckUtils]: 66: Hoare triple {7467#false} assume !false; {7467#false} is VALID [2022-04-08 15:14:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:14:01,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:01,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177253162] [2022-04-08 15:14:01,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177253162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:01,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:01,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:01,234 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:01,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [599398659] [2022-04-08 15:14:01,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [599398659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:01,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:01,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:01,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703571825] [2022-04-08 15:14:01,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:01,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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 67 [2022-04-08 15:14:01,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:01,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:01,296 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:01,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:01,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:01,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:01,297 INFO L87 Difference]: Start difference. First operand 148 states and 219 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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:03,322 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:04,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:04,217 INFO L93 Difference]: Finished difference Result 283 states and 422 transitions. [2022-04-08 15:14:04,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:04,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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 67 [2022-04-08 15:14:04,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:04,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 422 transitions. [2022-04-08 15:14:04,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 422 transitions. [2022-04-08 15:14:04,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 422 transitions. [2022-04-08 15:14:04,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:04,562 INFO L225 Difference]: With dead ends: 283 [2022-04-08 15:14:04,562 INFO L226 Difference]: Without dead ends: 161 [2022-04-08 15:14:04,563 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:04,563 INFO L913 BasicCegarLoop]: 181 mSDtfsCounter, 22 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:04,563 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 461 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:14:04,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-08 15:14:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2022-04-08 15:14:04,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:04,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.4965034965034965) internal successors, (214), 143 states have internal predecessors, (214), 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:04,570 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.4965034965034965) internal successors, (214), 143 states have internal predecessors, (214), 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:04,570 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.4965034965034965) internal successors, (214), 143 states have internal predecessors, (214), 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:04,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:04,585 INFO L93 Difference]: Finished difference Result 161 states and 235 transitions. [2022-04-08 15:14:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 235 transitions. [2022-04-08 15:14:04,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:04,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:04,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.4965034965034965) internal successors, (214), 143 states have internal predecessors, (214), 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 161 states. [2022-04-08 15:14:04,586 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.4965034965034965) internal successors, (214), 143 states have internal predecessors, (214), 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 161 states. [2022-04-08 15:14:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:04,589 INFO L93 Difference]: Finished difference Result 161 states and 235 transitions. [2022-04-08 15:14:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 235 transitions. [2022-04-08 15:14:04,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:04,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:04,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:04,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.4965034965034965) internal successors, (214), 143 states have internal predecessors, (214), 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:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2022-04-08 15:14:04,593 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 67 [2022-04-08 15:14:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:04,593 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2022-04-08 15:14:04,593 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 218 transitions. [2022-04-08 15:14:04,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:04,777 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2022-04-08 15:14:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 15:14:04,778 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:04,778 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:14:04,779 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 15:14:04,779 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:04,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:04,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1788390677, now seen corresponding path program 1 times [2022-04-08 15:14:04,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:04,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1154017220] [2022-04-08 15:14:04,812 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 15:14:04,812 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:04,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1788390677, now seen corresponding path program 2 times [2022-04-08 15:14:04,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:04,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799118907] [2022-04-08 15:14:04,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:04,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:04,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:04,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {8669#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8662#true} is VALID [2022-04-08 15:14:04,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {8662#true} assume true; {8662#true} is VALID [2022-04-08 15:14:04,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8662#true} {8662#true} #661#return; {8662#true} is VALID [2022-04-08 15:14:04,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {8662#true} call ULTIMATE.init(); {8669#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:14:04,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {8669#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8662#true} is VALID [2022-04-08 15:14:04,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {8662#true} assume true; {8662#true} is VALID [2022-04-08 15:14:04,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8662#true} {8662#true} #661#return; {8662#true} is VALID [2022-04-08 15:14:04,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {8662#true} call #t~ret161 := main(); {8662#true} is VALID [2022-04-08 15:14:04,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {8662#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {8662#true} is VALID [2022-04-08 15:14:04,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {8662#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {8662#true} is VALID [2022-04-08 15:14:04,975 INFO L272 TraceCheckUtils]: 7: Hoare triple {8662#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8662#true} is VALID [2022-04-08 15:14:04,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {8662#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:04,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:04,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:04,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:04,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:04,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:04,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:04,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:04,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:04,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:04,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8668#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-08 15:14:04,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {8668#(= 8464 |ssl3_accept_#t~mem50|)} assume 24576 == #t~mem50;havoc #t~mem50; {8663#false} is VALID [2022-04-08 15:14:04,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {8663#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {8663#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {8663#false} is VALID [2022-04-08 15:14:04,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {8663#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {8663#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {8663#false} is VALID [2022-04-08 15:14:04,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {8663#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {8663#false} is VALID [2022-04-08 15:14:04,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {8663#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {8663#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {8663#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {8663#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8663#false} is VALID [2022-04-08 15:14:04,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {8663#false} ~skip~0 := 0; {8663#false} is VALID [2022-04-08 15:14:04,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {8663#false} assume !false; {8663#false} is VALID [2022-04-08 15:14:04,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {8663#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {8663#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,988 INFO L290 TraceCheckUtils]: 33: Hoare triple {8663#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,989 INFO L290 TraceCheckUtils]: 34: Hoare triple {8663#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,989 INFO L290 TraceCheckUtils]: 35: Hoare triple {8663#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,989 INFO L290 TraceCheckUtils]: 36: Hoare triple {8663#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,990 INFO L290 TraceCheckUtils]: 37: Hoare triple {8663#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,990 INFO L290 TraceCheckUtils]: 38: Hoare triple {8663#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,990 INFO L290 TraceCheckUtils]: 39: Hoare triple {8663#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,990 INFO L290 TraceCheckUtils]: 40: Hoare triple {8663#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,991 INFO L290 TraceCheckUtils]: 41: Hoare triple {8663#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,991 INFO L290 TraceCheckUtils]: 42: Hoare triple {8663#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,991 INFO L290 TraceCheckUtils]: 43: Hoare triple {8663#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,991 INFO L290 TraceCheckUtils]: 44: Hoare triple {8663#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,991 INFO L290 TraceCheckUtils]: 45: Hoare triple {8663#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,991 INFO L290 TraceCheckUtils]: 46: Hoare triple {8663#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,992 INFO L290 TraceCheckUtils]: 47: Hoare triple {8663#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,992 INFO L290 TraceCheckUtils]: 48: Hoare triple {8663#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,992 INFO L290 TraceCheckUtils]: 49: Hoare triple {8663#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,992 INFO L290 TraceCheckUtils]: 50: Hoare triple {8663#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,992 INFO L290 TraceCheckUtils]: 51: Hoare triple {8663#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,992 INFO L290 TraceCheckUtils]: 52: Hoare triple {8663#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,992 INFO L290 TraceCheckUtils]: 53: Hoare triple {8663#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,992 INFO L290 TraceCheckUtils]: 54: Hoare triple {8663#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,992 INFO L290 TraceCheckUtils]: 55: Hoare triple {8663#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,992 INFO L290 TraceCheckUtils]: 56: Hoare triple {8663#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,993 INFO L290 TraceCheckUtils]: 57: Hoare triple {8663#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,993 INFO L290 TraceCheckUtils]: 58: Hoare triple {8663#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,993 INFO L290 TraceCheckUtils]: 59: Hoare triple {8663#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,993 INFO L290 TraceCheckUtils]: 60: Hoare triple {8663#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,993 INFO L290 TraceCheckUtils]: 61: Hoare triple {8663#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,993 INFO L290 TraceCheckUtils]: 62: Hoare triple {8663#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,993 INFO L290 TraceCheckUtils]: 63: Hoare triple {8663#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-08 15:14:04,993 INFO L290 TraceCheckUtils]: 64: Hoare triple {8663#false} assume 8672 == #t~mem79;havoc #t~mem79; {8663#false} is VALID [2022-04-08 15:14:04,993 INFO L290 TraceCheckUtils]: 65: Hoare triple {8663#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {8663#false} is VALID [2022-04-08 15:14:04,993 INFO L290 TraceCheckUtils]: 66: Hoare triple {8663#false} assume 3 == ~blastFlag~0; {8663#false} is VALID [2022-04-08 15:14:04,993 INFO L290 TraceCheckUtils]: 67: Hoare triple {8663#false} assume !false; {8663#false} is VALID [2022-04-08 15:14:04,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:14:04,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:04,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799118907] [2022-04-08 15:14:04,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799118907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:04,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:04,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:04,995 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:04,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1154017220] [2022-04-08 15:14:04,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1154017220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:04,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:04,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:04,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935261124] [2022-04-08 15:14:04,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:04,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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 68 [2022-04-08 15:14:04,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:04,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:05,047 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:05,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:05,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:05,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:05,048 INFO L87 Difference]: Start difference. First operand 148 states and 218 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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:07,069 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:14:08,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:08,063 INFO L93 Difference]: Finished difference Result 283 states and 421 transitions. [2022-04-08 15:14:08,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:08,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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 68 [2022-04-08 15:14:08,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2022-04-08 15:14:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2022-04-08 15:14:08,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 421 transitions. [2022-04-08 15:14:08,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 421 edges. 421 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:08,420 INFO L225 Difference]: With dead ends: 283 [2022-04-08 15:14:08,420 INFO L226 Difference]: Without dead ends: 161 [2022-04-08 15:14:08,420 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:08,421 INFO L913 BasicCegarLoop]: 181 mSDtfsCounter, 20 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:08,421 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 461 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:14:08,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-08 15:14:08,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2022-04-08 15:14:08,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:08,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 143 states have internal predecessors, (213), 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:08,440 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 143 states have internal predecessors, (213), 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:08,441 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 143 states have internal predecessors, (213), 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:08,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:08,445 INFO L93 Difference]: Finished difference Result 161 states and 234 transitions. [2022-04-08 15:14:08,445 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2022-04-08 15:14:08,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:08,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:08,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 143 states have internal predecessors, (213), 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 161 states. [2022-04-08 15:14:08,447 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 143 states have internal predecessors, (213), 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 161 states. [2022-04-08 15:14:08,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:08,450 INFO L93 Difference]: Finished difference Result 161 states and 234 transitions. [2022-04-08 15:14:08,450 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2022-04-08 15:14:08,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:08,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:08,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:08,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:08,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 143 states have internal predecessors, (213), 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:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 217 transitions. [2022-04-08 15:14:08,454 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 217 transitions. Word has length 68 [2022-04-08 15:14:08,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:08,454 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 217 transitions. [2022-04-08 15:14:08,454 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 217 transitions. [2022-04-08 15:14:08,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:08,638 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 217 transitions. [2022-04-08 15:14:08,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 15:14:08,639 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:08,639 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:14:08,639 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 15:14:08,640 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:08,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:08,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2103559590, now seen corresponding path program 1 times [2022-04-08 15:14:08,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:08,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1531286591] [2022-04-08 15:14:08,664 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 15:14:08,664 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:08,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2103559590, now seen corresponding path program 2 times [2022-04-08 15:14:08,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:08,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904905022] [2022-04-08 15:14:08,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:08,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:08,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:08,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {9865#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9858#true} is VALID [2022-04-08 15:14:08,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {9858#true} assume true; {9858#true} is VALID [2022-04-08 15:14:08,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9858#true} {9858#true} #661#return; {9858#true} is VALID [2022-04-08 15:14:08,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {9858#true} call ULTIMATE.init(); {9865#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:14:08,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {9865#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9858#true} is VALID [2022-04-08 15:14:08,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {9858#true} assume true; {9858#true} is VALID [2022-04-08 15:14:08,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9858#true} {9858#true} #661#return; {9858#true} is VALID [2022-04-08 15:14:08,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {9858#true} call #t~ret161 := main(); {9858#true} is VALID [2022-04-08 15:14:08,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {9858#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {9858#true} is VALID [2022-04-08 15:14:08,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {9858#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {9858#true} is VALID [2022-04-08 15:14:08,809 INFO L272 TraceCheckUtils]: 7: Hoare triple {9858#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9858#true} is VALID [2022-04-08 15:14:08,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {9858#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:08,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:08,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:08,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:08,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:08,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:08,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:08,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:08,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:08,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:08,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:08,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {9864#(= 8464 |ssl3_accept_#t~mem51|)} is VALID [2022-04-08 15:14:08,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {9864#(= 8464 |ssl3_accept_#t~mem51|)} assume 8195 == #t~mem51;havoc #t~mem51; {9859#false} is VALID [2022-04-08 15:14:08,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {9859#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {9859#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {9859#false} is VALID [2022-04-08 15:14:08,817 INFO L290 TraceCheckUtils]: 23: Hoare triple {9859#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {9859#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {9859#false} is VALID [2022-04-08 15:14:08,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {9859#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {9859#false} is VALID [2022-04-08 15:14:08,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {9859#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,818 INFO L290 TraceCheckUtils]: 27: Hoare triple {9859#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,818 INFO L290 TraceCheckUtils]: 28: Hoare triple {9859#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {9859#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9859#false} is VALID [2022-04-08 15:14:08,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {9859#false} ~skip~0 := 0; {9859#false} is VALID [2022-04-08 15:14:08,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {9859#false} assume !false; {9859#false} is VALID [2022-04-08 15:14:08,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {9859#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {9859#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,818 INFO L290 TraceCheckUtils]: 34: Hoare triple {9859#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,819 INFO L290 TraceCheckUtils]: 35: Hoare triple {9859#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,819 INFO L290 TraceCheckUtils]: 36: Hoare triple {9859#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,819 INFO L290 TraceCheckUtils]: 37: Hoare triple {9859#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,819 INFO L290 TraceCheckUtils]: 38: Hoare triple {9859#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,819 INFO L290 TraceCheckUtils]: 39: Hoare triple {9859#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,819 INFO L290 TraceCheckUtils]: 40: Hoare triple {9859#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,819 INFO L290 TraceCheckUtils]: 41: Hoare triple {9859#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,819 INFO L290 TraceCheckUtils]: 42: Hoare triple {9859#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,819 INFO L290 TraceCheckUtils]: 43: Hoare triple {9859#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {9859#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,820 INFO L290 TraceCheckUtils]: 45: Hoare triple {9859#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,820 INFO L290 TraceCheckUtils]: 46: Hoare triple {9859#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,820 INFO L290 TraceCheckUtils]: 47: Hoare triple {9859#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,820 INFO L290 TraceCheckUtils]: 48: Hoare triple {9859#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,820 INFO L290 TraceCheckUtils]: 49: Hoare triple {9859#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,820 INFO L290 TraceCheckUtils]: 50: Hoare triple {9859#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,820 INFO L290 TraceCheckUtils]: 51: Hoare triple {9859#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,820 INFO L290 TraceCheckUtils]: 52: Hoare triple {9859#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,820 INFO L290 TraceCheckUtils]: 53: Hoare triple {9859#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,820 INFO L290 TraceCheckUtils]: 54: Hoare triple {9859#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {9859#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {9859#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {9859#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,821 INFO L290 TraceCheckUtils]: 58: Hoare triple {9859#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,821 INFO L290 TraceCheckUtils]: 59: Hoare triple {9859#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,821 INFO L290 TraceCheckUtils]: 60: Hoare triple {9859#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {9859#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,821 INFO L290 TraceCheckUtils]: 62: Hoare triple {9859#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,821 INFO L290 TraceCheckUtils]: 63: Hoare triple {9859#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,821 INFO L290 TraceCheckUtils]: 64: Hoare triple {9859#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-08 15:14:08,821 INFO L290 TraceCheckUtils]: 65: Hoare triple {9859#false} assume 8672 == #t~mem79;havoc #t~mem79; {9859#false} is VALID [2022-04-08 15:14:08,822 INFO L290 TraceCheckUtils]: 66: Hoare triple {9859#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {9859#false} is VALID [2022-04-08 15:14:08,822 INFO L290 TraceCheckUtils]: 67: Hoare triple {9859#false} assume 3 == ~blastFlag~0; {9859#false} is VALID [2022-04-08 15:14:08,822 INFO L290 TraceCheckUtils]: 68: Hoare triple {9859#false} assume !false; {9859#false} is VALID [2022-04-08 15:14:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:14:08,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:08,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904905022] [2022-04-08 15:14:08,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904905022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:08,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:08,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:08,823 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:08,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1531286591] [2022-04-08 15:14:08,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1531286591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:08,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:08,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:08,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502959723] [2022-04-08 15:14:08,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:08,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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 69 [2022-04-08 15:14:08,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:08,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:08,909 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:08,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:08,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:08,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:08,910 INFO L87 Difference]: Start difference. First operand 148 states and 217 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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,934 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:14:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:11,906 INFO L93 Difference]: Finished difference Result 273 states and 407 transitions. [2022-04-08 15:14:11,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:11,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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 69 [2022-04-08 15:14:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:11,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2022-04-08 15:14:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2022-04-08 15:14:11,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 407 transitions. [2022-04-08 15:14:12,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:12,251 INFO L225 Difference]: With dead ends: 273 [2022-04-08 15:14:12,251 INFO L226 Difference]: Without dead ends: 151 [2022-04-08 15:14:12,252 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:12,252 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 11 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:12,252 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 475 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 328 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:14:12,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-08 15:14:12,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2022-04-08 15:14:12,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:12,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 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:12,257 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 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:12,257 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 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:12,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:12,261 INFO L93 Difference]: Finished difference Result 151 states and 220 transitions. [2022-04-08 15:14:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2022-04-08 15:14:12,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:12,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:12,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 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 151 states. [2022-04-08 15:14:12,262 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 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 151 states. [2022-04-08 15:14:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:12,265 INFO L93 Difference]: Finished difference Result 151 states and 220 transitions. [2022-04-08 15:14:12,265 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2022-04-08 15:14:12,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:12,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:12,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:12,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:12,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 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:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 216 transitions. [2022-04-08 15:14:12,270 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 216 transitions. Word has length 69 [2022-04-08 15:14:12,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:12,270 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 216 transitions. [2022-04-08 15:14:12,270 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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:12,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 216 transitions. [2022-04-08 15:14:12,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:12,450 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 216 transitions. [2022-04-08 15:14:12,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 15:14:12,450 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:12,451 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:14:12,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 15:14:12,451 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:12,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:12,451 INFO L85 PathProgramCache]: Analyzing trace with hash 890818627, now seen corresponding path program 1 times [2022-04-08 15:14:12,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:12,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1427641258] [2022-04-08 15:14:12,471 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:12,471 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:12,472 INFO L85 PathProgramCache]: Analyzing trace with hash 890818627, now seen corresponding path program 2 times [2022-04-08 15:14:12,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:12,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006408201] [2022-04-08 15:14:12,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:12,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:12,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:12,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {11021#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {11014#true} is VALID [2022-04-08 15:14:12,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {11014#true} assume true; {11014#true} is VALID [2022-04-08 15:14:12,613 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11014#true} {11014#true} #661#return; {11014#true} is VALID [2022-04-08 15:14:12,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {11014#true} call ULTIMATE.init(); {11021#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:14:12,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {11021#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {11014#true} is VALID [2022-04-08 15:14:12,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {11014#true} assume true; {11014#true} is VALID [2022-04-08 15:14:12,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11014#true} {11014#true} #661#return; {11014#true} is VALID [2022-04-08 15:14:12,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {11014#true} call #t~ret161 := main(); {11014#true} is VALID [2022-04-08 15:14:12,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {11014#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {11014#true} is VALID [2022-04-08 15:14:12,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {11014#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {11014#true} is VALID [2022-04-08 15:14:12,615 INFO L272 TraceCheckUtils]: 7: Hoare triple {11014#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {11014#true} is VALID [2022-04-08 15:14:12,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {11014#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {11014#true} is VALID [2022-04-08 15:14:12,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {11014#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {11014#true} is VALID [2022-04-08 15:14:12,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {11014#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {11014#true} is VALID [2022-04-08 15:14:12,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {11014#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11014#true} is VALID [2022-04-08 15:14:12,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {11014#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {11014#true} is VALID [2022-04-08 15:14:12,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {11014#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {11014#true} is VALID [2022-04-08 15:14:12,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {11014#true} assume !false; {11014#true} is VALID [2022-04-08 15:14:12,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {11014#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-08 15:14:12,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {11014#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-08 15:14:12,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {11014#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-08 15:14:12,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {11014#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-08 15:14:12,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {11014#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-08 15:14:12,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {11014#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-08 15:14:12,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {11014#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-08 15:14:12,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {11014#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-08 15:14:12,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {11014#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-08 15:14:12,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {11014#true} assume 8464 == #t~mem55;havoc #t~mem55; {11014#true} is VALID [2022-04-08 15:14:12,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {11014#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {11014#true} is VALID [2022-04-08 15:14:12,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {11014#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11014#true} is VALID [2022-04-08 15:14:12,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {11014#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} ~skip~0 := 0; {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !false; {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,621 INFO L290 TraceCheckUtils]: 34: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,622 INFO L290 TraceCheckUtils]: 35: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,622 INFO L290 TraceCheckUtils]: 36: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,623 INFO L290 TraceCheckUtils]: 37: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,623 INFO L290 TraceCheckUtils]: 38: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,624 INFO L290 TraceCheckUtils]: 39: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,624 INFO L290 TraceCheckUtils]: 40: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,624 INFO L290 TraceCheckUtils]: 41: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,625 INFO L290 TraceCheckUtils]: 42: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,625 INFO L290 TraceCheckUtils]: 43: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,626 INFO L290 TraceCheckUtils]: 44: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,626 INFO L290 TraceCheckUtils]: 45: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,627 INFO L290 TraceCheckUtils]: 46: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,627 INFO L290 TraceCheckUtils]: 47: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,628 INFO L290 TraceCheckUtils]: 48: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,628 INFO L290 TraceCheckUtils]: 49: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,628 INFO L290 TraceCheckUtils]: 50: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,629 INFO L290 TraceCheckUtils]: 51: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,629 INFO L290 TraceCheckUtils]: 52: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,630 INFO L290 TraceCheckUtils]: 53: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,630 INFO L290 TraceCheckUtils]: 54: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,631 INFO L290 TraceCheckUtils]: 55: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,631 INFO L290 TraceCheckUtils]: 56: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,631 INFO L290 TraceCheckUtils]: 57: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,632 INFO L290 TraceCheckUtils]: 58: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,632 INFO L290 TraceCheckUtils]: 59: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,633 INFO L290 TraceCheckUtils]: 60: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,633 INFO L290 TraceCheckUtils]: 61: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,634 INFO L290 TraceCheckUtils]: 62: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,634 INFO L290 TraceCheckUtils]: 63: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:12,634 INFO L290 TraceCheckUtils]: 64: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {11020#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-08 15:14:12,635 INFO L290 TraceCheckUtils]: 65: Hoare triple {11020#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {11015#false} is VALID [2022-04-08 15:14:12,635 INFO L290 TraceCheckUtils]: 66: Hoare triple {11015#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {11015#false} is VALID [2022-04-08 15:14:12,635 INFO L290 TraceCheckUtils]: 67: Hoare triple {11015#false} assume 3 == ~blastFlag~0; {11015#false} is VALID [2022-04-08 15:14:12,635 INFO L290 TraceCheckUtils]: 68: Hoare triple {11015#false} assume !false; {11015#false} is VALID [2022-04-08 15:14:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:14:12,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:12,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006408201] [2022-04-08 15:14:12,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006408201] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:12,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:12,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:12,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:12,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1427641258] [2022-04-08 15:14:12,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1427641258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:12,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:12,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:12,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774025772] [2022-04-08 15:14:12,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:12,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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 69 [2022-04-08 15:14:12,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:12,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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:12,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:12,702 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:12,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:12,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:12,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:12,703 INFO L87 Difference]: Start difference. First operand 148 states and 216 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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,728 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:14:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:15,957 INFO L93 Difference]: Finished difference Result 384 states and 578 transitions. [2022-04-08 15:14:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:15,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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 69 [2022-04-08 15:14:15,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-08 15:14:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-08 15:14:15,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 567 transitions. [2022-04-08 15:14:16,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 567 edges. 567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:16,435 INFO L225 Difference]: With dead ends: 384 [2022-04-08 15:14:16,435 INFO L226 Difference]: Without dead ends: 262 [2022-04-08 15:14:16,435 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:14:16,436 INFO L913 BasicCegarLoop]: 107 mSDtfsCounter, 110 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:16,436 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 313 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:14:16,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-04-08 15:14:16,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 191. [2022-04-08 15:14:16,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:16,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 191 states, 186 states have (on average 1.5698924731182795) internal successors, (292), 186 states have internal predecessors, (292), 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:16,443 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 191 states, 186 states have (on average 1.5698924731182795) internal successors, (292), 186 states have internal predecessors, (292), 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:16,464 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 191 states, 186 states have (on average 1.5698924731182795) internal successors, (292), 186 states have internal predecessors, (292), 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:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:16,470 INFO L93 Difference]: Finished difference Result 262 states and 391 transitions. [2022-04-08 15:14:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 391 transitions. [2022-04-08 15:14:16,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:16,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:16,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 186 states have (on average 1.5698924731182795) internal successors, (292), 186 states have internal predecessors, (292), 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 262 states. [2022-04-08 15:14:16,472 INFO L87 Difference]: Start difference. First operand has 191 states, 186 states have (on average 1.5698924731182795) internal successors, (292), 186 states have internal predecessors, (292), 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 262 states. [2022-04-08 15:14:16,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:16,477 INFO L93 Difference]: Finished difference Result 262 states and 391 transitions. [2022-04-08 15:14:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 391 transitions. [2022-04-08 15:14:16,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:16,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:16,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:16,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:16,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.5698924731182795) internal successors, (292), 186 states have internal predecessors, (292), 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:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 296 transitions. [2022-04-08 15:14:16,482 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 296 transitions. Word has length 69 [2022-04-08 15:14:16,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:16,483 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 296 transitions. [2022-04-08 15:14:16,483 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 191 states and 296 transitions. [2022-04-08 15:14:16,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 296 transitions. [2022-04-08 15:14:16,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-08 15:14:16,721 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:16,721 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:14:16,721 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 15:14:16,722 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:16,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:16,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1838419001, now seen corresponding path program 1 times [2022-04-08 15:14:16,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:16,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1994768754] [2022-04-08 15:14:16,760 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:16,761 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:16,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1838419001, now seen corresponding path program 2 times [2022-04-08 15:14:16,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:16,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455100371] [2022-04-08 15:14:16,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:16,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:16,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:16,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {12707#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12700#true} is VALID [2022-04-08 15:14:16,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {12700#true} assume true; {12700#true} is VALID [2022-04-08 15:14:16,925 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12700#true} {12700#true} #661#return; {12700#true} is VALID [2022-04-08 15:14:16,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {12700#true} call ULTIMATE.init(); {12707#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:14:16,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {12707#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12700#true} is VALID [2022-04-08 15:14:16,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {12700#true} assume true; {12700#true} is VALID [2022-04-08 15:14:16,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12700#true} {12700#true} #661#return; {12700#true} is VALID [2022-04-08 15:14:16,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {12700#true} call #t~ret161 := main(); {12700#true} is VALID [2022-04-08 15:14:16,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {12700#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {12700#true} is VALID [2022-04-08 15:14:16,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {12700#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {12700#true} is VALID [2022-04-08 15:14:16,927 INFO L272 TraceCheckUtils]: 7: Hoare triple {12700#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12700#true} is VALID [2022-04-08 15:14:16,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {12700#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {12700#true} is VALID [2022-04-08 15:14:16,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {12700#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {12700#true} is VALID [2022-04-08 15:14:16,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {12700#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {12700#true} is VALID [2022-04-08 15:14:16,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {12700#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12700#true} is VALID [2022-04-08 15:14:16,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {12700#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {12700#true} is VALID [2022-04-08 15:14:16,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {12700#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {12700#true} is VALID [2022-04-08 15:14:16,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {12700#true} assume !false; {12700#true} is VALID [2022-04-08 15:14:16,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {12700#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {12700#true} is VALID [2022-04-08 15:14:16,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {12700#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {12700#true} is VALID [2022-04-08 15:14:16,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {12700#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {12700#true} is VALID [2022-04-08 15:14:16,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {12700#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {12700#true} is VALID [2022-04-08 15:14:16,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {12700#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {12700#true} is VALID [2022-04-08 15:14:16,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {12700#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {12700#true} is VALID [2022-04-08 15:14:16,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {12700#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {12700#true} is VALID [2022-04-08 15:14:16,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {12700#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {12700#true} is VALID [2022-04-08 15:14:16,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {12700#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {12700#true} is VALID [2022-04-08 15:14:16,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {12700#true} assume 8464 == #t~mem55;havoc #t~mem55; {12700#true} is VALID [2022-04-08 15:14:16,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {12700#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {12700#true} is VALID [2022-04-08 15:14:16,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {12700#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {12700#true} is VALID [2022-04-08 15:14:16,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {12700#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:16,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:16,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:16,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:16,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:16,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:16,958 INFO L290 TraceCheckUtils]: 33: Hoare triple {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:16,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:16,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:16,959 INFO L290 TraceCheckUtils]: 36: Hoare triple {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:16,959 INFO L290 TraceCheckUtils]: 37: Hoare triple {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:16,960 INFO L290 TraceCheckUtils]: 38: Hoare triple {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:16,960 INFO L290 TraceCheckUtils]: 39: Hoare triple {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:16,961 INFO L290 TraceCheckUtils]: 40: Hoare triple {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:16,961 INFO L290 TraceCheckUtils]: 41: Hoare triple {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:16,961 INFO L290 TraceCheckUtils]: 42: Hoare triple {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:16,962 INFO L290 TraceCheckUtils]: 43: Hoare triple {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {12706#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-08 15:14:16,962 INFO L290 TraceCheckUtils]: 44: Hoare triple {12706#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,962 INFO L290 TraceCheckUtils]: 45: Hoare triple {12701#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,962 INFO L290 TraceCheckUtils]: 46: Hoare triple {12701#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,962 INFO L290 TraceCheckUtils]: 47: Hoare triple {12701#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,963 INFO L290 TraceCheckUtils]: 48: Hoare triple {12701#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,963 INFO L290 TraceCheckUtils]: 49: Hoare triple {12701#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {12701#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,963 INFO L290 TraceCheckUtils]: 51: Hoare triple {12701#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,963 INFO L290 TraceCheckUtils]: 52: Hoare triple {12701#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,963 INFO L290 TraceCheckUtils]: 53: Hoare triple {12701#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,963 INFO L290 TraceCheckUtils]: 54: Hoare triple {12701#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,963 INFO L290 TraceCheckUtils]: 55: Hoare triple {12701#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,963 INFO L290 TraceCheckUtils]: 56: Hoare triple {12701#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,963 INFO L290 TraceCheckUtils]: 57: Hoare triple {12701#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {12701#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,964 INFO L290 TraceCheckUtils]: 59: Hoare triple {12701#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,964 INFO L290 TraceCheckUtils]: 60: Hoare triple {12701#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,964 INFO L290 TraceCheckUtils]: 61: Hoare triple {12701#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,964 INFO L290 TraceCheckUtils]: 62: Hoare triple {12701#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,964 INFO L290 TraceCheckUtils]: 63: Hoare triple {12701#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,964 INFO L290 TraceCheckUtils]: 64: Hoare triple {12701#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,964 INFO L290 TraceCheckUtils]: 65: Hoare triple {12701#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-08 15:14:16,964 INFO L290 TraceCheckUtils]: 66: Hoare triple {12701#false} assume 8673 == #t~mem80;havoc #t~mem80; {12701#false} is VALID [2022-04-08 15:14:16,964 INFO L290 TraceCheckUtils]: 67: Hoare triple {12701#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {12701#false} is VALID [2022-04-08 15:14:16,965 INFO L290 TraceCheckUtils]: 68: Hoare triple {12701#false} assume 3 == ~blastFlag~0; {12701#false} is VALID [2022-04-08 15:14:16,965 INFO L290 TraceCheckUtils]: 69: Hoare triple {12701#false} assume !false; {12701#false} is VALID [2022-04-08 15:14:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:14:16,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:16,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455100371] [2022-04-08 15:14:16,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455100371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:16,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:16,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:16,966 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:16,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1994768754] [2022-04-08 15:14:16,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1994768754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:16,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:16,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:16,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544631225] [2022-04-08 15:14:16,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:16,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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 70 [2022-04-08 15:14:16,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:16,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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:17,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:17,021 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:17,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:17,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:17,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:17,022 INFO L87 Difference]: Start difference. First operand 191 states and 296 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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:19,046 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:14:20,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:20,016 INFO L93 Difference]: Finished difference Result 400 states and 630 transitions. [2022-04-08 15:14:20,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:20,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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 70 [2022-04-08 15:14:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2022-04-08 15:14:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2022-04-08 15:14:20,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 459 transitions. [2022-04-08 15:14:20,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 459 edges. 459 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:20,331 INFO L225 Difference]: With dead ends: 400 [2022-04-08 15:14:20,331 INFO L226 Difference]: Without dead ends: 235 [2022-04-08 15:14:20,331 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:14:20,332 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 36 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:20,332 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 473 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:14:20,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-08 15:14:20,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 213. [2022-04-08 15:14:20,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:20,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 213 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 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,340 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 213 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 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,341 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 213 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 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,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:20,345 INFO L93 Difference]: Finished difference Result 235 states and 363 transitions. [2022-04-08 15:14:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 363 transitions. [2022-04-08 15:14:20,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:20,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:20,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 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 235 states. [2022-04-08 15:14:20,346 INFO L87 Difference]: Start difference. First operand has 213 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 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 235 states. [2022-04-08 15:14:20,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:20,351 INFO L93 Difference]: Finished difference Result 235 states and 363 transitions. [2022-04-08 15:14:20,351 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 363 transitions. [2022-04-08 15:14:20,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:20,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:20,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:20,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 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,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 334 transitions. [2022-04-08 15:14:20,356 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 334 transitions. Word has length 70 [2022-04-08 15:14:20,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:20,357 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 334 transitions. [2022-04-08 15:14:20,357 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 334 transitions. [2022-04-08 15:14:20,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:20,633 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 334 transitions. [2022-04-08 15:14:20,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-08 15:14:20,634 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:20,634 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:14:20,635 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 15:14:20,635 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:20,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:20,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2025171509, now seen corresponding path program 1 times [2022-04-08 15:14:20,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:20,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [657673825] [2022-04-08 15:14:20,677 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:20,678 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:20,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2025171509, now seen corresponding path program 2 times [2022-04-08 15:14:20,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:20,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028021985] [2022-04-08 15:14:20,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:20,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:20,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:20,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {14415#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14408#true} is VALID [2022-04-08 15:14:20,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {14408#true} assume true; {14408#true} is VALID [2022-04-08 15:14:20,844 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14408#true} {14408#true} #661#return; {14408#true} is VALID [2022-04-08 15:14:20,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {14408#true} call ULTIMATE.init(); {14415#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:14:20,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {14415#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14408#true} is VALID [2022-04-08 15:14:20,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {14408#true} assume true; {14408#true} is VALID [2022-04-08 15:14:20,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14408#true} {14408#true} #661#return; {14408#true} is VALID [2022-04-08 15:14:20,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {14408#true} call #t~ret161 := main(); {14408#true} is VALID [2022-04-08 15:14:20,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {14408#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {14408#true} is VALID [2022-04-08 15:14:20,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {14408#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {14408#true} is VALID [2022-04-08 15:14:20,846 INFO L272 TraceCheckUtils]: 7: Hoare triple {14408#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14408#true} is VALID [2022-04-08 15:14:20,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {14408#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {14408#true} is VALID [2022-04-08 15:14:20,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {14408#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {14408#true} is VALID [2022-04-08 15:14:20,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {14408#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {14408#true} is VALID [2022-04-08 15:14:20,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {14408#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14408#true} is VALID [2022-04-08 15:14:20,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {14408#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {14408#true} is VALID [2022-04-08 15:14:20,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {14408#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {14408#true} is VALID [2022-04-08 15:14:20,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {14408#true} assume !false; {14408#true} is VALID [2022-04-08 15:14:20,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {14408#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14408#true} is VALID [2022-04-08 15:14:20,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {14408#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14408#true} is VALID [2022-04-08 15:14:20,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {14408#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14408#true} is VALID [2022-04-08 15:14:20,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {14408#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14408#true} is VALID [2022-04-08 15:14:20,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {14408#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14408#true} is VALID [2022-04-08 15:14:20,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {14408#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14408#true} is VALID [2022-04-08 15:14:20,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {14408#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14408#true} is VALID [2022-04-08 15:14:20,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {14408#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14408#true} is VALID [2022-04-08 15:14:20,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {14408#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {14408#true} is VALID [2022-04-08 15:14:20,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {14408#true} assume 8464 == #t~mem55;havoc #t~mem55; {14408#true} is VALID [2022-04-08 15:14:20,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {14408#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {14408#true} is VALID [2022-04-08 15:14:20,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {14408#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {14408#true} is VALID [2022-04-08 15:14:20,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {14408#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:20,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:20,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:20,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:20,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:20,851 INFO L290 TraceCheckUtils]: 32: Hoare triple {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:20,851 INFO L290 TraceCheckUtils]: 33: Hoare triple {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:20,852 INFO L290 TraceCheckUtils]: 34: Hoare triple {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:20,852 INFO L290 TraceCheckUtils]: 35: Hoare triple {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:20,852 INFO L290 TraceCheckUtils]: 36: Hoare triple {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:20,853 INFO L290 TraceCheckUtils]: 37: Hoare triple {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14414#(= |ssl3_accept_#t~mem52| 8496)} is VALID [2022-04-08 15:14:20,853 INFO L290 TraceCheckUtils]: 38: Hoare triple {14414#(= |ssl3_accept_#t~mem52| 8496)} assume 8480 == #t~mem52;havoc #t~mem52; {14409#false} is VALID [2022-04-08 15:14:20,853 INFO L290 TraceCheckUtils]: 39: Hoare triple {14409#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {14409#false} is VALID [2022-04-08 15:14:20,853 INFO L290 TraceCheckUtils]: 40: Hoare triple {14409#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,854 INFO L290 TraceCheckUtils]: 41: Hoare triple {14409#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,854 INFO L290 TraceCheckUtils]: 42: Hoare triple {14409#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14409#false} is VALID [2022-04-08 15:14:20,854 INFO L290 TraceCheckUtils]: 43: Hoare triple {14409#false} ~skip~0 := 0; {14409#false} is VALID [2022-04-08 15:14:20,854 INFO L290 TraceCheckUtils]: 44: Hoare triple {14409#false} assume !false; {14409#false} is VALID [2022-04-08 15:14:20,854 INFO L290 TraceCheckUtils]: 45: Hoare triple {14409#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,854 INFO L290 TraceCheckUtils]: 46: Hoare triple {14409#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,854 INFO L290 TraceCheckUtils]: 47: Hoare triple {14409#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,854 INFO L290 TraceCheckUtils]: 48: Hoare triple {14409#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,854 INFO L290 TraceCheckUtils]: 49: Hoare triple {14409#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,854 INFO L290 TraceCheckUtils]: 50: Hoare triple {14409#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,855 INFO L290 TraceCheckUtils]: 51: Hoare triple {14409#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,855 INFO L290 TraceCheckUtils]: 52: Hoare triple {14409#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,862 INFO L290 TraceCheckUtils]: 53: Hoare triple {14409#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,862 INFO L290 TraceCheckUtils]: 54: Hoare triple {14409#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,862 INFO L290 TraceCheckUtils]: 55: Hoare triple {14409#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,862 INFO L290 TraceCheckUtils]: 56: Hoare triple {14409#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,862 INFO L290 TraceCheckUtils]: 57: Hoare triple {14409#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {14409#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,863 INFO L290 TraceCheckUtils]: 59: Hoare triple {14409#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,863 INFO L290 TraceCheckUtils]: 60: Hoare triple {14409#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,863 INFO L290 TraceCheckUtils]: 61: Hoare triple {14409#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,863 INFO L290 TraceCheckUtils]: 62: Hoare triple {14409#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,863 INFO L290 TraceCheckUtils]: 63: Hoare triple {14409#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,863 INFO L290 TraceCheckUtils]: 64: Hoare triple {14409#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,863 INFO L290 TraceCheckUtils]: 65: Hoare triple {14409#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,863 INFO L290 TraceCheckUtils]: 66: Hoare triple {14409#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,863 INFO L290 TraceCheckUtils]: 67: Hoare triple {14409#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,864 INFO L290 TraceCheckUtils]: 68: Hoare triple {14409#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,864 INFO L290 TraceCheckUtils]: 69: Hoare triple {14409#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,864 INFO L290 TraceCheckUtils]: 70: Hoare triple {14409#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,864 INFO L290 TraceCheckUtils]: 71: Hoare triple {14409#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,864 INFO L290 TraceCheckUtils]: 72: Hoare triple {14409#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,864 INFO L290 TraceCheckUtils]: 73: Hoare triple {14409#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,864 INFO L290 TraceCheckUtils]: 74: Hoare triple {14409#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,864 INFO L290 TraceCheckUtils]: 75: Hoare triple {14409#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,864 INFO L290 TraceCheckUtils]: 76: Hoare triple {14409#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,864 INFO L290 TraceCheckUtils]: 77: Hoare triple {14409#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,864 INFO L290 TraceCheckUtils]: 78: Hoare triple {14409#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-08 15:14:20,865 INFO L290 TraceCheckUtils]: 79: Hoare triple {14409#false} assume 8673 == #t~mem80;havoc #t~mem80; {14409#false} is VALID [2022-04-08 15:14:20,865 INFO L290 TraceCheckUtils]: 80: Hoare triple {14409#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {14409#false} is VALID [2022-04-08 15:14:20,865 INFO L290 TraceCheckUtils]: 81: Hoare triple {14409#false} assume 3 == ~blastFlag~0; {14409#false} is VALID [2022-04-08 15:14:20,865 INFO L290 TraceCheckUtils]: 82: Hoare triple {14409#false} assume !false; {14409#false} is VALID [2022-04-08 15:14:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:14:20,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:20,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028021985] [2022-04-08 15:14:20,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028021985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:20,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:20,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:20,866 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:20,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [657673825] [2022-04-08 15:14:20,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [657673825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:20,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:20,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:20,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252527425] [2022-04-08 15:14:20,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:20,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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 83 [2022-04-08 15:14:20,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:20,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:20,967 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:20,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:20,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:20,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:20,968 INFO L87 Difference]: Start difference. First operand 213 states and 334 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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:22,994 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:14:24,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:24,073 INFO L93 Difference]: Finished difference Result 422 states and 667 transitions. [2022-04-08 15:14:24,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:24,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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 83 [2022-04-08 15:14:24,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 458 transitions. [2022-04-08 15:14:24,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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:24,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 458 transitions. [2022-04-08 15:14:24,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 458 transitions. [2022-04-08 15:14:24,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 458 edges. 458 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:24,424 INFO L225 Difference]: With dead ends: 422 [2022-04-08 15:14:24,424 INFO L226 Difference]: Without dead ends: 235 [2022-04-08 15:14:24,425 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:14:24,425 INFO L913 BasicCegarLoop]: 185 mSDtfsCounter, 41 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:24,425 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 473 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:14:24,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-08 15:14:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 213. [2022-04-08 15:14:24,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:24,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 213 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 208 states have internal predecessors, (329), 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:24,433 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 213 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 208 states have internal predecessors, (329), 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:24,434 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 213 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 208 states have internal predecessors, (329), 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:24,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:24,438 INFO L93 Difference]: Finished difference Result 235 states and 362 transitions. [2022-04-08 15:14:24,439 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 362 transitions. [2022-04-08 15:14:24,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:24,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:24,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 208 states have internal predecessors, (329), 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 235 states. [2022-04-08 15:14:24,440 INFO L87 Difference]: Start difference. First operand has 213 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 208 states have internal predecessors, (329), 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 235 states. [2022-04-08 15:14:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:24,445 INFO L93 Difference]: Finished difference Result 235 states and 362 transitions. [2022-04-08 15:14:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 362 transitions. [2022-04-08 15:14:24,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:24,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:24,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:24,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 208 states have internal predecessors, (329), 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:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 333 transitions. [2022-04-08 15:14:24,450 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 333 transitions. Word has length 83 [2022-04-08 15:14:24,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:24,451 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 333 transitions. [2022-04-08 15:14:24,451 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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:24,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 333 transitions. [2022-04-08 15:14:24,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:24,693 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 333 transitions. [2022-04-08 15:14:24,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 15:14:24,695 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:24,695 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 15:14:24,696 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:24,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:24,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1454749477, now seen corresponding path program 1 times [2022-04-08 15:14:24,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:24,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [438192874] [2022-04-08 15:14:24,742 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:24,742 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:24,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1454749477, now seen corresponding path program 2 times [2022-04-08 15:14:24,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:24,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146267428] [2022-04-08 15:14:24,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:24,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:24,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:24,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {16167#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16160#true} is VALID [2022-04-08 15:14:24,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {16160#true} assume true; {16160#true} is VALID [2022-04-08 15:14:24,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16160#true} {16160#true} #661#return; {16160#true} is VALID [2022-04-08 15:14:24,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {16160#true} call ULTIMATE.init(); {16167#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:14:24,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {16167#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16160#true} is VALID [2022-04-08 15:14:24,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {16160#true} assume true; {16160#true} is VALID [2022-04-08 15:14:24,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16160#true} {16160#true} #661#return; {16160#true} is VALID [2022-04-08 15:14:24,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {16160#true} call #t~ret161 := main(); {16160#true} is VALID [2022-04-08 15:14:24,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {16160#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16160#true} is VALID [2022-04-08 15:14:24,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {16160#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {16160#true} is VALID [2022-04-08 15:14:24,891 INFO L272 TraceCheckUtils]: 7: Hoare triple {16160#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16160#true} is VALID [2022-04-08 15:14:24,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {16160#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {16160#true} is VALID [2022-04-08 15:14:24,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {16160#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {16160#true} is VALID [2022-04-08 15:14:24,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {16160#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {16160#true} is VALID [2022-04-08 15:14:24,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {16160#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16160#true} is VALID [2022-04-08 15:14:24,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {16160#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {16160#true} is VALID [2022-04-08 15:14:24,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {16160#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {16160#true} is VALID [2022-04-08 15:14:24,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {16160#true} assume !false; {16160#true} is VALID [2022-04-08 15:14:24,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {16160#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16160#true} is VALID [2022-04-08 15:14:24,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {16160#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16160#true} is VALID [2022-04-08 15:14:24,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {16160#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16160#true} is VALID [2022-04-08 15:14:24,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {16160#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16160#true} is VALID [2022-04-08 15:14:24,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {16160#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {16160#true} is VALID [2022-04-08 15:14:24,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {16160#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {16160#true} is VALID [2022-04-08 15:14:24,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {16160#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16160#true} is VALID [2022-04-08 15:14:24,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {16160#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16160#true} is VALID [2022-04-08 15:14:24,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {16160#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {16160#true} is VALID [2022-04-08 15:14:24,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {16160#true} assume 8464 == #t~mem55;havoc #t~mem55; {16160#true} is VALID [2022-04-08 15:14:24,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {16160#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {16160#true} is VALID [2022-04-08 15:14:24,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {16160#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {16160#true} is VALID [2022-04-08 15:14:24,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {16160#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {16160#true} is VALID [2022-04-08 15:14:24,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {16160#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {16160#true} is VALID [2022-04-08 15:14:24,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {16160#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16160#true} is VALID [2022-04-08 15:14:24,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {16160#true} ~skip~0 := 0; {16160#true} is VALID [2022-04-08 15:14:24,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {16160#true} assume !false; {16160#true} is VALID [2022-04-08 15:14:24,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {16160#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16160#true} is VALID [2022-04-08 15:14:24,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {16160#true} assume 12292 == #t~mem47;havoc #t~mem47; {16160#true} is VALID [2022-04-08 15:14:24,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {16160#true} call write~int(1, ~s.base, 60 + ~s.offset, 4); {16160#true} is VALID [2022-04-08 15:14:24,894 INFO L290 TraceCheckUtils]: 35: Hoare triple {16160#true} call write~int(1, ~s.base, 56 + ~s.offset, 4); {16160#true} is VALID [2022-04-08 15:14:24,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {16160#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {16160#true} is VALID [2022-04-08 15:14:24,894 INFO L290 TraceCheckUtils]: 37: Hoare triple {16160#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {16160#true} is VALID [2022-04-08 15:14:24,894 INFO L290 TraceCheckUtils]: 38: Hoare triple {16160#true} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {16160#true} is VALID [2022-04-08 15:14:24,895 INFO L290 TraceCheckUtils]: 39: Hoare triple {16160#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {16160#true} is VALID [2022-04-08 15:14:24,895 INFO L290 TraceCheckUtils]: 40: Hoare triple {16160#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {16160#true} is VALID [2022-04-08 15:14:24,896 INFO L290 TraceCheckUtils]: 41: Hoare triple {16160#true} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:24,896 INFO L290 TraceCheckUtils]: 42: Hoare triple {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:24,897 INFO L290 TraceCheckUtils]: 43: Hoare triple {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:24,897 INFO L290 TraceCheckUtils]: 44: Hoare triple {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} ~skip~0 := 0; {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:24,897 INFO L290 TraceCheckUtils]: 45: Hoare triple {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !false; {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:24,898 INFO L290 TraceCheckUtils]: 46: Hoare triple {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:24,898 INFO L290 TraceCheckUtils]: 47: Hoare triple {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:24,899 INFO L290 TraceCheckUtils]: 48: Hoare triple {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:24,899 INFO L290 TraceCheckUtils]: 49: Hoare triple {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:24,900 INFO L290 TraceCheckUtils]: 50: Hoare triple {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:24,900 INFO L290 TraceCheckUtils]: 51: Hoare triple {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {16166#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-08 15:14:24,900 INFO L290 TraceCheckUtils]: 52: Hoare triple {16166#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,900 INFO L290 TraceCheckUtils]: 53: Hoare triple {16161#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,900 INFO L290 TraceCheckUtils]: 54: Hoare triple {16161#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,901 INFO L290 TraceCheckUtils]: 55: Hoare triple {16161#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,901 INFO L290 TraceCheckUtils]: 56: Hoare triple {16161#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,901 INFO L290 TraceCheckUtils]: 57: Hoare triple {16161#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,901 INFO L290 TraceCheckUtils]: 58: Hoare triple {16161#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,901 INFO L290 TraceCheckUtils]: 59: Hoare triple {16161#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,901 INFO L290 TraceCheckUtils]: 60: Hoare triple {16161#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,901 INFO L290 TraceCheckUtils]: 61: Hoare triple {16161#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,901 INFO L290 TraceCheckUtils]: 62: Hoare triple {16161#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,901 INFO L290 TraceCheckUtils]: 63: Hoare triple {16161#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,901 INFO L290 TraceCheckUtils]: 64: Hoare triple {16161#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,902 INFO L290 TraceCheckUtils]: 65: Hoare triple {16161#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,902 INFO L290 TraceCheckUtils]: 66: Hoare triple {16161#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,902 INFO L290 TraceCheckUtils]: 67: Hoare triple {16161#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,902 INFO L290 TraceCheckUtils]: 68: Hoare triple {16161#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,902 INFO L290 TraceCheckUtils]: 69: Hoare triple {16161#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,902 INFO L290 TraceCheckUtils]: 70: Hoare triple {16161#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,902 INFO L290 TraceCheckUtils]: 71: Hoare triple {16161#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,902 INFO L290 TraceCheckUtils]: 72: Hoare triple {16161#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,902 INFO L290 TraceCheckUtils]: 73: Hoare triple {16161#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,902 INFO L290 TraceCheckUtils]: 74: Hoare triple {16161#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,903 INFO L290 TraceCheckUtils]: 75: Hoare triple {16161#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,903 INFO L290 TraceCheckUtils]: 76: Hoare triple {16161#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,903 INFO L290 TraceCheckUtils]: 77: Hoare triple {16161#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,903 INFO L290 TraceCheckUtils]: 78: Hoare triple {16161#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,903 INFO L290 TraceCheckUtils]: 79: Hoare triple {16161#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-08 15:14:24,903 INFO L290 TraceCheckUtils]: 80: Hoare triple {16161#false} assume 8673 == #t~mem80;havoc #t~mem80; {16161#false} is VALID [2022-04-08 15:14:24,903 INFO L290 TraceCheckUtils]: 81: Hoare triple {16161#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {16161#false} is VALID [2022-04-08 15:14:24,903 INFO L290 TraceCheckUtils]: 82: Hoare triple {16161#false} assume 3 == ~blastFlag~0; {16161#false} is VALID [2022-04-08 15:14:24,903 INFO L290 TraceCheckUtils]: 83: Hoare triple {16161#false} assume !false; {16161#false} is VALID [2022-04-08 15:14:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 15:14:24,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:24,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146267428] [2022-04-08 15:14:24,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146267428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:24,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:24,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:24,905 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:24,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [438192874] [2022-04-08 15:14:24,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [438192874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:24,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:24,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:24,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881408193] [2022-04-08 15:14:24,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:24,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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 84 [2022-04-08 15:14:24,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:24,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:24,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:24,974 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:24,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:24,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:24,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:24,975 INFO L87 Difference]: Start difference. First operand 213 states and 333 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:27,000 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:14:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:28,070 INFO L93 Difference]: Finished difference Result 429 states and 679 transitions. [2022-04-08 15:14:28,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:28,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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 84 [2022-04-08 15:14:28,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:28,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-08 15:14:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:28,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-08 15:14:28,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 434 transitions. [2022-04-08 15:14:28,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:28,430 INFO L225 Difference]: With dead ends: 429 [2022-04-08 15:14:28,430 INFO L226 Difference]: Without dead ends: 242 [2022-04-08 15:14:28,430 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:14:28,431 INFO L913 BasicCegarLoop]: 222 mSDtfsCounter, 22 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:28,431 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 548 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 388 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:14:28,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-04-08 15:14:28,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 229. [2022-04-08 15:14:28,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:28,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand has 229 states, 224 states have (on average 1.5848214285714286) internal successors, (355), 224 states have internal predecessors, (355), 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:28,439 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand has 229 states, 224 states have (on average 1.5848214285714286) internal successors, (355), 224 states have internal predecessors, (355), 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:28,439 INFO L87 Difference]: Start difference. First operand 242 states. Second operand has 229 states, 224 states have (on average 1.5848214285714286) internal successors, (355), 224 states have internal predecessors, (355), 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:28,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:28,443 INFO L93 Difference]: Finished difference Result 242 states and 375 transitions. [2022-04-08 15:14:28,443 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 375 transitions. [2022-04-08 15:14:28,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:28,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:28,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 224 states have (on average 1.5848214285714286) internal successors, (355), 224 states have internal predecessors, (355), 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 242 states. [2022-04-08 15:14:28,445 INFO L87 Difference]: Start difference. First operand has 229 states, 224 states have (on average 1.5848214285714286) internal successors, (355), 224 states have internal predecessors, (355), 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 242 states. [2022-04-08 15:14:28,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:28,449 INFO L93 Difference]: Finished difference Result 242 states and 375 transitions. [2022-04-08 15:14:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 375 transitions. [2022-04-08 15:14:28,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:28,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:28,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:28,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:28,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.5848214285714286) internal successors, (355), 224 states have internal predecessors, (355), 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:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 359 transitions. [2022-04-08 15:14:28,455 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 359 transitions. Word has length 84 [2022-04-08 15:14:28,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:28,456 INFO L478 AbstractCegarLoop]: Abstraction has 229 states and 359 transitions. [2022-04-08 15:14:28,456 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:28,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 359 transitions. [2022-04-08 15:14:28,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 359 edges. 359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:28,735 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 359 transitions. [2022-04-08 15:14:28,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 15:14:28,736 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:28,736 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:14:28,736 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 15:14:28,736 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:28,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:28,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1354545936, now seen corresponding path program 1 times [2022-04-08 15:14:28,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:28,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [134013459] [2022-04-08 15:14:28,783 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:28,784 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:28,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1354545936, now seen corresponding path program 2 times [2022-04-08 15:14:28,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:28,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463838765] [2022-04-08 15:14:28,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:28,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:28,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:28,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {17979#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {17972#true} is VALID [2022-04-08 15:14:28,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {17972#true} assume true; {17972#true} is VALID [2022-04-08 15:14:28,921 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17972#true} {17972#true} #661#return; {17972#true} is VALID [2022-04-08 15:14:28,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {17972#true} call ULTIMATE.init(); {17979#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:14:28,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {17979#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {17972#true} is VALID [2022-04-08 15:14:28,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {17972#true} assume true; {17972#true} is VALID [2022-04-08 15:14:28,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17972#true} {17972#true} #661#return; {17972#true} is VALID [2022-04-08 15:14:28,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {17972#true} call #t~ret161 := main(); {17972#true} is VALID [2022-04-08 15:14:28,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {17972#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {17972#true} is VALID [2022-04-08 15:14:28,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {17972#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {17972#true} is VALID [2022-04-08 15:14:28,923 INFO L272 TraceCheckUtils]: 7: Hoare triple {17972#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {17972#true} is VALID [2022-04-08 15:14:28,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {17972#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {17972#true} is VALID [2022-04-08 15:14:28,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {17972#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {17972#true} is VALID [2022-04-08 15:14:28,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {17972#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {17972#true} is VALID [2022-04-08 15:14:28,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {17972#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17972#true} is VALID [2022-04-08 15:14:28,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {17972#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {17972#true} is VALID [2022-04-08 15:14:28,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {17972#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {17972#true} is VALID [2022-04-08 15:14:28,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {17972#true} assume !false; {17972#true} is VALID [2022-04-08 15:14:28,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {17972#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {17972#true} is VALID [2022-04-08 15:14:28,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {17972#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17972#true} is VALID [2022-04-08 15:14:28,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {17972#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {17972#true} is VALID [2022-04-08 15:14:28,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {17972#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {17972#true} is VALID [2022-04-08 15:14:28,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {17972#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {17972#true} is VALID [2022-04-08 15:14:28,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {17972#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {17972#true} is VALID [2022-04-08 15:14:28,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {17972#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {17972#true} is VALID [2022-04-08 15:14:28,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {17972#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {17972#true} is VALID [2022-04-08 15:14:28,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {17972#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {17972#true} is VALID [2022-04-08 15:14:28,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {17972#true} assume 8464 == #t~mem55;havoc #t~mem55; {17972#true} is VALID [2022-04-08 15:14:28,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {17972#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {17972#true} is VALID [2022-04-08 15:14:28,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {17972#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {17972#true} is VALID [2022-04-08 15:14:28,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {17972#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:28,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:28,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:28,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:28,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:28,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:28,929 INFO L290 TraceCheckUtils]: 33: Hoare triple {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:28,929 INFO L290 TraceCheckUtils]: 34: Hoare triple {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:28,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:28,930 INFO L290 TraceCheckUtils]: 36: Hoare triple {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:28,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:28,931 INFO L290 TraceCheckUtils]: 38: Hoare triple {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {17978#(= |ssl3_accept_#t~mem53| 8496)} is VALID [2022-04-08 15:14:28,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {17978#(= |ssl3_accept_#t~mem53| 8496)} assume 8481 == #t~mem53;havoc #t~mem53; {17973#false} is VALID [2022-04-08 15:14:28,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {17973#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {17973#false} is VALID [2022-04-08 15:14:28,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {17973#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {17973#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,932 INFO L290 TraceCheckUtils]: 43: Hoare triple {17973#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {17973#false} is VALID [2022-04-08 15:14:28,932 INFO L290 TraceCheckUtils]: 44: Hoare triple {17973#false} ~skip~0 := 0; {17973#false} is VALID [2022-04-08 15:14:28,932 INFO L290 TraceCheckUtils]: 45: Hoare triple {17973#false} assume !false; {17973#false} is VALID [2022-04-08 15:14:28,932 INFO L290 TraceCheckUtils]: 46: Hoare triple {17973#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,932 INFO L290 TraceCheckUtils]: 47: Hoare triple {17973#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,932 INFO L290 TraceCheckUtils]: 48: Hoare triple {17973#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,932 INFO L290 TraceCheckUtils]: 49: Hoare triple {17973#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,932 INFO L290 TraceCheckUtils]: 50: Hoare triple {17973#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,932 INFO L290 TraceCheckUtils]: 51: Hoare triple {17973#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,933 INFO L290 TraceCheckUtils]: 52: Hoare triple {17973#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,933 INFO L290 TraceCheckUtils]: 53: Hoare triple {17973#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,933 INFO L290 TraceCheckUtils]: 54: Hoare triple {17973#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,933 INFO L290 TraceCheckUtils]: 55: Hoare triple {17973#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,933 INFO L290 TraceCheckUtils]: 56: Hoare triple {17973#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,933 INFO L290 TraceCheckUtils]: 57: Hoare triple {17973#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,933 INFO L290 TraceCheckUtils]: 58: Hoare triple {17973#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,933 INFO L290 TraceCheckUtils]: 59: Hoare triple {17973#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,933 INFO L290 TraceCheckUtils]: 60: Hoare triple {17973#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,933 INFO L290 TraceCheckUtils]: 61: Hoare triple {17973#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,934 INFO L290 TraceCheckUtils]: 62: Hoare triple {17973#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,934 INFO L290 TraceCheckUtils]: 63: Hoare triple {17973#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,934 INFO L290 TraceCheckUtils]: 64: Hoare triple {17973#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,934 INFO L290 TraceCheckUtils]: 65: Hoare triple {17973#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,934 INFO L290 TraceCheckUtils]: 66: Hoare triple {17973#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,934 INFO L290 TraceCheckUtils]: 67: Hoare triple {17973#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,934 INFO L290 TraceCheckUtils]: 68: Hoare triple {17973#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,934 INFO L290 TraceCheckUtils]: 69: Hoare triple {17973#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,934 INFO L290 TraceCheckUtils]: 70: Hoare triple {17973#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,934 INFO L290 TraceCheckUtils]: 71: Hoare triple {17973#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,935 INFO L290 TraceCheckUtils]: 72: Hoare triple {17973#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,935 INFO L290 TraceCheckUtils]: 73: Hoare triple {17973#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,935 INFO L290 TraceCheckUtils]: 74: Hoare triple {17973#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,935 INFO L290 TraceCheckUtils]: 75: Hoare triple {17973#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,935 INFO L290 TraceCheckUtils]: 76: Hoare triple {17973#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,935 INFO L290 TraceCheckUtils]: 77: Hoare triple {17973#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,935 INFO L290 TraceCheckUtils]: 78: Hoare triple {17973#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,935 INFO L290 TraceCheckUtils]: 79: Hoare triple {17973#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-08 15:14:28,935 INFO L290 TraceCheckUtils]: 80: Hoare triple {17973#false} assume 8673 == #t~mem80;havoc #t~mem80; {17973#false} is VALID [2022-04-08 15:14:28,935 INFO L290 TraceCheckUtils]: 81: Hoare triple {17973#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {17973#false} is VALID [2022-04-08 15:14:28,936 INFO L290 TraceCheckUtils]: 82: Hoare triple {17973#false} assume 3 == ~blastFlag~0; {17973#false} is VALID [2022-04-08 15:14:28,936 INFO L290 TraceCheckUtils]: 83: Hoare triple {17973#false} assume !false; {17973#false} is VALID [2022-04-08 15:14:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:14:28,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:28,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463838765] [2022-04-08 15:14:28,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463838765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:28,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:28,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:28,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:28,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [134013459] [2022-04-08 15:14:28,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [134013459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:28,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:28,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:28,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10506805] [2022-04-08 15:14:28,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:28,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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 84 [2022-04-08 15:14:28,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:28,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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:28,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:28,998 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:28,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:28,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:28,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:28,999 INFO L87 Difference]: Start difference. First operand 229 states and 359 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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:31,018 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:14:31,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:31,944 INFO L93 Difference]: Finished difference Result 452 states and 715 transitions. [2022-04-08 15:14:31,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:31,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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 84 [2022-04-08 15:14:31,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-04-08 15:14:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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:31,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-04-08 15:14:31,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 455 transitions. [2022-04-08 15:14:32,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:32,324 INFO L225 Difference]: With dead ends: 452 [2022-04-08 15:14:32,324 INFO L226 Difference]: Without dead ends: 249 [2022-04-08 15:14:32,324 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:14:32,325 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 39 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:32,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 477 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 379 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:14:32,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-08 15:14:32,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 229. [2022-04-08 15:14:32,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:32,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 229 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 224 states have internal predecessors, (354), 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:32,333 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 229 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 224 states have internal predecessors, (354), 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:32,334 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 229 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 224 states have internal predecessors, (354), 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:32,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:32,338 INFO L93 Difference]: Finished difference Result 249 states and 385 transitions. [2022-04-08 15:14:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 385 transitions. [2022-04-08 15:14:32,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:32,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:32,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 224 states have internal predecessors, (354), 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 249 states. [2022-04-08 15:14:32,340 INFO L87 Difference]: Start difference. First operand has 229 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 224 states have internal predecessors, (354), 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 249 states. [2022-04-08 15:14:32,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:32,344 INFO L93 Difference]: Finished difference Result 249 states and 385 transitions. [2022-04-08 15:14:32,345 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 385 transitions. [2022-04-08 15:14:32,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:32,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:32,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:32,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 224 states have internal predecessors, (354), 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:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 358 transitions. [2022-04-08 15:14:32,376 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 358 transitions. Word has length 84 [2022-04-08 15:14:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:32,376 INFO L478 AbstractCegarLoop]: Abstraction has 229 states and 358 transitions. [2022-04-08 15:14:32,376 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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:32,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 358 transitions. [2022-04-08 15:14:32,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:32,627 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 358 transitions. [2022-04-08 15:14:32,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 15:14:32,628 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:32,628 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,628 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 15:14:32,629 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:32,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:32,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1280749327, now seen corresponding path program 1 times [2022-04-08 15:14:32,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:32,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [658166452] [2022-04-08 15:14:32,673 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:32,673 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:32,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1280749327, now seen corresponding path program 2 times [2022-04-08 15:14:32,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:32,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178113561] [2022-04-08 15:14:32,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:32,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:32,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:32,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {19851#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19844#true} is VALID [2022-04-08 15:14:32,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {19844#true} assume true; {19844#true} is VALID [2022-04-08 15:14:32,796 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19844#true} {19844#true} #661#return; {19844#true} is VALID [2022-04-08 15:14:32,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {19844#true} call ULTIMATE.init(); {19851#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:14:32,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {19851#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19844#true} is VALID [2022-04-08 15:14:32,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {19844#true} assume true; {19844#true} is VALID [2022-04-08 15:14:32,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19844#true} {19844#true} #661#return; {19844#true} is VALID [2022-04-08 15:14:32,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {19844#true} call #t~ret161 := main(); {19844#true} is VALID [2022-04-08 15:14:32,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {19844#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {19844#true} is VALID [2022-04-08 15:14:32,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {19844#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {19844#true} is VALID [2022-04-08 15:14:32,797 INFO L272 TraceCheckUtils]: 7: Hoare triple {19844#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19844#true} is VALID [2022-04-08 15:14:32,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {19844#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {19844#true} is VALID [2022-04-08 15:14:32,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {19844#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {19844#true} is VALID [2022-04-08 15:14:32,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {19844#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {19844#true} is VALID [2022-04-08 15:14:32,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {19844#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {19844#true} is VALID [2022-04-08 15:14:32,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {19844#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {19844#true} is VALID [2022-04-08 15:14:32,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {19844#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {19844#true} is VALID [2022-04-08 15:14:32,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {19844#true} assume !false; {19844#true} is VALID [2022-04-08 15:14:32,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {19844#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {19844#true} is VALID [2022-04-08 15:14:32,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {19844#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19844#true} is VALID [2022-04-08 15:14:32,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {19844#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {19844#true} is VALID [2022-04-08 15:14:32,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {19844#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {19844#true} is VALID [2022-04-08 15:14:32,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {19844#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {19844#true} is VALID [2022-04-08 15:14:32,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {19844#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {19844#true} is VALID [2022-04-08 15:14:32,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {19844#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {19844#true} is VALID [2022-04-08 15:14:32,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {19844#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {19844#true} is VALID [2022-04-08 15:14:32,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {19844#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {19844#true} is VALID [2022-04-08 15:14:32,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {19844#true} assume 8464 == #t~mem55;havoc #t~mem55; {19844#true} is VALID [2022-04-08 15:14:32,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {19844#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {19844#true} is VALID [2022-04-08 15:14:32,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {19844#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {19844#true} is VALID [2022-04-08 15:14:32,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {19844#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:32,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:32,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:32,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:32,802 INFO L290 TraceCheckUtils]: 31: Hoare triple {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:32,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:32,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:32,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:32,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:32,804 INFO L290 TraceCheckUtils]: 36: Hoare triple {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:32,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:32,805 INFO L290 TraceCheckUtils]: 38: Hoare triple {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:32,805 INFO L290 TraceCheckUtils]: 39: Hoare triple {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {19850#(= |ssl3_accept_#t~mem54| 8496)} is VALID [2022-04-08 15:14:32,806 INFO L290 TraceCheckUtils]: 40: Hoare triple {19850#(= |ssl3_accept_#t~mem54| 8496)} assume 8482 == #t~mem54;havoc #t~mem54; {19845#false} is VALID [2022-04-08 15:14:32,806 INFO L290 TraceCheckUtils]: 41: Hoare triple {19845#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,806 INFO L290 TraceCheckUtils]: 42: Hoare triple {19845#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,806 INFO L290 TraceCheckUtils]: 43: Hoare triple {19845#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {19845#false} is VALID [2022-04-08 15:14:32,806 INFO L290 TraceCheckUtils]: 44: Hoare triple {19845#false} ~skip~0 := 0; {19845#false} is VALID [2022-04-08 15:14:32,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {19845#false} assume !false; {19845#false} is VALID [2022-04-08 15:14:32,806 INFO L290 TraceCheckUtils]: 46: Hoare triple {19845#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,806 INFO L290 TraceCheckUtils]: 47: Hoare triple {19845#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,806 INFO L290 TraceCheckUtils]: 48: Hoare triple {19845#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,807 INFO L290 TraceCheckUtils]: 49: Hoare triple {19845#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,807 INFO L290 TraceCheckUtils]: 50: Hoare triple {19845#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,807 INFO L290 TraceCheckUtils]: 51: Hoare triple {19845#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,807 INFO L290 TraceCheckUtils]: 52: Hoare triple {19845#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,807 INFO L290 TraceCheckUtils]: 53: Hoare triple {19845#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,807 INFO L290 TraceCheckUtils]: 54: Hoare triple {19845#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,807 INFO L290 TraceCheckUtils]: 55: Hoare triple {19845#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,807 INFO L290 TraceCheckUtils]: 56: Hoare triple {19845#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,808 INFO L290 TraceCheckUtils]: 57: Hoare triple {19845#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,808 INFO L290 TraceCheckUtils]: 58: Hoare triple {19845#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,808 INFO L290 TraceCheckUtils]: 59: Hoare triple {19845#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,808 INFO L290 TraceCheckUtils]: 60: Hoare triple {19845#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,808 INFO L290 TraceCheckUtils]: 61: Hoare triple {19845#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,808 INFO L290 TraceCheckUtils]: 62: Hoare triple {19845#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,808 INFO L290 TraceCheckUtils]: 63: Hoare triple {19845#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,808 INFO L290 TraceCheckUtils]: 64: Hoare triple {19845#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,808 INFO L290 TraceCheckUtils]: 65: Hoare triple {19845#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,809 INFO L290 TraceCheckUtils]: 66: Hoare triple {19845#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,809 INFO L290 TraceCheckUtils]: 67: Hoare triple {19845#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,809 INFO L290 TraceCheckUtils]: 68: Hoare triple {19845#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,809 INFO L290 TraceCheckUtils]: 69: Hoare triple {19845#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,809 INFO L290 TraceCheckUtils]: 70: Hoare triple {19845#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,809 INFO L290 TraceCheckUtils]: 71: Hoare triple {19845#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,809 INFO L290 TraceCheckUtils]: 72: Hoare triple {19845#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,809 INFO L290 TraceCheckUtils]: 73: Hoare triple {19845#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,809 INFO L290 TraceCheckUtils]: 74: Hoare triple {19845#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,809 INFO L290 TraceCheckUtils]: 75: Hoare triple {19845#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,810 INFO L290 TraceCheckUtils]: 76: Hoare triple {19845#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,810 INFO L290 TraceCheckUtils]: 77: Hoare triple {19845#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,810 INFO L290 TraceCheckUtils]: 78: Hoare triple {19845#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,810 INFO L290 TraceCheckUtils]: 79: Hoare triple {19845#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-08 15:14:32,810 INFO L290 TraceCheckUtils]: 80: Hoare triple {19845#false} assume 8673 == #t~mem80;havoc #t~mem80; {19845#false} is VALID [2022-04-08 15:14:32,810 INFO L290 TraceCheckUtils]: 81: Hoare triple {19845#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {19845#false} is VALID [2022-04-08 15:14:32,810 INFO L290 TraceCheckUtils]: 82: Hoare triple {19845#false} assume 3 == ~blastFlag~0; {19845#false} is VALID [2022-04-08 15:14:32,810 INFO L290 TraceCheckUtils]: 83: Hoare triple {19845#false} assume !false; {19845#false} is VALID [2022-04-08 15:14:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:14:32,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:32,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178113561] [2022-04-08 15:14:32,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178113561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:32,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:32,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:32,811 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:32,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [658166452] [2022-04-08 15:14:32,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [658166452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:32,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:32,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:32,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437235366] [2022-04-08 15:14:32,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:32,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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 84 [2022-04-08 15:14:32,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:32,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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:32,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:32,876 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:32,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:32,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:32,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:32,877 INFO L87 Difference]: Start difference. First operand 229 states and 358 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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:34,905 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:35,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:35,934 INFO L93 Difference]: Finished difference Result 451 states and 712 transitions. [2022-04-08 15:14:35,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:35,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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 84 [2022-04-08 15:14:35,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:35,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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:35,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-08 15:14:35,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-08 15:14:35,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 453 transitions. [2022-04-08 15:14:36,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:36,345 INFO L225 Difference]: With dead ends: 451 [2022-04-08 15:14:36,345 INFO L226 Difference]: Without dead ends: 248 [2022-04-08 15:14:36,345 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:14:36,346 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 37 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:36,346 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 479 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 377 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:14:36,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-04-08 15:14:36,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 229. [2022-04-08 15:14:36,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:36,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand has 229 states, 224 states have (on average 1.5758928571428572) internal successors, (353), 224 states have internal predecessors, (353), 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:36,353 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand has 229 states, 224 states have (on average 1.5758928571428572) internal successors, (353), 224 states have internal predecessors, (353), 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:36,353 INFO L87 Difference]: Start difference. First operand 248 states. Second operand has 229 states, 224 states have (on average 1.5758928571428572) internal successors, (353), 224 states have internal predecessors, (353), 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:36,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:36,358 INFO L93 Difference]: Finished difference Result 248 states and 383 transitions. [2022-04-08 15:14:36,358 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 383 transitions. [2022-04-08 15:14:36,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:36,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:36,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 224 states have (on average 1.5758928571428572) internal successors, (353), 224 states have internal predecessors, (353), 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 248 states. [2022-04-08 15:14:36,360 INFO L87 Difference]: Start difference. First operand has 229 states, 224 states have (on average 1.5758928571428572) internal successors, (353), 224 states have internal predecessors, (353), 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 248 states. [2022-04-08 15:14:36,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:36,366 INFO L93 Difference]: Finished difference Result 248 states and 383 transitions. [2022-04-08 15:14:36,366 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 383 transitions. [2022-04-08 15:14:36,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:36,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:36,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:36,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:36,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.5758928571428572) internal successors, (353), 224 states have internal predecessors, (353), 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:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 357 transitions. [2022-04-08 15:14:36,372 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 357 transitions. Word has length 84 [2022-04-08 15:14:36,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:36,372 INFO L478 AbstractCegarLoop]: Abstraction has 229 states and 357 transitions. [2022-04-08 15:14:36,372 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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:36,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 357 transitions. [2022-04-08 15:14:36,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 357 edges. 357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:36,654 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 357 transitions. [2022-04-08 15:14:36,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-08 15:14:36,654 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:36,654 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,655 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 15:14:36,655 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:36,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:36,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1669457340, now seen corresponding path program 1 times [2022-04-08 15:14:36,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:36,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1525960595] [2022-04-08 15:14:36,697 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:36,697 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:36,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1669457340, now seen corresponding path program 2 times [2022-04-08 15:14:36,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:36,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986851916] [2022-04-08 15:14:36,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:36,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:36,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:36,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {21720#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {21712#true} is VALID [2022-04-08 15:14:36,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {21712#true} assume true; {21712#true} is VALID [2022-04-08 15:14:36,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21712#true} {21712#true} #661#return; {21712#true} is VALID [2022-04-08 15:14:36,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {21712#true} call ULTIMATE.init(); {21720#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:14:36,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {21720#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {21712#true} is VALID [2022-04-08 15:14:36,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {21712#true} assume true; {21712#true} is VALID [2022-04-08 15:14:36,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21712#true} {21712#true} #661#return; {21712#true} is VALID [2022-04-08 15:14:36,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {21712#true} call #t~ret161 := main(); {21712#true} is VALID [2022-04-08 15:14:36,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {21712#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {21712#true} is VALID [2022-04-08 15:14:36,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {21712#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {21712#true} is VALID [2022-04-08 15:14:36,844 INFO L272 TraceCheckUtils]: 7: Hoare triple {21712#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {21712#true} is VALID [2022-04-08 15:14:36,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {21712#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {21712#true} is VALID [2022-04-08 15:14:36,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {21712#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {21712#true} is VALID [2022-04-08 15:14:36,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {21712#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {21712#true} is VALID [2022-04-08 15:14:36,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {21712#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21712#true} is VALID [2022-04-08 15:14:36,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {21712#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {21712#true} is VALID [2022-04-08 15:14:36,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {21712#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {21712#true} is VALID [2022-04-08 15:14:36,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {21712#true} assume !false; {21712#true} is VALID [2022-04-08 15:14:36,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {21712#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {21712#true} is VALID [2022-04-08 15:14:36,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {21712#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {21712#true} is VALID [2022-04-08 15:14:36,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {21712#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21712#true} is VALID [2022-04-08 15:14:36,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {21712#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21712#true} is VALID [2022-04-08 15:14:36,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {21712#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21712#true} is VALID [2022-04-08 15:14:36,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {21712#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21712#true} is VALID [2022-04-08 15:14:36,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {21712#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21712#true} is VALID [2022-04-08 15:14:36,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {21712#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21712#true} is VALID [2022-04-08 15:14:36,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {21712#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21712#true} is VALID [2022-04-08 15:14:36,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {21712#true} assume 8464 == #t~mem55;havoc #t~mem55; {21712#true} is VALID [2022-04-08 15:14:36,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {21712#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21712#true} is VALID [2022-04-08 15:14:36,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {21712#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21712#true} is VALID [2022-04-08 15:14:36,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {21712#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {21712#true} is VALID [2022-04-08 15:14:36,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {21712#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {21712#true} is VALID [2022-04-08 15:14:36,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {21712#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21712#true} is VALID [2022-04-08 15:14:36,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {21712#true} ~skip~0 := 0; {21712#true} is VALID [2022-04-08 15:14:36,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {21712#true} assume !false; {21712#true} is VALID [2022-04-08 15:14:36,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {21712#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {21717#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:36,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {21717#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 12292 == #t~mem47;havoc #t~mem47; {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:36,848 INFO L290 TraceCheckUtils]: 34: Hoare triple {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(1, ~s.base, 60 + ~s.offset, 4); {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:36,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(1, ~s.base, 56 + ~s.offset, 4); {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:36,849 INFO L290 TraceCheckUtils]: 36: Hoare triple {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:36,849 INFO L290 TraceCheckUtils]: 37: Hoare triple {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:36,850 INFO L290 TraceCheckUtils]: 38: Hoare triple {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:36,851 INFO L290 TraceCheckUtils]: 39: Hoare triple {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:36,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {21719#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-08 15:14:36,852 INFO L290 TraceCheckUtils]: 41: Hoare triple {21719#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {21713#false} is VALID [2022-04-08 15:14:36,852 INFO L290 TraceCheckUtils]: 42: Hoare triple {21713#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem87 := read~int(#t~mem86.base, 128 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 128 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {21713#false} is VALID [2022-04-08 15:14:36,852 INFO L290 TraceCheckUtils]: 43: Hoare triple {21713#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,852 INFO L290 TraceCheckUtils]: 44: Hoare triple {21713#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21713#false} is VALID [2022-04-08 15:14:36,853 INFO L290 TraceCheckUtils]: 45: Hoare triple {21713#false} ~skip~0 := 0; {21713#false} is VALID [2022-04-08 15:14:36,853 INFO L290 TraceCheckUtils]: 46: Hoare triple {21713#false} assume !false; {21713#false} is VALID [2022-04-08 15:14:36,853 INFO L290 TraceCheckUtils]: 47: Hoare triple {21713#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,853 INFO L290 TraceCheckUtils]: 48: Hoare triple {21713#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {21713#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,853 INFO L290 TraceCheckUtils]: 50: Hoare triple {21713#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,853 INFO L290 TraceCheckUtils]: 51: Hoare triple {21713#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,853 INFO L290 TraceCheckUtils]: 52: Hoare triple {21713#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,853 INFO L290 TraceCheckUtils]: 53: Hoare triple {21713#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,854 INFO L290 TraceCheckUtils]: 54: Hoare triple {21713#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,854 INFO L290 TraceCheckUtils]: 55: Hoare triple {21713#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,854 INFO L290 TraceCheckUtils]: 56: Hoare triple {21713#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,854 INFO L290 TraceCheckUtils]: 57: Hoare triple {21713#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,854 INFO L290 TraceCheckUtils]: 58: Hoare triple {21713#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,854 INFO L290 TraceCheckUtils]: 59: Hoare triple {21713#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,854 INFO L290 TraceCheckUtils]: 60: Hoare triple {21713#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {21713#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,854 INFO L290 TraceCheckUtils]: 62: Hoare triple {21713#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,854 INFO L290 TraceCheckUtils]: 63: Hoare triple {21713#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,855 INFO L290 TraceCheckUtils]: 64: Hoare triple {21713#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,855 INFO L290 TraceCheckUtils]: 65: Hoare triple {21713#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,855 INFO L290 TraceCheckUtils]: 66: Hoare triple {21713#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,855 INFO L290 TraceCheckUtils]: 67: Hoare triple {21713#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,855 INFO L290 TraceCheckUtils]: 68: Hoare triple {21713#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,855 INFO L290 TraceCheckUtils]: 69: Hoare triple {21713#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,855 INFO L290 TraceCheckUtils]: 70: Hoare triple {21713#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,855 INFO L290 TraceCheckUtils]: 71: Hoare triple {21713#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,855 INFO L290 TraceCheckUtils]: 72: Hoare triple {21713#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,856 INFO L290 TraceCheckUtils]: 73: Hoare triple {21713#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,856 INFO L290 TraceCheckUtils]: 74: Hoare triple {21713#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,856 INFO L290 TraceCheckUtils]: 75: Hoare triple {21713#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,856 INFO L290 TraceCheckUtils]: 76: Hoare triple {21713#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,856 INFO L290 TraceCheckUtils]: 77: Hoare triple {21713#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,856 INFO L290 TraceCheckUtils]: 78: Hoare triple {21713#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,856 INFO L290 TraceCheckUtils]: 79: Hoare triple {21713#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,856 INFO L290 TraceCheckUtils]: 80: Hoare triple {21713#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-08 15:14:36,856 INFO L290 TraceCheckUtils]: 81: Hoare triple {21713#false} assume 8673 == #t~mem80;havoc #t~mem80; {21713#false} is VALID [2022-04-08 15:14:36,856 INFO L290 TraceCheckUtils]: 82: Hoare triple {21713#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {21713#false} is VALID [2022-04-08 15:14:36,856 INFO L290 TraceCheckUtils]: 83: Hoare triple {21713#false} assume 3 == ~blastFlag~0; {21713#false} is VALID [2022-04-08 15:14:36,857 INFO L290 TraceCheckUtils]: 84: Hoare triple {21713#false} assume !false; {21713#false} is VALID [2022-04-08 15:14:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 15:14:36,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:36,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986851916] [2022-04-08 15:14:36,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986851916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:36,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:36,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 15:14:36,858 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:36,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1525960595] [2022-04-08 15:14:36,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1525960595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:36,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:36,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 15:14:36,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271360798] [2022-04-08 15:14:36,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:36,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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 85 [2022-04-08 15:14:36,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:36,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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:36,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:36,932 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 15:14:36,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:36,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 15:14:36,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:14:36,933 INFO L87 Difference]: Start difference. First operand 229 states and 357 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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:38,963 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:14:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:39,987 INFO L93 Difference]: Finished difference Result 441 states and 696 transitions. [2022-04-08 15:14:39,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 15:14:39,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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 85 [2022-04-08 15:14:39,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:39,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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:39,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2022-04-08 15:14:39,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2022-04-08 15:14:39,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 403 transitions. [2022-04-08 15:14:40,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 403 edges. 403 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:40,284 INFO L225 Difference]: With dead ends: 441 [2022-04-08 15:14:40,284 INFO L226 Difference]: Without dead ends: 238 [2022-04-08 15:14:40,285 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 15:14:40,286 INFO L913 BasicCegarLoop]: 193 mSDtfsCounter, 3 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:40,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 593 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 421 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:14:40,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-04-08 15:14:40,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2022-04-08 15:14:40,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:40,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 238 states, 233 states have (on average 1.5622317596566524) internal successors, (364), 233 states have internal predecessors, (364), 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:40,294 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 238 states, 233 states have (on average 1.5622317596566524) internal successors, (364), 233 states have internal predecessors, (364), 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:40,295 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 238 states, 233 states have (on average 1.5622317596566524) internal successors, (364), 233 states have internal predecessors, (364), 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:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:40,299 INFO L93 Difference]: Finished difference Result 238 states and 368 transitions. [2022-04-08 15:14:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 368 transitions. [2022-04-08 15:14:40,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:40,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:40,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 238 states, 233 states have (on average 1.5622317596566524) internal successors, (364), 233 states have internal predecessors, (364), 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 238 states. [2022-04-08 15:14:40,300 INFO L87 Difference]: Start difference. First operand has 238 states, 233 states have (on average 1.5622317596566524) internal successors, (364), 233 states have internal predecessors, (364), 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 238 states. [2022-04-08 15:14:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:40,304 INFO L93 Difference]: Finished difference Result 238 states and 368 transitions. [2022-04-08 15:14:40,305 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 368 transitions. [2022-04-08 15:14:40,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:40,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:40,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:40,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 233 states have (on average 1.5622317596566524) internal successors, (364), 233 states have internal predecessors, (364), 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:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 368 transitions. [2022-04-08 15:14:40,310 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 368 transitions. Word has length 85 [2022-04-08 15:14:40,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:40,310 INFO L478 AbstractCegarLoop]: Abstraction has 238 states and 368 transitions. [2022-04-08 15:14:40,311 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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:40,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 368 transitions. [2022-04-08 15:14:40,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 368 edges. 368 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 368 transitions. [2022-04-08 15:14:40,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-08 15:14:40,620 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:40,620 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,620 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 15:14:40,621 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:40,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:40,621 INFO L85 PathProgramCache]: Analyzing trace with hash 500010200, now seen corresponding path program 1 times [2022-04-08 15:14:40,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:40,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1384644492] [2022-04-08 15:14:40,657 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:40,657 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:40,657 INFO L85 PathProgramCache]: Analyzing trace with hash 500010200, now seen corresponding path program 2 times [2022-04-08 15:14:40,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:40,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021968207] [2022-04-08 15:14:40,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:40,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:40,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:40,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {23566#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23559#true} is VALID [2022-04-08 15:14:40,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {23559#true} assume true; {23559#true} is VALID [2022-04-08 15:14:40,792 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23559#true} {23559#true} #661#return; {23559#true} is VALID [2022-04-08 15:14:40,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {23559#true} call ULTIMATE.init(); {23566#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:14:40,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {23566#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23559#true} is VALID [2022-04-08 15:14:40,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {23559#true} assume true; {23559#true} is VALID [2022-04-08 15:14:40,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23559#true} {23559#true} #661#return; {23559#true} is VALID [2022-04-08 15:14:40,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {23559#true} call #t~ret161 := main(); {23559#true} is VALID [2022-04-08 15:14:40,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {23559#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {23559#true} is VALID [2022-04-08 15:14:40,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {23559#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {23559#true} is VALID [2022-04-08 15:14:40,793 INFO L272 TraceCheckUtils]: 7: Hoare triple {23559#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23559#true} is VALID [2022-04-08 15:14:40,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {23559#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {23559#true} is VALID [2022-04-08 15:14:40,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {23559#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {23559#true} is VALID [2022-04-08 15:14:40,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {23559#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {23559#true} is VALID [2022-04-08 15:14:40,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {23559#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23559#true} is VALID [2022-04-08 15:14:40,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {23559#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {23559#true} is VALID [2022-04-08 15:14:40,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {23559#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {23559#true} is VALID [2022-04-08 15:14:40,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {23559#true} assume !false; {23559#true} is VALID [2022-04-08 15:14:40,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {23559#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23559#true} is VALID [2022-04-08 15:14:40,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {23559#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23559#true} is VALID [2022-04-08 15:14:40,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {23559#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23559#true} is VALID [2022-04-08 15:14:40,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {23559#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23559#true} is VALID [2022-04-08 15:14:40,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {23559#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23559#true} is VALID [2022-04-08 15:14:40,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {23559#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23559#true} is VALID [2022-04-08 15:14:40,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {23559#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23559#true} is VALID [2022-04-08 15:14:40,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {23559#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23559#true} is VALID [2022-04-08 15:14:40,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {23559#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23559#true} is VALID [2022-04-08 15:14:40,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {23559#true} assume 8464 == #t~mem55;havoc #t~mem55; {23559#true} is VALID [2022-04-08 15:14:40,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {23559#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {23559#true} is VALID [2022-04-08 15:14:40,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {23559#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {23559#true} is VALID [2022-04-08 15:14:40,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {23559#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:14:40,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:14:40,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:14:40,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} ~skip~0 := 0; {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:14:40,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !false; {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:14:40,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:14:40,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23565#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-08 15:14:40,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {23565#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {23560#false} is VALID [2022-04-08 15:14:40,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {23560#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {23560#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {23560#false} is VALID [2022-04-08 15:14:40,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {23560#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {23560#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {23560#false} is VALID [2022-04-08 15:14:40,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {23560#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {23560#false} is VALID [2022-04-08 15:14:40,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {23560#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {23560#false} assume 12292 != #t~mem85;havoc #t~mem85; {23560#false} is VALID [2022-04-08 15:14:40,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {23560#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem87 := read~int(#t~mem86.base, 128 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 128 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {23560#false} is VALID [2022-04-08 15:14:40,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {23560#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {23560#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23560#false} is VALID [2022-04-08 15:14:40,800 INFO L290 TraceCheckUtils]: 45: Hoare triple {23560#false} ~skip~0 := 0; {23560#false} is VALID [2022-04-08 15:14:40,800 INFO L290 TraceCheckUtils]: 46: Hoare triple {23560#false} assume !false; {23560#false} is VALID [2022-04-08 15:14:40,801 INFO L290 TraceCheckUtils]: 47: Hoare triple {23560#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,801 INFO L290 TraceCheckUtils]: 48: Hoare triple {23560#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {23560#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {23560#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,801 INFO L290 TraceCheckUtils]: 51: Hoare triple {23560#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,801 INFO L290 TraceCheckUtils]: 52: Hoare triple {23560#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,801 INFO L290 TraceCheckUtils]: 53: Hoare triple {23560#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,801 INFO L290 TraceCheckUtils]: 54: Hoare triple {23560#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,801 INFO L290 TraceCheckUtils]: 55: Hoare triple {23560#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,801 INFO L290 TraceCheckUtils]: 56: Hoare triple {23560#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,802 INFO L290 TraceCheckUtils]: 57: Hoare triple {23560#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,802 INFO L290 TraceCheckUtils]: 58: Hoare triple {23560#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,802 INFO L290 TraceCheckUtils]: 59: Hoare triple {23560#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,802 INFO L290 TraceCheckUtils]: 60: Hoare triple {23560#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,802 INFO L290 TraceCheckUtils]: 61: Hoare triple {23560#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,802 INFO L290 TraceCheckUtils]: 62: Hoare triple {23560#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,802 INFO L290 TraceCheckUtils]: 63: Hoare triple {23560#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,802 INFO L290 TraceCheckUtils]: 64: Hoare triple {23560#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,802 INFO L290 TraceCheckUtils]: 65: Hoare triple {23560#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,802 INFO L290 TraceCheckUtils]: 66: Hoare triple {23560#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,803 INFO L290 TraceCheckUtils]: 67: Hoare triple {23560#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,803 INFO L290 TraceCheckUtils]: 68: Hoare triple {23560#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,803 INFO L290 TraceCheckUtils]: 69: Hoare triple {23560#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,803 INFO L290 TraceCheckUtils]: 70: Hoare triple {23560#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,803 INFO L290 TraceCheckUtils]: 71: Hoare triple {23560#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,803 INFO L290 TraceCheckUtils]: 72: Hoare triple {23560#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,803 INFO L290 TraceCheckUtils]: 73: Hoare triple {23560#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,803 INFO L290 TraceCheckUtils]: 74: Hoare triple {23560#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,803 INFO L290 TraceCheckUtils]: 75: Hoare triple {23560#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,803 INFO L290 TraceCheckUtils]: 76: Hoare triple {23560#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,804 INFO L290 TraceCheckUtils]: 77: Hoare triple {23560#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,804 INFO L290 TraceCheckUtils]: 78: Hoare triple {23560#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,804 INFO L290 TraceCheckUtils]: 79: Hoare triple {23560#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,804 INFO L290 TraceCheckUtils]: 80: Hoare triple {23560#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-08 15:14:40,804 INFO L290 TraceCheckUtils]: 81: Hoare triple {23560#false} assume 8673 == #t~mem80;havoc #t~mem80; {23560#false} is VALID [2022-04-08 15:14:40,804 INFO L290 TraceCheckUtils]: 82: Hoare triple {23560#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {23560#false} is VALID [2022-04-08 15:14:40,804 INFO L290 TraceCheckUtils]: 83: Hoare triple {23560#false} assume 3 == ~blastFlag~0; {23560#false} is VALID [2022-04-08 15:14:40,804 INFO L290 TraceCheckUtils]: 84: Hoare triple {23560#false} assume !false; {23560#false} is VALID [2022-04-08 15:14:40,805 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:14:40,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:40,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021968207] [2022-04-08 15:14:40,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021968207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:40,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:40,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:40,805 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:40,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1384644492] [2022-04-08 15:14:40,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1384644492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:40,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:40,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:40,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032134540] [2022-04-08 15:14:40,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:40,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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 85 [2022-04-08 15:14:40,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:40,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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:40,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:40,865 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:40,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:40,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:40,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:40,866 INFO L87 Difference]: Start difference. First operand 238 states and 368 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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:42,887 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:14:43,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:43,981 INFO L93 Difference]: Finished difference Result 573 states and 893 transitions. [2022-04-08 15:14:43,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:43,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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 85 [2022-04-08 15:14:43,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-08 15:14:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-08 15:14:43,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 567 transitions. [2022-04-08 15:14:44,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 567 edges. 567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:44,377 INFO L225 Difference]: With dead ends: 573 [2022-04-08 15:14:44,378 INFO L226 Difference]: Without dead ends: 361 [2022-04-08 15:14:44,391 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:14:44,392 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 142 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:44,392 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 314 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:14:44,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-04-08 15:14:44,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 250. [2022-04-08 15:14:44,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:44,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 361 states. Second operand has 250 states, 245 states have (on average 1.546938775510204) internal successors, (379), 245 states have internal predecessors, (379), 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:44,403 INFO L74 IsIncluded]: Start isIncluded. First operand 361 states. Second operand has 250 states, 245 states have (on average 1.546938775510204) internal successors, (379), 245 states have internal predecessors, (379), 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:44,404 INFO L87 Difference]: Start difference. First operand 361 states. Second operand has 250 states, 245 states have (on average 1.546938775510204) internal successors, (379), 245 states have internal predecessors, (379), 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:44,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:44,413 INFO L93 Difference]: Finished difference Result 361 states and 551 transitions. [2022-04-08 15:14:44,414 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 551 transitions. [2022-04-08 15:14:44,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:44,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:44,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.546938775510204) internal successors, (379), 245 states have internal predecessors, (379), 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 361 states. [2022-04-08 15:14:44,415 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.546938775510204) internal successors, (379), 245 states have internal predecessors, (379), 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 361 states. [2022-04-08 15:14:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:44,422 INFO L93 Difference]: Finished difference Result 361 states and 551 transitions. [2022-04-08 15:14:44,422 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 551 transitions. [2022-04-08 15:14:44,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:44,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:44,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:44,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:44,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.546938775510204) internal successors, (379), 245 states have internal predecessors, (379), 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:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 383 transitions. [2022-04-08 15:14:44,428 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 383 transitions. Word has length 85 [2022-04-08 15:14:44,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:44,429 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 383 transitions. [2022-04-08 15:14:44,429 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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:44,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 383 transitions. [2022-04-08 15:14:44,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:44,703 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 383 transitions. [2022-04-08 15:14:44,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-08 15:14:44,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:44,704 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,704 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 15:14:44,704 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:44,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:44,704 INFO L85 PathProgramCache]: Analyzing trace with hash -989381741, now seen corresponding path program 1 times [2022-04-08 15:14:44,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:44,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [885270144] [2022-04-08 15:14:44,751 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:44,751 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:44,751 INFO L85 PathProgramCache]: Analyzing trace with hash -989381741, now seen corresponding path program 2 times [2022-04-08 15:14:44,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:44,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005035006] [2022-04-08 15:14:44,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:44,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:44,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:44,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {25946#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25939#true} is VALID [2022-04-08 15:14:44,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {25939#true} assume true; {25939#true} is VALID [2022-04-08 15:14:44,882 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25939#true} {25939#true} #661#return; {25939#true} is VALID [2022-04-08 15:14:44,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {25939#true} call ULTIMATE.init(); {25946#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:14:44,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {25946#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25939#true} is VALID [2022-04-08 15:14:44,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {25939#true} assume true; {25939#true} is VALID [2022-04-08 15:14:44,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25939#true} {25939#true} #661#return; {25939#true} is VALID [2022-04-08 15:14:44,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {25939#true} call #t~ret161 := main(); {25939#true} is VALID [2022-04-08 15:14:44,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {25939#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {25939#true} is VALID [2022-04-08 15:14:44,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {25939#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {25939#true} is VALID [2022-04-08 15:14:44,884 INFO L272 TraceCheckUtils]: 7: Hoare triple {25939#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25939#true} is VALID [2022-04-08 15:14:44,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {25939#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {25939#true} is VALID [2022-04-08 15:14:44,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {25939#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {25939#true} is VALID [2022-04-08 15:14:44,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {25939#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {25939#true} is VALID [2022-04-08 15:14:44,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {25939#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25939#true} is VALID [2022-04-08 15:14:44,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {25939#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {25939#true} is VALID [2022-04-08 15:14:44,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {25939#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {25939#true} is VALID [2022-04-08 15:14:44,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {25939#true} assume !false; {25939#true} is VALID [2022-04-08 15:14:44,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {25939#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25939#true} is VALID [2022-04-08 15:14:44,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {25939#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25939#true} is VALID [2022-04-08 15:14:44,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {25939#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25939#true} is VALID [2022-04-08 15:14:44,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {25939#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25939#true} is VALID [2022-04-08 15:14:44,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {25939#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25939#true} is VALID [2022-04-08 15:14:44,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {25939#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25939#true} is VALID [2022-04-08 15:14:44,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {25939#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25939#true} is VALID [2022-04-08 15:14:44,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {25939#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25939#true} is VALID [2022-04-08 15:14:44,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {25939#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25939#true} is VALID [2022-04-08 15:14:44,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {25939#true} assume 8464 == #t~mem55;havoc #t~mem55; {25939#true} is VALID [2022-04-08 15:14:44,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {25939#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {25939#true} is VALID [2022-04-08 15:14:44,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {25939#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25939#true} is VALID [2022-04-08 15:14:44,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {25939#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:44,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:44,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:44,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:44,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:44,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:44,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:44,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25945#(= |ssl3_accept_#t~mem49| 8496)} is VALID [2022-04-08 15:14:44,890 INFO L290 TraceCheckUtils]: 35: Hoare triple {25945#(= |ssl3_accept_#t~mem49| 8496)} assume 8192 == #t~mem49;havoc #t~mem49; {25940#false} is VALID [2022-04-08 15:14:44,890 INFO L290 TraceCheckUtils]: 36: Hoare triple {25940#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,890 INFO L290 TraceCheckUtils]: 37: Hoare triple {25940#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {25940#false} is VALID [2022-04-08 15:14:44,890 INFO L290 TraceCheckUtils]: 38: Hoare triple {25940#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,890 INFO L290 TraceCheckUtils]: 39: Hoare triple {25940#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {25940#false} is VALID [2022-04-08 15:14:44,891 INFO L290 TraceCheckUtils]: 40: Hoare triple {25940#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {25940#false} is VALID [2022-04-08 15:14:44,891 INFO L290 TraceCheckUtils]: 41: Hoare triple {25940#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,891 INFO L290 TraceCheckUtils]: 42: Hoare triple {25940#false} assume 12292 != #t~mem85;havoc #t~mem85; {25940#false} is VALID [2022-04-08 15:14:44,891 INFO L290 TraceCheckUtils]: 43: Hoare triple {25940#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem87 := read~int(#t~mem86.base, 128 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 128 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {25940#false} is VALID [2022-04-08 15:14:44,891 INFO L290 TraceCheckUtils]: 44: Hoare triple {25940#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,891 INFO L290 TraceCheckUtils]: 45: Hoare triple {25940#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25940#false} is VALID [2022-04-08 15:14:44,891 INFO L290 TraceCheckUtils]: 46: Hoare triple {25940#false} ~skip~0 := 0; {25940#false} is VALID [2022-04-08 15:14:44,891 INFO L290 TraceCheckUtils]: 47: Hoare triple {25940#false} assume !false; {25940#false} is VALID [2022-04-08 15:14:44,891 INFO L290 TraceCheckUtils]: 48: Hoare triple {25940#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,892 INFO L290 TraceCheckUtils]: 49: Hoare triple {25940#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,892 INFO L290 TraceCheckUtils]: 50: Hoare triple {25940#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,892 INFO L290 TraceCheckUtils]: 51: Hoare triple {25940#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,892 INFO L290 TraceCheckUtils]: 52: Hoare triple {25940#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,892 INFO L290 TraceCheckUtils]: 53: Hoare triple {25940#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,892 INFO L290 TraceCheckUtils]: 54: Hoare triple {25940#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,892 INFO L290 TraceCheckUtils]: 55: Hoare triple {25940#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,892 INFO L290 TraceCheckUtils]: 56: Hoare triple {25940#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,892 INFO L290 TraceCheckUtils]: 57: Hoare triple {25940#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,892 INFO L290 TraceCheckUtils]: 58: Hoare triple {25940#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,893 INFO L290 TraceCheckUtils]: 59: Hoare triple {25940#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,893 INFO L290 TraceCheckUtils]: 60: Hoare triple {25940#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,893 INFO L290 TraceCheckUtils]: 61: Hoare triple {25940#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,893 INFO L290 TraceCheckUtils]: 62: Hoare triple {25940#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,893 INFO L290 TraceCheckUtils]: 63: Hoare triple {25940#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,893 INFO L290 TraceCheckUtils]: 64: Hoare triple {25940#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,893 INFO L290 TraceCheckUtils]: 65: Hoare triple {25940#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,893 INFO L290 TraceCheckUtils]: 66: Hoare triple {25940#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,894 INFO L290 TraceCheckUtils]: 67: Hoare triple {25940#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,894 INFO L290 TraceCheckUtils]: 68: Hoare triple {25940#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,894 INFO L290 TraceCheckUtils]: 69: Hoare triple {25940#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,894 INFO L290 TraceCheckUtils]: 70: Hoare triple {25940#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,894 INFO L290 TraceCheckUtils]: 71: Hoare triple {25940#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,894 INFO L290 TraceCheckUtils]: 72: Hoare triple {25940#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,894 INFO L290 TraceCheckUtils]: 73: Hoare triple {25940#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,894 INFO L290 TraceCheckUtils]: 74: Hoare triple {25940#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,894 INFO L290 TraceCheckUtils]: 75: Hoare triple {25940#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,894 INFO L290 TraceCheckUtils]: 76: Hoare triple {25940#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,895 INFO L290 TraceCheckUtils]: 77: Hoare triple {25940#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,895 INFO L290 TraceCheckUtils]: 78: Hoare triple {25940#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,895 INFO L290 TraceCheckUtils]: 79: Hoare triple {25940#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,895 INFO L290 TraceCheckUtils]: 80: Hoare triple {25940#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,895 INFO L290 TraceCheckUtils]: 81: Hoare triple {25940#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 15:14:44,895 INFO L290 TraceCheckUtils]: 82: Hoare triple {25940#false} assume 8673 == #t~mem80;havoc #t~mem80; {25940#false} is VALID [2022-04-08 15:14:44,895 INFO L290 TraceCheckUtils]: 83: Hoare triple {25940#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {25940#false} is VALID [2022-04-08 15:14:44,895 INFO L290 TraceCheckUtils]: 84: Hoare triple {25940#false} assume 3 == ~blastFlag~0; {25940#false} is VALID [2022-04-08 15:14:44,895 INFO L290 TraceCheckUtils]: 85: Hoare triple {25940#false} assume !false; {25940#false} is VALID [2022-04-08 15:14:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:14:44,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:44,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005035006] [2022-04-08 15:14:44,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005035006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:44,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:44,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:44,896 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:44,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [885270144] [2022-04-08 15:14:44,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [885270144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:44,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:44,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:44,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449252743] [2022-04-08 15:14:44,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:44,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 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 86 [2022-04-08 15:14:44,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:44,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 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:44,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:44,972 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:44,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:44,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:44,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:44,973 INFO L87 Difference]: Start difference. First operand 250 states and 383 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 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:46,992 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:14:47,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:47,903 INFO L93 Difference]: Finished difference Result 502 states and 773 transitions. [2022-04-08 15:14:47,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:47,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 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 86 [2022-04-08 15:14:47,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 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:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-08 15:14:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 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:47,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-08 15:14:47,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-08 15:14:48,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:48,219 INFO L225 Difference]: With dead ends: 502 [2022-04-08 15:14:48,219 INFO L226 Difference]: Without dead ends: 278 [2022-04-08 15:14:48,219 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:14:48,220 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 40 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:48,220 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 479 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 377 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:14:48,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-04-08 15:14:48,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 250. [2022-04-08 15:14:48,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:48,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 278 states. Second operand has 250 states, 245 states have (on average 1.542857142857143) internal successors, (378), 245 states have internal predecessors, (378), 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:48,230 INFO L74 IsIncluded]: Start isIncluded. First operand 278 states. Second operand has 250 states, 245 states have (on average 1.542857142857143) internal successors, (378), 245 states have internal predecessors, (378), 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:48,230 INFO L87 Difference]: Start difference. First operand 278 states. Second operand has 250 states, 245 states have (on average 1.542857142857143) internal successors, (378), 245 states have internal predecessors, (378), 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:48,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:48,235 INFO L93 Difference]: Finished difference Result 278 states and 419 transitions. [2022-04-08 15:14:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 419 transitions. [2022-04-08 15:14:48,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:48,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:48,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.542857142857143) internal successors, (378), 245 states have internal predecessors, (378), 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 278 states. [2022-04-08 15:14:48,236 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.542857142857143) internal successors, (378), 245 states have internal predecessors, (378), 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 278 states. [2022-04-08 15:14:48,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:48,241 INFO L93 Difference]: Finished difference Result 278 states and 419 transitions. [2022-04-08 15:14:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 419 transitions. [2022-04-08 15:14:48,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:48,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:48,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:48,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.542857142857143) internal successors, (378), 245 states have internal predecessors, (378), 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:48,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 382 transitions. [2022-04-08 15:14:48,247 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 382 transitions. Word has length 86 [2022-04-08 15:14:48,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:48,247 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 382 transitions. [2022-04-08 15:14:48,247 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 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:48,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 382 transitions. [2022-04-08 15:14:48,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:48,531 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 382 transitions. [2022-04-08 15:14:48,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-08 15:14:48,531 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:48,531 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 15:14:48,532 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:48,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:48,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1455094013, now seen corresponding path program 1 times [2022-04-08 15:14:48,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:48,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [875922798] [2022-04-08 15:14:48,583 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:48,583 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:48,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1455094013, now seen corresponding path program 2 times [2022-04-08 15:14:48,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:48,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805150046] [2022-04-08 15:14:48,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:48,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:48,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:48,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {28018#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {28011#true} is VALID [2022-04-08 15:14:48,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {28011#true} assume true; {28011#true} is VALID [2022-04-08 15:14:48,729 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28011#true} {28011#true} #661#return; {28011#true} is VALID [2022-04-08 15:14:48,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {28011#true} call ULTIMATE.init(); {28018#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:14:48,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {28018#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {28011#true} is VALID [2022-04-08 15:14:48,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {28011#true} assume true; {28011#true} is VALID [2022-04-08 15:14:48,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28011#true} {28011#true} #661#return; {28011#true} is VALID [2022-04-08 15:14:48,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {28011#true} call #t~ret161 := main(); {28011#true} is VALID [2022-04-08 15:14:48,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {28011#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {28011#true} is VALID [2022-04-08 15:14:48,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {28011#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {28011#true} is VALID [2022-04-08 15:14:48,731 INFO L272 TraceCheckUtils]: 7: Hoare triple {28011#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {28011#true} is VALID [2022-04-08 15:14:48,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {28011#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {28011#true} is VALID [2022-04-08 15:14:48,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {28011#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {28011#true} is VALID [2022-04-08 15:14:48,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {28011#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {28011#true} is VALID [2022-04-08 15:14:48,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {28011#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {28011#true} is VALID [2022-04-08 15:14:48,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {28011#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {28011#true} is VALID [2022-04-08 15:14:48,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {28011#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {28011#true} is VALID [2022-04-08 15:14:48,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {28011#true} assume !false; {28011#true} is VALID [2022-04-08 15:14:48,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {28011#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {28011#true} is VALID [2022-04-08 15:14:48,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {28011#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {28011#true} is VALID [2022-04-08 15:14:48,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {28011#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {28011#true} is VALID [2022-04-08 15:14:48,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {28011#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {28011#true} is VALID [2022-04-08 15:14:48,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {28011#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {28011#true} is VALID [2022-04-08 15:14:48,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {28011#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {28011#true} is VALID [2022-04-08 15:14:48,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {28011#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {28011#true} is VALID [2022-04-08 15:14:48,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {28011#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {28011#true} is VALID [2022-04-08 15:14:48,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {28011#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {28011#true} is VALID [2022-04-08 15:14:48,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {28011#true} assume 8464 == #t~mem55;havoc #t~mem55; {28011#true} is VALID [2022-04-08 15:14:48,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {28011#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {28011#true} is VALID [2022-04-08 15:14:48,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {28011#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {28011#true} is VALID [2022-04-08 15:14:48,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {28011#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:48,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:48,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:48,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:48,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:48,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:48,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:48,737 INFO L290 TraceCheckUtils]: 34: Hoare triple {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:48,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {28017#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-08 15:14:48,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {28017#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {28012#false} is VALID [2022-04-08 15:14:48,737 INFO L290 TraceCheckUtils]: 37: Hoare triple {28012#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,738 INFO L290 TraceCheckUtils]: 38: Hoare triple {28012#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {28012#false} is VALID [2022-04-08 15:14:48,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {28012#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {28012#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {28012#false} is VALID [2022-04-08 15:14:48,738 INFO L290 TraceCheckUtils]: 41: Hoare triple {28012#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {28012#false} is VALID [2022-04-08 15:14:48,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {28012#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,738 INFO L290 TraceCheckUtils]: 43: Hoare triple {28012#false} assume 12292 != #t~mem85;havoc #t~mem85; {28012#false} is VALID [2022-04-08 15:14:48,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {28012#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem87 := read~int(#t~mem86.base, 128 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 128 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {28012#false} is VALID [2022-04-08 15:14:48,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {28012#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {28012#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28012#false} is VALID [2022-04-08 15:14:48,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {28012#false} ~skip~0 := 0; {28012#false} is VALID [2022-04-08 15:14:48,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {28012#false} assume !false; {28012#false} is VALID [2022-04-08 15:14:48,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {28012#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,739 INFO L290 TraceCheckUtils]: 50: Hoare triple {28012#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,739 INFO L290 TraceCheckUtils]: 51: Hoare triple {28012#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,739 INFO L290 TraceCheckUtils]: 52: Hoare triple {28012#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,739 INFO L290 TraceCheckUtils]: 53: Hoare triple {28012#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,739 INFO L290 TraceCheckUtils]: 54: Hoare triple {28012#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,739 INFO L290 TraceCheckUtils]: 55: Hoare triple {28012#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,739 INFO L290 TraceCheckUtils]: 56: Hoare triple {28012#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,739 INFO L290 TraceCheckUtils]: 57: Hoare triple {28012#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,740 INFO L290 TraceCheckUtils]: 58: Hoare triple {28012#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,740 INFO L290 TraceCheckUtils]: 59: Hoare triple {28012#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,740 INFO L290 TraceCheckUtils]: 60: Hoare triple {28012#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,740 INFO L290 TraceCheckUtils]: 61: Hoare triple {28012#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,740 INFO L290 TraceCheckUtils]: 62: Hoare triple {28012#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,740 INFO L290 TraceCheckUtils]: 63: Hoare triple {28012#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,740 INFO L290 TraceCheckUtils]: 64: Hoare triple {28012#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,740 INFO L290 TraceCheckUtils]: 65: Hoare triple {28012#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,740 INFO L290 TraceCheckUtils]: 66: Hoare triple {28012#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,741 INFO L290 TraceCheckUtils]: 67: Hoare triple {28012#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,741 INFO L290 TraceCheckUtils]: 68: Hoare triple {28012#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,741 INFO L290 TraceCheckUtils]: 69: Hoare triple {28012#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,741 INFO L290 TraceCheckUtils]: 70: Hoare triple {28012#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,741 INFO L290 TraceCheckUtils]: 71: Hoare triple {28012#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,741 INFO L290 TraceCheckUtils]: 72: Hoare triple {28012#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,741 INFO L290 TraceCheckUtils]: 73: Hoare triple {28012#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,741 INFO L290 TraceCheckUtils]: 74: Hoare triple {28012#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,742 INFO L290 TraceCheckUtils]: 75: Hoare triple {28012#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,742 INFO L290 TraceCheckUtils]: 76: Hoare triple {28012#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,742 INFO L290 TraceCheckUtils]: 77: Hoare triple {28012#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,742 INFO L290 TraceCheckUtils]: 78: Hoare triple {28012#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,742 INFO L290 TraceCheckUtils]: 79: Hoare triple {28012#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,742 INFO L290 TraceCheckUtils]: 80: Hoare triple {28012#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,742 INFO L290 TraceCheckUtils]: 81: Hoare triple {28012#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,742 INFO L290 TraceCheckUtils]: 82: Hoare triple {28012#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-08 15:14:48,742 INFO L290 TraceCheckUtils]: 83: Hoare triple {28012#false} assume 8673 == #t~mem80;havoc #t~mem80; {28012#false} is VALID [2022-04-08 15:14:48,742 INFO L290 TraceCheckUtils]: 84: Hoare triple {28012#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {28012#false} is VALID [2022-04-08 15:14:48,743 INFO L290 TraceCheckUtils]: 85: Hoare triple {28012#false} assume 3 == ~blastFlag~0; {28012#false} is VALID [2022-04-08 15:14:48,743 INFO L290 TraceCheckUtils]: 86: Hoare triple {28012#false} assume !false; {28012#false} is VALID [2022-04-08 15:14:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:14:48,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:48,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805150046] [2022-04-08 15:14:48,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805150046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:48,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:48,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:48,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:48,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [875922798] [2022-04-08 15:14:48,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [875922798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:48,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:48,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:48,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777999070] [2022-04-08 15:14:48,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:48,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 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 87 [2022-04-08 15:14:48,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:48,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 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:48,818 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:14:48,818 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:48,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:48,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:48,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:48,819 INFO L87 Difference]: Start difference. First operand 250 states and 382 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 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:50,843 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:14:51,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:51,988 INFO L93 Difference]: Finished difference Result 585 states and 902 transitions. [2022-04-08 15:14:51,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:51,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 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 87 [2022-04-08 15:14:51,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 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:51,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-08 15:14:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 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:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-08 15:14:51,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 566 transitions. [2022-04-08 15:14:52,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 566 edges. 566 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:52,399 INFO L225 Difference]: With dead ends: 585 [2022-04-08 15:14:52,399 INFO L226 Difference]: Without dead ends: 361 [2022-04-08 15:14:52,399 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:14:52,400 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 139 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:52,400 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 314 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:14:52,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-04-08 15:14:52,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 252. [2022-04-08 15:14:52,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:52,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 361 states. Second operand has 252 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 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:52,411 INFO L74 IsIncluded]: Start isIncluded. First operand 361 states. Second operand has 252 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 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:52,411 INFO L87 Difference]: Start difference. First operand 361 states. Second operand has 252 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 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:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:52,418 INFO L93 Difference]: Finished difference Result 361 states and 546 transitions. [2022-04-08 15:14:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 546 transitions. [2022-04-08 15:14:52,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:52,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:52,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 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 361 states. [2022-04-08 15:14:52,419 INFO L87 Difference]: Start difference. First operand has 252 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 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 361 states. [2022-04-08 15:14:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:52,445 INFO L93 Difference]: Finished difference Result 361 states and 546 transitions. [2022-04-08 15:14:52,445 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 546 transitions. [2022-04-08 15:14:52,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:52,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:52,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:52,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 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:52,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 382 transitions. [2022-04-08 15:14:52,453 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 382 transitions. Word has length 87 [2022-04-08 15:14:52,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:52,453 INFO L478 AbstractCegarLoop]: Abstraction has 252 states and 382 transitions. [2022-04-08 15:14:52,454 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 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:52,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 382 transitions. [2022-04-08 15:14:52,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:52,798 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 382 transitions. [2022-04-08 15:14:52,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-08 15:14:52,799 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:52,799 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:14:52,799 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 15:14:52,799 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:52,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:52,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1295416728, now seen corresponding path program 1 times [2022-04-08 15:14:52,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:52,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [512640606] [2022-04-08 15:14:52,839 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:52,839 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:52,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1295416728, now seen corresponding path program 2 times [2022-04-08 15:14:52,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:52,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446061360] [2022-04-08 15:14:52,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:52,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:52,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:52,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {30426#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30419#true} is VALID [2022-04-08 15:14:52,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {30419#true} assume true; {30419#true} is VALID [2022-04-08 15:14:52,993 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30419#true} {30419#true} #661#return; {30419#true} is VALID [2022-04-08 15:14:52,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {30419#true} call ULTIMATE.init(); {30426#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:14:52,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {30426#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30419#true} is VALID [2022-04-08 15:14:52,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {30419#true} assume true; {30419#true} is VALID [2022-04-08 15:14:52,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30419#true} {30419#true} #661#return; {30419#true} is VALID [2022-04-08 15:14:52,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {30419#true} call #t~ret161 := main(); {30419#true} is VALID [2022-04-08 15:14:52,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {30419#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {30419#true} is VALID [2022-04-08 15:14:52,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {30419#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {30419#true} is VALID [2022-04-08 15:14:52,995 INFO L272 TraceCheckUtils]: 7: Hoare triple {30419#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30419#true} is VALID [2022-04-08 15:14:52,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {30419#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {30419#true} is VALID [2022-04-08 15:14:52,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {30419#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {30419#true} is VALID [2022-04-08 15:14:52,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {30419#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {30419#true} is VALID [2022-04-08 15:14:52,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {30419#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30419#true} is VALID [2022-04-08 15:14:52,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {30419#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {30419#true} is VALID [2022-04-08 15:14:52,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {30419#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {30419#true} is VALID [2022-04-08 15:14:52,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {30419#true} assume !false; {30419#true} is VALID [2022-04-08 15:14:52,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {30419#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30419#true} is VALID [2022-04-08 15:14:52,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {30419#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30419#true} is VALID [2022-04-08 15:14:52,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {30419#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30419#true} is VALID [2022-04-08 15:14:52,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {30419#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30419#true} is VALID [2022-04-08 15:14:52,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {30419#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30419#true} is VALID [2022-04-08 15:14:52,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {30419#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30419#true} is VALID [2022-04-08 15:14:52,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {30419#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30419#true} is VALID [2022-04-08 15:14:52,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {30419#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30419#true} is VALID [2022-04-08 15:14:52,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {30419#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30419#true} is VALID [2022-04-08 15:14:52,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {30419#true} assume 8464 == #t~mem55;havoc #t~mem55; {30419#true} is VALID [2022-04-08 15:14:52,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {30419#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {30419#true} is VALID [2022-04-08 15:14:52,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {30419#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30419#true} is VALID [2022-04-08 15:14:52,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {30419#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:52,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:52,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:52,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:53,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:53,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:53,001 INFO L290 TraceCheckUtils]: 33: Hoare triple {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:53,001 INFO L290 TraceCheckUtils]: 34: Hoare triple {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:53,001 INFO L290 TraceCheckUtils]: 35: Hoare triple {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:53,002 INFO L290 TraceCheckUtils]: 36: Hoare triple {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30425#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-08 15:14:53,002 INFO L290 TraceCheckUtils]: 37: Hoare triple {30425#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {30420#false} is VALID [2022-04-08 15:14:53,002 INFO L290 TraceCheckUtils]: 38: Hoare triple {30420#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,002 INFO L290 TraceCheckUtils]: 39: Hoare triple {30420#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {30420#false} is VALID [2022-04-08 15:14:53,003 INFO L290 TraceCheckUtils]: 40: Hoare triple {30420#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,003 INFO L290 TraceCheckUtils]: 41: Hoare triple {30420#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {30420#false} is VALID [2022-04-08 15:14:53,003 INFO L290 TraceCheckUtils]: 42: Hoare triple {30420#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {30420#false} is VALID [2022-04-08 15:14:53,003 INFO L290 TraceCheckUtils]: 43: Hoare triple {30420#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,003 INFO L290 TraceCheckUtils]: 44: Hoare triple {30420#false} assume 12292 != #t~mem85;havoc #t~mem85; {30420#false} is VALID [2022-04-08 15:14:53,003 INFO L290 TraceCheckUtils]: 45: Hoare triple {30420#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem87 := read~int(#t~mem86.base, 128 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 128 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {30420#false} is VALID [2022-04-08 15:14:53,003 INFO L290 TraceCheckUtils]: 46: Hoare triple {30420#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,003 INFO L290 TraceCheckUtils]: 47: Hoare triple {30420#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30420#false} is VALID [2022-04-08 15:14:53,003 INFO L290 TraceCheckUtils]: 48: Hoare triple {30420#false} ~skip~0 := 0; {30420#false} is VALID [2022-04-08 15:14:53,003 INFO L290 TraceCheckUtils]: 49: Hoare triple {30420#false} assume !false; {30420#false} is VALID [2022-04-08 15:14:53,004 INFO L290 TraceCheckUtils]: 50: Hoare triple {30420#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,004 INFO L290 TraceCheckUtils]: 51: Hoare triple {30420#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,004 INFO L290 TraceCheckUtils]: 52: Hoare triple {30420#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,004 INFO L290 TraceCheckUtils]: 53: Hoare triple {30420#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,004 INFO L290 TraceCheckUtils]: 54: Hoare triple {30420#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,004 INFO L290 TraceCheckUtils]: 55: Hoare triple {30420#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,004 INFO L290 TraceCheckUtils]: 56: Hoare triple {30420#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,004 INFO L290 TraceCheckUtils]: 57: Hoare triple {30420#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,004 INFO L290 TraceCheckUtils]: 58: Hoare triple {30420#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,004 INFO L290 TraceCheckUtils]: 59: Hoare triple {30420#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,005 INFO L290 TraceCheckUtils]: 60: Hoare triple {30420#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,005 INFO L290 TraceCheckUtils]: 61: Hoare triple {30420#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,005 INFO L290 TraceCheckUtils]: 62: Hoare triple {30420#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,005 INFO L290 TraceCheckUtils]: 63: Hoare triple {30420#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,005 INFO L290 TraceCheckUtils]: 64: Hoare triple {30420#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,005 INFO L290 TraceCheckUtils]: 65: Hoare triple {30420#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,005 INFO L290 TraceCheckUtils]: 66: Hoare triple {30420#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,005 INFO L290 TraceCheckUtils]: 67: Hoare triple {30420#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,005 INFO L290 TraceCheckUtils]: 68: Hoare triple {30420#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,005 INFO L290 TraceCheckUtils]: 69: Hoare triple {30420#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,006 INFO L290 TraceCheckUtils]: 70: Hoare triple {30420#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,006 INFO L290 TraceCheckUtils]: 71: Hoare triple {30420#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,006 INFO L290 TraceCheckUtils]: 72: Hoare triple {30420#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,006 INFO L290 TraceCheckUtils]: 73: Hoare triple {30420#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,006 INFO L290 TraceCheckUtils]: 74: Hoare triple {30420#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,006 INFO L290 TraceCheckUtils]: 75: Hoare triple {30420#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,006 INFO L290 TraceCheckUtils]: 76: Hoare triple {30420#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,006 INFO L290 TraceCheckUtils]: 77: Hoare triple {30420#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,006 INFO L290 TraceCheckUtils]: 78: Hoare triple {30420#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,006 INFO L290 TraceCheckUtils]: 79: Hoare triple {30420#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,006 INFO L290 TraceCheckUtils]: 80: Hoare triple {30420#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,007 INFO L290 TraceCheckUtils]: 81: Hoare triple {30420#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,007 INFO L290 TraceCheckUtils]: 82: Hoare triple {30420#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,007 INFO L290 TraceCheckUtils]: 83: Hoare triple {30420#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-08 15:14:53,007 INFO L290 TraceCheckUtils]: 84: Hoare triple {30420#false} assume 8673 == #t~mem80;havoc #t~mem80; {30420#false} is VALID [2022-04-08 15:14:53,007 INFO L290 TraceCheckUtils]: 85: Hoare triple {30420#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {30420#false} is VALID [2022-04-08 15:14:53,007 INFO L290 TraceCheckUtils]: 86: Hoare triple {30420#false} assume 3 == ~blastFlag~0; {30420#false} is VALID [2022-04-08 15:14:53,007 INFO L290 TraceCheckUtils]: 87: Hoare triple {30420#false} assume !false; {30420#false} is VALID [2022-04-08 15:14:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:14:53,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:53,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446061360] [2022-04-08 15:14:53,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446061360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:53,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:53,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:53,008 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:53,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [512640606] [2022-04-08 15:14:53,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [512640606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:53,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:53,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:53,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636967041] [2022-04-08 15:14:53,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:53,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 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 88 [2022-04-08 15:14:53,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:53,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 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:53,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:53,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:53,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:53,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:53,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:53,088 INFO L87 Difference]: Start difference. First operand 252 states and 382 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 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:55,112 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:14:56,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:56,253 INFO L93 Difference]: Finished difference Result 587 states and 898 transitions. [2022-04-08 15:14:56,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:56,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 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 88 [2022-04-08 15:14:56,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 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:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-08 15:14:56,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 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:56,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-08 15:14:56,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 565 transitions. [2022-04-08 15:14:56,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 565 edges. 565 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:56,653 INFO L225 Difference]: With dead ends: 587 [2022-04-08 15:14:56,653 INFO L226 Difference]: Without dead ends: 361 [2022-04-08 15:14:56,654 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:14:56,654 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 137 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:56,654 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 314 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:14:56,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-04-08 15:14:56,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 253. [2022-04-08 15:14:56,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:56,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 361 states. Second operand has 253 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 248 states have internal predecessors, (376), 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:56,664 INFO L74 IsIncluded]: Start isIncluded. First operand 361 states. Second operand has 253 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 248 states have internal predecessors, (376), 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:56,665 INFO L87 Difference]: Start difference. First operand 361 states. Second operand has 253 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 248 states have internal predecessors, (376), 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:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:56,672 INFO L93 Difference]: Finished difference Result 361 states and 542 transitions. [2022-04-08 15:14:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 542 transitions. [2022-04-08 15:14:56,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:56,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:56,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 253 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 248 states have internal predecessors, (376), 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 361 states. [2022-04-08 15:14:56,673 INFO L87 Difference]: Start difference. First operand has 253 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 248 states have internal predecessors, (376), 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 361 states. [2022-04-08 15:14:56,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:56,680 INFO L93 Difference]: Finished difference Result 361 states and 542 transitions. [2022-04-08 15:14:56,680 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 542 transitions. [2022-04-08 15:14:56,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:56,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:56,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:56,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:56,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 248 states have internal predecessors, (376), 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:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 380 transitions. [2022-04-08 15:14:56,686 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 380 transitions. Word has length 88 [2022-04-08 15:14:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:56,686 INFO L478 AbstractCegarLoop]: Abstraction has 253 states and 380 transitions. [2022-04-08 15:14:56,686 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 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:56,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 253 states and 380 transitions. [2022-04-08 15:14:56,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:56,969 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 380 transitions. [2022-04-08 15:14:56,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 15:14:56,970 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:56,970 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:14:56,970 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 15:14:56,971 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:56,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:56,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1325248613, now seen corresponding path program 1 times [2022-04-08 15:14:56,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:56,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1540081435] [2022-04-08 15:14:57,020 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:57,021 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:57,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1325248613, now seen corresponding path program 2 times [2022-04-08 15:14:57,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:57,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632994945] [2022-04-08 15:14:57,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:57,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:57,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:57,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {32840#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32833#true} is VALID [2022-04-08 15:14:57,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {32833#true} assume true; {32833#true} is VALID [2022-04-08 15:14:57,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32833#true} {32833#true} #661#return; {32833#true} is VALID [2022-04-08 15:14:57,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {32833#true} call ULTIMATE.init(); {32840#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:14:57,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {32840#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32833#true} is VALID [2022-04-08 15:14:57,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {32833#true} assume true; {32833#true} is VALID [2022-04-08 15:14:57,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32833#true} {32833#true} #661#return; {32833#true} is VALID [2022-04-08 15:14:57,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {32833#true} call #t~ret161 := main(); {32833#true} is VALID [2022-04-08 15:14:57,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {32833#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {32833#true} is VALID [2022-04-08 15:14:57,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {32833#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {32833#true} is VALID [2022-04-08 15:14:57,169 INFO L272 TraceCheckUtils]: 7: Hoare triple {32833#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {32833#true} is VALID [2022-04-08 15:14:57,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {32833#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {32833#true} is VALID [2022-04-08 15:14:57,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {32833#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {32833#true} is VALID [2022-04-08 15:14:57,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {32833#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {32833#true} is VALID [2022-04-08 15:14:57,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {32833#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {32833#true} is VALID [2022-04-08 15:14:57,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {32833#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {32833#true} is VALID [2022-04-08 15:14:57,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {32833#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {32833#true} is VALID [2022-04-08 15:14:57,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {32833#true} assume !false; {32833#true} is VALID [2022-04-08 15:14:57,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {32833#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {32833#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {32833#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {32833#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {32833#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {32833#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {32833#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {32833#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {32833#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {32833#true} assume 8464 == #t~mem55;havoc #t~mem55; {32833#true} is VALID [2022-04-08 15:14:57,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {32833#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {32833#true} is VALID [2022-04-08 15:14:57,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {32833#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32833#true} is VALID [2022-04-08 15:14:57,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {32833#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,171 INFO L290 TraceCheckUtils]: 28: Hoare triple {32833#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,171 INFO L290 TraceCheckUtils]: 29: Hoare triple {32833#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32833#true} is VALID [2022-04-08 15:14:57,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {32833#true} ~skip~0 := 0; {32833#true} is VALID [2022-04-08 15:14:57,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {32833#true} assume !false; {32833#true} is VALID [2022-04-08 15:14:57,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {32833#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,172 INFO L290 TraceCheckUtils]: 33: Hoare triple {32833#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,172 INFO L290 TraceCheckUtils]: 34: Hoare triple {32833#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,172 INFO L290 TraceCheckUtils]: 35: Hoare triple {32833#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,172 INFO L290 TraceCheckUtils]: 36: Hoare triple {32833#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,172 INFO L290 TraceCheckUtils]: 37: Hoare triple {32833#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,172 INFO L290 TraceCheckUtils]: 38: Hoare triple {32833#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,172 INFO L290 TraceCheckUtils]: 39: Hoare triple {32833#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,172 INFO L290 TraceCheckUtils]: 40: Hoare triple {32833#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,172 INFO L290 TraceCheckUtils]: 41: Hoare triple {32833#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {32833#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,173 INFO L290 TraceCheckUtils]: 43: Hoare triple {32833#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {32833#true} assume 8496 == #t~mem58;havoc #t~mem58; {32833#true} is VALID [2022-04-08 15:14:57,173 INFO L290 TraceCheckUtils]: 45: Hoare triple {32833#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {32833#true} is VALID [2022-04-08 15:14:57,173 INFO L290 TraceCheckUtils]: 46: Hoare triple {32833#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {32833#true} is VALID [2022-04-08 15:14:57,173 INFO L290 TraceCheckUtils]: 47: Hoare triple {32833#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {32833#true} is VALID [2022-04-08 15:14:57,174 INFO L290 TraceCheckUtils]: 48: Hoare triple {32833#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,175 INFO L290 TraceCheckUtils]: 49: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,175 INFO L290 TraceCheckUtils]: 50: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,176 INFO L290 TraceCheckUtils]: 51: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,176 INFO L290 TraceCheckUtils]: 52: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,176 INFO L290 TraceCheckUtils]: 53: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,177 INFO L290 TraceCheckUtils]: 54: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,177 INFO L290 TraceCheckUtils]: 55: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,177 INFO L290 TraceCheckUtils]: 56: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,178 INFO L290 TraceCheckUtils]: 57: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,178 INFO L290 TraceCheckUtils]: 58: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,179 INFO L290 TraceCheckUtils]: 59: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,179 INFO L290 TraceCheckUtils]: 60: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,180 INFO L290 TraceCheckUtils]: 61: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,180 INFO L290 TraceCheckUtils]: 62: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,180 INFO L290 TraceCheckUtils]: 63: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,181 INFO L290 TraceCheckUtils]: 64: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,181 INFO L290 TraceCheckUtils]: 65: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,182 INFO L290 TraceCheckUtils]: 66: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,182 INFO L290 TraceCheckUtils]: 67: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,182 INFO L290 TraceCheckUtils]: 68: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,183 INFO L290 TraceCheckUtils]: 69: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,183 INFO L290 TraceCheckUtils]: 70: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,184 INFO L290 TraceCheckUtils]: 71: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,184 INFO L290 TraceCheckUtils]: 72: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,184 INFO L290 TraceCheckUtils]: 73: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,185 INFO L290 TraceCheckUtils]: 74: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,185 INFO L290 TraceCheckUtils]: 75: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,186 INFO L290 TraceCheckUtils]: 76: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,186 INFO L290 TraceCheckUtils]: 77: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,186 INFO L290 TraceCheckUtils]: 78: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,187 INFO L290 TraceCheckUtils]: 79: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,187 INFO L290 TraceCheckUtils]: 80: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,188 INFO L290 TraceCheckUtils]: 81: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,188 INFO L290 TraceCheckUtils]: 82: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,189 INFO L290 TraceCheckUtils]: 83: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:57,189 INFO L290 TraceCheckUtils]: 84: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {32839#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-08 15:14:57,189 INFO L290 TraceCheckUtils]: 85: Hoare triple {32839#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {32834#false} is VALID [2022-04-08 15:14:57,189 INFO L290 TraceCheckUtils]: 86: Hoare triple {32834#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {32834#false} is VALID [2022-04-08 15:14:57,189 INFO L290 TraceCheckUtils]: 87: Hoare triple {32834#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {32834#false} is VALID [2022-04-08 15:14:57,190 INFO L290 TraceCheckUtils]: 88: Hoare triple {32834#false} assume 8673 == #t~mem80;havoc #t~mem80; {32834#false} is VALID [2022-04-08 15:14:57,190 INFO L290 TraceCheckUtils]: 89: Hoare triple {32834#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {32834#false} is VALID [2022-04-08 15:14:57,190 INFO L290 TraceCheckUtils]: 90: Hoare triple {32834#false} assume 3 == ~blastFlag~0; {32834#false} is VALID [2022-04-08 15:14:57,190 INFO L290 TraceCheckUtils]: 91: Hoare triple {32834#false} assume !false; {32834#false} is VALID [2022-04-08 15:14:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 15:14:57,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:57,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632994945] [2022-04-08 15:14:57,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632994945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:57,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:57,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:57,191 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:57,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1540081435] [2022-04-08 15:14:57,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1540081435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:57,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:57,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:57,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884352459] [2022-04-08 15:14:57,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:57,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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 92 [2022-04-08 15:14:57,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:57,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:57,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:57,254 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:57,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:57,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:57,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:57,255 INFO L87 Difference]: Start difference. First operand 253 states and 380 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:59,273 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:15:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:00,512 INFO L93 Difference]: Finished difference Result 585 states and 887 transitions. [2022-04-08 15:15:00,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:15:00,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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 92 [2022-04-08 15:15:00,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:15:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:15:00,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 537 transitions. [2022-04-08 15:15:00,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:15:00,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 537 transitions. [2022-04-08 15:15:00,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 537 transitions. [2022-04-08 15:15:00,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 537 edges. 537 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:00,883 INFO L225 Difference]: With dead ends: 585 [2022-04-08 15:15:00,883 INFO L226 Difference]: Without dead ends: 358 [2022-04-08 15:15:00,884 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:15:00,884 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 75 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:15:00,885 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 473 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 529 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:15:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-04-08 15:15:00,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 296. [2022-04-08 15:15:00,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:15:00,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 358 states. Second operand has 296 states, 291 states have (on average 1.5498281786941581) internal successors, (451), 291 states have internal predecessors, (451), 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:15:00,897 INFO L74 IsIncluded]: Start isIncluded. First operand 358 states. Second operand has 296 states, 291 states have (on average 1.5498281786941581) internal successors, (451), 291 states have internal predecessors, (451), 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:15:00,898 INFO L87 Difference]: Start difference. First operand 358 states. Second operand has 296 states, 291 states have (on average 1.5498281786941581) internal successors, (451), 291 states have internal predecessors, (451), 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:15:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:00,904 INFO L93 Difference]: Finished difference Result 358 states and 536 transitions. [2022-04-08 15:15:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 536 transitions. [2022-04-08 15:15:00,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:00,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:00,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 296 states, 291 states have (on average 1.5498281786941581) internal successors, (451), 291 states have internal predecessors, (451), 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 358 states. [2022-04-08 15:15:00,906 INFO L87 Difference]: Start difference. First operand has 296 states, 291 states have (on average 1.5498281786941581) internal successors, (451), 291 states have internal predecessors, (451), 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 358 states. [2022-04-08 15:15:00,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:00,912 INFO L93 Difference]: Finished difference Result 358 states and 536 transitions. [2022-04-08 15:15:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 536 transitions. [2022-04-08 15:15:00,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:00,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:00,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:15:00,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:15:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 291 states have (on average 1.5498281786941581) internal successors, (451), 291 states have internal predecessors, (451), 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:15:00,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 455 transitions. [2022-04-08 15:15:00,920 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 455 transitions. Word has length 92 [2022-04-08 15:15:00,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:15:00,920 INFO L478 AbstractCegarLoop]: Abstraction has 296 states and 455 transitions. [2022-04-08 15:15:00,920 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:15:00,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 296 states and 455 transitions. [2022-04-08 15:15:01,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:01,269 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 455 transitions. [2022-04-08 15:15:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 15:15:01,270 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:15:01,270 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:15:01,270 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 15:15:01,270 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:15:01,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:15:01,270 INFO L85 PathProgramCache]: Analyzing trace with hash -724139229, now seen corresponding path program 1 times [2022-04-08 15:15:01,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:01,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [999894687] [2022-04-08 15:15:01,311 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:15:01,311 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:15:01,311 INFO L85 PathProgramCache]: Analyzing trace with hash -724139229, now seen corresponding path program 2 times [2022-04-08 15:15:01,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:15:01,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722294405] [2022-04-08 15:15:01,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:15:01,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:15:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:01,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:15:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:01,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {35330#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35323#true} is VALID [2022-04-08 15:15:01,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {35323#true} assume true; {35323#true} is VALID [2022-04-08 15:15:01,439 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35323#true} {35323#true} #661#return; {35323#true} is VALID [2022-04-08 15:15:01,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {35323#true} call ULTIMATE.init(); {35330#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:15:01,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {35330#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35323#true} is VALID [2022-04-08 15:15:01,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {35323#true} assume true; {35323#true} is VALID [2022-04-08 15:15:01,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35323#true} {35323#true} #661#return; {35323#true} is VALID [2022-04-08 15:15:01,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {35323#true} call #t~ret161 := main(); {35323#true} is VALID [2022-04-08 15:15:01,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {35323#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {35323#true} is VALID [2022-04-08 15:15:01,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {35323#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {35323#true} is VALID [2022-04-08 15:15:01,440 INFO L272 TraceCheckUtils]: 7: Hoare triple {35323#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {35323#true} is VALID [2022-04-08 15:15:01,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {35323#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {35323#true} is VALID [2022-04-08 15:15:01,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {35323#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {35323#true} is VALID [2022-04-08 15:15:01,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {35323#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {35323#true} is VALID [2022-04-08 15:15:01,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {35323#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {35323#true} is VALID [2022-04-08 15:15:01,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {35323#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {35323#true} is VALID [2022-04-08 15:15:01,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {35323#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {35323#true} is VALID [2022-04-08 15:15:01,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {35323#true} assume !false; {35323#true} is VALID [2022-04-08 15:15:01,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {35323#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {35323#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {35323#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {35323#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {35323#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {35323#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {35323#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {35323#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {35323#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {35323#true} assume 8464 == #t~mem55;havoc #t~mem55; {35323#true} is VALID [2022-04-08 15:15:01,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {35323#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {35323#true} is VALID [2022-04-08 15:15:01,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {35323#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35323#true} is VALID [2022-04-08 15:15:01,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {35323#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {35323#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {35323#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35323#true} is VALID [2022-04-08 15:15:01,442 INFO L290 TraceCheckUtils]: 30: Hoare triple {35323#true} ~skip~0 := 0; {35323#true} is VALID [2022-04-08 15:15:01,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {35323#true} assume !false; {35323#true} is VALID [2022-04-08 15:15:01,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {35323#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,443 INFO L290 TraceCheckUtils]: 33: Hoare triple {35323#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,443 INFO L290 TraceCheckUtils]: 34: Hoare triple {35323#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,443 INFO L290 TraceCheckUtils]: 35: Hoare triple {35323#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,443 INFO L290 TraceCheckUtils]: 36: Hoare triple {35323#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,443 INFO L290 TraceCheckUtils]: 37: Hoare triple {35323#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,443 INFO L290 TraceCheckUtils]: 38: Hoare triple {35323#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,443 INFO L290 TraceCheckUtils]: 39: Hoare triple {35323#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {35323#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {35323#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {35323#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,444 INFO L290 TraceCheckUtils]: 43: Hoare triple {35323#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,444 INFO L290 TraceCheckUtils]: 44: Hoare triple {35323#true} assume 8496 == #t~mem58;havoc #t~mem58; {35323#true} is VALID [2022-04-08 15:15:01,444 INFO L290 TraceCheckUtils]: 45: Hoare triple {35323#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {35323#true} is VALID [2022-04-08 15:15:01,444 INFO L290 TraceCheckUtils]: 46: Hoare triple {35323#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {35323#true} is VALID [2022-04-08 15:15:01,444 INFO L290 TraceCheckUtils]: 47: Hoare triple {35323#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {35323#true} is VALID [2022-04-08 15:15:01,445 INFO L290 TraceCheckUtils]: 48: Hoare triple {35323#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,446 INFO L290 TraceCheckUtils]: 49: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,446 INFO L290 TraceCheckUtils]: 50: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,447 INFO L290 TraceCheckUtils]: 51: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,447 INFO L290 TraceCheckUtils]: 52: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,448 INFO L290 TraceCheckUtils]: 53: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,448 INFO L290 TraceCheckUtils]: 54: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,448 INFO L290 TraceCheckUtils]: 55: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,449 INFO L290 TraceCheckUtils]: 56: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,449 INFO L290 TraceCheckUtils]: 57: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,450 INFO L290 TraceCheckUtils]: 58: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,450 INFO L290 TraceCheckUtils]: 59: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,451 INFO L290 TraceCheckUtils]: 60: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,451 INFO L290 TraceCheckUtils]: 61: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,451 INFO L290 TraceCheckUtils]: 62: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,452 INFO L290 TraceCheckUtils]: 63: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,452 INFO L290 TraceCheckUtils]: 64: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,453 INFO L290 TraceCheckUtils]: 65: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,453 INFO L290 TraceCheckUtils]: 66: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,454 INFO L290 TraceCheckUtils]: 67: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,454 INFO L290 TraceCheckUtils]: 68: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,454 INFO L290 TraceCheckUtils]: 69: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,455 INFO L290 TraceCheckUtils]: 70: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,455 INFO L290 TraceCheckUtils]: 71: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,456 INFO L290 TraceCheckUtils]: 72: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,456 INFO L290 TraceCheckUtils]: 73: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,457 INFO L290 TraceCheckUtils]: 74: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,457 INFO L290 TraceCheckUtils]: 75: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,457 INFO L290 TraceCheckUtils]: 76: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,458 INFO L290 TraceCheckUtils]: 77: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,458 INFO L290 TraceCheckUtils]: 78: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,459 INFO L290 TraceCheckUtils]: 79: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,459 INFO L290 TraceCheckUtils]: 80: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,460 INFO L290 TraceCheckUtils]: 81: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,460 INFO L290 TraceCheckUtils]: 82: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,460 INFO L290 TraceCheckUtils]: 83: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,461 INFO L290 TraceCheckUtils]: 84: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,461 INFO L290 TraceCheckUtils]: 85: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,462 INFO L290 TraceCheckUtils]: 86: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:01,462 INFO L290 TraceCheckUtils]: 87: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {35329#(not (= |ssl3_accept_#t~mem80| 8673))} is VALID [2022-04-08 15:15:01,462 INFO L290 TraceCheckUtils]: 88: Hoare triple {35329#(not (= |ssl3_accept_#t~mem80| 8673))} assume 8673 == #t~mem80;havoc #t~mem80; {35324#false} is VALID [2022-04-08 15:15:01,463 INFO L290 TraceCheckUtils]: 89: Hoare triple {35324#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {35324#false} is VALID [2022-04-08 15:15:01,463 INFO L290 TraceCheckUtils]: 90: Hoare triple {35324#false} assume 3 == ~blastFlag~0; {35324#false} is VALID [2022-04-08 15:15:01,463 INFO L290 TraceCheckUtils]: 91: Hoare triple {35324#false} assume !false; {35324#false} is VALID [2022-04-08 15:15:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 15:15:01,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:15:01,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722294405] [2022-04-08 15:15:01,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722294405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:01,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:01,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:15:01,465 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:15:01,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [999894687] [2022-04-08 15:15:01,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [999894687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:01,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:01,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:15:01,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948718408] [2022-04-08 15:15:01,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:15:01,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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 92 [2022-04-08 15:15:01,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:15:01,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:15:01,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:01,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:15:01,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:01,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:15:01,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:15:01,533 INFO L87 Difference]: Start difference. First operand 296 states and 455 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:15:03,558 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:15:04,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:04,668 INFO L93 Difference]: Finished difference Result 674 states and 1042 transitions. [2022-04-08 15:15:04,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:15:04,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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 92 [2022-04-08 15:15:04,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:15:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:15:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-08 15:15:04,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:15:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-08 15:15:04,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 564 transitions. [2022-04-08 15:15:05,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 564 edges. 564 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:05,103 INFO L225 Difference]: With dead ends: 674 [2022-04-08 15:15:05,103 INFO L226 Difference]: Without dead ends: 402 [2022-04-08 15:15:05,103 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:15:05,104 INFO L913 BasicCegarLoop]: 113 mSDtfsCounter, 108 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:15:05,104 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 324 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 469 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:15:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-04-08 15:15:05,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 323. [2022-04-08 15:15:05,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:15:05,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 402 states. Second operand has 323 states, 318 states have (on average 1.5849056603773586) internal successors, (504), 318 states have internal predecessors, (504), 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:15:05,121 INFO L74 IsIncluded]: Start isIncluded. First operand 402 states. Second operand has 323 states, 318 states have (on average 1.5849056603773586) internal successors, (504), 318 states have internal predecessors, (504), 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:15:05,121 INFO L87 Difference]: Start difference. First operand 402 states. Second operand has 323 states, 318 states have (on average 1.5849056603773586) internal successors, (504), 318 states have internal predecessors, (504), 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:15:05,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:05,130 INFO L93 Difference]: Finished difference Result 402 states and 613 transitions. [2022-04-08 15:15:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 613 transitions. [2022-04-08 15:15:05,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:05,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:05,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 323 states, 318 states have (on average 1.5849056603773586) internal successors, (504), 318 states have internal predecessors, (504), 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 402 states. [2022-04-08 15:15:05,131 INFO L87 Difference]: Start difference. First operand has 323 states, 318 states have (on average 1.5849056603773586) internal successors, (504), 318 states have internal predecessors, (504), 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 402 states. [2022-04-08 15:15:05,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:05,140 INFO L93 Difference]: Finished difference Result 402 states and 613 transitions. [2022-04-08 15:15:05,140 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 613 transitions. [2022-04-08 15:15:05,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:05,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:05,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:15:05,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:15:05,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 318 states have (on average 1.5849056603773586) internal successors, (504), 318 states have internal predecessors, (504), 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:15:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 508 transitions. [2022-04-08 15:15:05,149 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 508 transitions. Word has length 92 [2022-04-08 15:15:05,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:15:05,149 INFO L478 AbstractCegarLoop]: Abstraction has 323 states and 508 transitions. [2022-04-08 15:15:05,149 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:15:05,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 323 states and 508 transitions. [2022-04-08 15:15:05,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:05,546 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 508 transitions. [2022-04-08 15:15:05,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-04-08 15:15:05,547 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:15:05,547 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:15:05,547 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 15:15:05,547 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:15:05,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:15:05,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2039657454, now seen corresponding path program 1 times [2022-04-08 15:15:05,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:05,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [956791981] [2022-04-08 15:15:05,617 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:15:05,617 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:15:05,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2039657454, now seen corresponding path program 2 times [2022-04-08 15:15:05,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:15:05,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557657777] [2022-04-08 15:15:05,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:15:05,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:15:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:05,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:15:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:05,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {38140#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {38133#true} is VALID [2022-04-08 15:15:05,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {38133#true} assume true; {38133#true} is VALID [2022-04-08 15:15:05,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38133#true} {38133#true} #661#return; {38133#true} is VALID [2022-04-08 15:15:05,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {38133#true} call ULTIMATE.init(); {38140#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:15:05,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {38140#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {38133#true} is VALID [2022-04-08 15:15:05,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {38133#true} assume true; {38133#true} is VALID [2022-04-08 15:15:05,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38133#true} {38133#true} #661#return; {38133#true} is VALID [2022-04-08 15:15:05,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {38133#true} call #t~ret161 := main(); {38133#true} is VALID [2022-04-08 15:15:05,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {38133#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {38133#true} is VALID [2022-04-08 15:15:05,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {38133#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {38133#true} is VALID [2022-04-08 15:15:05,755 INFO L272 TraceCheckUtils]: 7: Hoare triple {38133#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {38133#true} is VALID [2022-04-08 15:15:05,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {38133#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {38133#true} is VALID [2022-04-08 15:15:05,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {38133#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {38133#true} is VALID [2022-04-08 15:15:05,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {38133#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {38133#true} is VALID [2022-04-08 15:15:05,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {38133#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {38133#true} is VALID [2022-04-08 15:15:05,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {38133#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {38133#true} is VALID [2022-04-08 15:15:05,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {38133#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {38133#true} is VALID [2022-04-08 15:15:05,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {38133#true} assume !false; {38133#true} is VALID [2022-04-08 15:15:05,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {38133#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {38133#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {38133#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {38133#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {38133#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {38133#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {38133#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {38133#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {38133#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {38133#true} assume 8464 == #t~mem55;havoc #t~mem55; {38133#true} is VALID [2022-04-08 15:15:05,758 INFO L290 TraceCheckUtils]: 25: Hoare triple {38133#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {38133#true} is VALID [2022-04-08 15:15:05,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {38133#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {38133#true} is VALID [2022-04-08 15:15:05,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {38133#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {38133#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {38133#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {38133#true} is VALID [2022-04-08 15:15:05,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {38133#true} ~skip~0 := 0; {38133#true} is VALID [2022-04-08 15:15:05,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {38133#true} assume !false; {38133#true} is VALID [2022-04-08 15:15:05,758 INFO L290 TraceCheckUtils]: 32: Hoare triple {38133#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,758 INFO L290 TraceCheckUtils]: 33: Hoare triple {38133#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {38133#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,759 INFO L290 TraceCheckUtils]: 35: Hoare triple {38133#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,759 INFO L290 TraceCheckUtils]: 36: Hoare triple {38133#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,759 INFO L290 TraceCheckUtils]: 37: Hoare triple {38133#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,759 INFO L290 TraceCheckUtils]: 38: Hoare triple {38133#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,759 INFO L290 TraceCheckUtils]: 39: Hoare triple {38133#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,759 INFO L290 TraceCheckUtils]: 40: Hoare triple {38133#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,759 INFO L290 TraceCheckUtils]: 41: Hoare triple {38133#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,760 INFO L290 TraceCheckUtils]: 42: Hoare triple {38133#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,760 INFO L290 TraceCheckUtils]: 43: Hoare triple {38133#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,760 INFO L290 TraceCheckUtils]: 44: Hoare triple {38133#true} assume 8496 == #t~mem58;havoc #t~mem58; {38133#true} is VALID [2022-04-08 15:15:05,760 INFO L290 TraceCheckUtils]: 45: Hoare triple {38133#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {38133#true} is VALID [2022-04-08 15:15:05,760 INFO L290 TraceCheckUtils]: 46: Hoare triple {38133#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {38133#true} is VALID [2022-04-08 15:15:05,760 INFO L290 TraceCheckUtils]: 47: Hoare triple {38133#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {38133#true} is VALID [2022-04-08 15:15:05,761 INFO L290 TraceCheckUtils]: 48: Hoare triple {38133#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,762 INFO L290 TraceCheckUtils]: 49: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,762 INFO L290 TraceCheckUtils]: 50: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,763 INFO L290 TraceCheckUtils]: 51: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,763 INFO L290 TraceCheckUtils]: 52: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,764 INFO L290 TraceCheckUtils]: 53: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,764 INFO L290 TraceCheckUtils]: 54: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,764 INFO L290 TraceCheckUtils]: 55: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,765 INFO L290 TraceCheckUtils]: 56: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,765 INFO L290 TraceCheckUtils]: 57: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,766 INFO L290 TraceCheckUtils]: 59: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,767 INFO L290 TraceCheckUtils]: 60: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,767 INFO L290 TraceCheckUtils]: 61: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,767 INFO L290 TraceCheckUtils]: 62: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,768 INFO L290 TraceCheckUtils]: 63: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,768 INFO L290 TraceCheckUtils]: 64: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,769 INFO L290 TraceCheckUtils]: 65: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,769 INFO L290 TraceCheckUtils]: 66: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,770 INFO L290 TraceCheckUtils]: 67: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,770 INFO L290 TraceCheckUtils]: 68: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,771 INFO L290 TraceCheckUtils]: 69: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,771 INFO L290 TraceCheckUtils]: 70: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,771 INFO L290 TraceCheckUtils]: 71: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,772 INFO L290 TraceCheckUtils]: 72: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,772 INFO L290 TraceCheckUtils]: 73: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,773 INFO L290 TraceCheckUtils]: 74: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:15:05,773 INFO L290 TraceCheckUtils]: 75: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {38139#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-08 15:15:05,773 INFO L290 TraceCheckUtils]: 76: Hoare triple {38139#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {38134#false} is VALID [2022-04-08 15:15:05,774 INFO L290 TraceCheckUtils]: 77: Hoare triple {38134#false} assume !(~num1~0 > 0); {38134#false} is VALID [2022-04-08 15:15:05,774 INFO L290 TraceCheckUtils]: 78: Hoare triple {38134#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {38134#false} is VALID [2022-04-08 15:15:05,774 INFO L290 TraceCheckUtils]: 79: Hoare triple {38134#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,774 INFO L290 TraceCheckUtils]: 80: Hoare triple {38134#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {38134#false} is VALID [2022-04-08 15:15:05,774 INFO L290 TraceCheckUtils]: 81: Hoare triple {38134#false} ~skip~0 := 0; {38134#false} is VALID [2022-04-08 15:15:05,774 INFO L290 TraceCheckUtils]: 82: Hoare triple {38134#false} assume !false; {38134#false} is VALID [2022-04-08 15:15:05,774 INFO L290 TraceCheckUtils]: 83: Hoare triple {38134#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,774 INFO L290 TraceCheckUtils]: 84: Hoare triple {38134#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,774 INFO L290 TraceCheckUtils]: 85: Hoare triple {38134#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,774 INFO L290 TraceCheckUtils]: 86: Hoare triple {38134#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,775 INFO L290 TraceCheckUtils]: 87: Hoare triple {38134#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,775 INFO L290 TraceCheckUtils]: 88: Hoare triple {38134#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,775 INFO L290 TraceCheckUtils]: 89: Hoare triple {38134#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,775 INFO L290 TraceCheckUtils]: 90: Hoare triple {38134#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,775 INFO L290 TraceCheckUtils]: 91: Hoare triple {38134#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,775 INFO L290 TraceCheckUtils]: 92: Hoare triple {38134#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,775 INFO L290 TraceCheckUtils]: 93: Hoare triple {38134#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,775 INFO L290 TraceCheckUtils]: 94: Hoare triple {38134#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,775 INFO L290 TraceCheckUtils]: 95: Hoare triple {38134#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,775 INFO L290 TraceCheckUtils]: 96: Hoare triple {38134#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,776 INFO L290 TraceCheckUtils]: 97: Hoare triple {38134#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,776 INFO L290 TraceCheckUtils]: 98: Hoare triple {38134#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,776 INFO L290 TraceCheckUtils]: 99: Hoare triple {38134#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,776 INFO L290 TraceCheckUtils]: 100: Hoare triple {38134#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,776 INFO L290 TraceCheckUtils]: 101: Hoare triple {38134#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,776 INFO L290 TraceCheckUtils]: 102: Hoare triple {38134#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,776 INFO L290 TraceCheckUtils]: 103: Hoare triple {38134#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,776 INFO L290 TraceCheckUtils]: 104: Hoare triple {38134#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,776 INFO L290 TraceCheckUtils]: 105: Hoare triple {38134#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,776 INFO L290 TraceCheckUtils]: 106: Hoare triple {38134#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,777 INFO L290 TraceCheckUtils]: 107: Hoare triple {38134#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,777 INFO L290 TraceCheckUtils]: 108: Hoare triple {38134#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,777 INFO L290 TraceCheckUtils]: 109: Hoare triple {38134#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,777 INFO L290 TraceCheckUtils]: 110: Hoare triple {38134#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,777 INFO L290 TraceCheckUtils]: 111: Hoare triple {38134#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,777 INFO L290 TraceCheckUtils]: 112: Hoare triple {38134#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,777 INFO L290 TraceCheckUtils]: 113: Hoare triple {38134#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,777 INFO L290 TraceCheckUtils]: 114: Hoare triple {38134#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,777 INFO L290 TraceCheckUtils]: 115: Hoare triple {38134#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-08 15:15:05,777 INFO L290 TraceCheckUtils]: 116: Hoare triple {38134#false} assume 8672 == #t~mem79;havoc #t~mem79; {38134#false} is VALID [2022-04-08 15:15:05,777 INFO L290 TraceCheckUtils]: 117: Hoare triple {38134#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {38134#false} is VALID [2022-04-08 15:15:05,778 INFO L290 TraceCheckUtils]: 118: Hoare triple {38134#false} assume 3 == ~blastFlag~0; {38134#false} is VALID [2022-04-08 15:15:05,778 INFO L290 TraceCheckUtils]: 119: Hoare triple {38134#false} assume !false; {38134#false} is VALID [2022-04-08 15:15:05,778 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 15:15:05,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:15:05,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557657777] [2022-04-08 15:15:05,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557657777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:05,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:05,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:15:05,779 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:15:05,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [956791981] [2022-04-08 15:15:05,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [956791981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:05,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:05,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:15:05,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922601179] [2022-04-08 15:15:05,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:15:05,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 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 120 [2022-04-08 15:15:05,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:15:05,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 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:15:05,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:05,867 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:15:05,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:05,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:15:05,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:15:05,868 INFO L87 Difference]: Start difference. First operand 323 states and 508 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 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:15:07,895 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:15:09,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:09,065 INFO L93 Difference]: Finished difference Result 738 states and 1162 transitions. [2022-04-08 15:15:09,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:15:09,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 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 120 [2022-04-08 15:15:09,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:15:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 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:15:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 558 transitions. [2022-04-08 15:15:09,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 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:15:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 558 transitions. [2022-04-08 15:15:09,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 558 transitions. [2022-04-08 15:15:09,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 558 edges. 558 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:09,459 INFO L225 Difference]: With dead ends: 738 [2022-04-08 15:15:09,459 INFO L226 Difference]: Without dead ends: 441 [2022-04-08 15:15:09,460 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:15:09,460 INFO L913 BasicCegarLoop]: 121 mSDtfsCounter, 116 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:15:09,460 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 340 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:15:09,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-04-08 15:15:09,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 355. [2022-04-08 15:15:09,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:15:09,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 441 states. Second operand has 355 states, 350 states have (on average 1.5914285714285714) internal successors, (557), 350 states have internal predecessors, (557), 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:15:09,478 INFO L74 IsIncluded]: Start isIncluded. First operand 441 states. Second operand has 355 states, 350 states have (on average 1.5914285714285714) internal successors, (557), 350 states have internal predecessors, (557), 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:15:09,478 INFO L87 Difference]: Start difference. First operand 441 states. Second operand has 355 states, 350 states have (on average 1.5914285714285714) internal successors, (557), 350 states have internal predecessors, (557), 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:15:09,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:09,488 INFO L93 Difference]: Finished difference Result 441 states and 681 transitions. [2022-04-08 15:15:09,489 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 681 transitions. [2022-04-08 15:15:09,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:09,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:09,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 355 states, 350 states have (on average 1.5914285714285714) internal successors, (557), 350 states have internal predecessors, (557), 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 441 states. [2022-04-08 15:15:09,490 INFO L87 Difference]: Start difference. First operand has 355 states, 350 states have (on average 1.5914285714285714) internal successors, (557), 350 states have internal predecessors, (557), 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 441 states. [2022-04-08 15:15:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:09,500 INFO L93 Difference]: Finished difference Result 441 states and 681 transitions. [2022-04-08 15:15:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 681 transitions. [2022-04-08 15:15:09,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:09,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:09,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:15:09,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:15:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 350 states have (on average 1.5914285714285714) internal successors, (557), 350 states have internal predecessors, (557), 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:15:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 561 transitions. [2022-04-08 15:15:09,510 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 561 transitions. Word has length 120 [2022-04-08 15:15:09,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:15:09,510 INFO L478 AbstractCegarLoop]: Abstraction has 355 states and 561 transitions. [2022-04-08 15:15:09,510 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 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:15:09,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 355 states and 561 transitions. [2022-04-08 15:15:09,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 561 edges. 561 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:09,945 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 561 transitions. [2022-04-08 15:15:09,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-08 15:15:09,946 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:15:09,946 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:15:09,946 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 15:15:09,946 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:15:09,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:15:09,947 INFO L85 PathProgramCache]: Analyzing trace with hash 276674396, now seen corresponding path program 1 times [2022-04-08 15:15:09,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:09,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [591187248] [2022-04-08 15:15:10,042 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:15:10,043 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:15:10,043 INFO L85 PathProgramCache]: Analyzing trace with hash 276674396, now seen corresponding path program 2 times [2022-04-08 15:15:10,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:15:10,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491952179] [2022-04-08 15:15:10,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:15:10,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:15:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:10,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:15:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:10,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {41220#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {41213#true} is VALID [2022-04-08 15:15:10,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {41213#true} assume true; {41213#true} is VALID [2022-04-08 15:15:10,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41213#true} {41213#true} #661#return; {41213#true} is VALID [2022-04-08 15:15:10,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {41213#true} call ULTIMATE.init(); {41220#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:15:10,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {41220#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {41213#true} is VALID [2022-04-08 15:15:10,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {41213#true} assume true; {41213#true} is VALID [2022-04-08 15:15:10,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41213#true} {41213#true} #661#return; {41213#true} is VALID [2022-04-08 15:15:10,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {41213#true} call #t~ret161 := main(); {41213#true} is VALID [2022-04-08 15:15:10,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {41213#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {41213#true} is VALID [2022-04-08 15:15:10,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {41213#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {41213#true} is VALID [2022-04-08 15:15:10,177 INFO L272 TraceCheckUtils]: 7: Hoare triple {41213#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {41213#true} is VALID [2022-04-08 15:15:10,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {41213#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {41213#true} is VALID [2022-04-08 15:15:10,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {41213#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {41213#true} is VALID [2022-04-08 15:15:10,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {41213#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {41213#true} is VALID [2022-04-08 15:15:10,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {41213#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {41213#true} is VALID [2022-04-08 15:15:10,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {41213#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {41213#true} is VALID [2022-04-08 15:15:10,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {41213#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {41213#true} is VALID [2022-04-08 15:15:10,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {41213#true} assume !false; {41213#true} is VALID [2022-04-08 15:15:10,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {41213#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41213#true} is VALID [2022-04-08 15:15:10,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {41213#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41213#true} is VALID [2022-04-08 15:15:10,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {41213#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41213#true} is VALID [2022-04-08 15:15:10,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {41213#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41213#true} is VALID [2022-04-08 15:15:10,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {41213#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41213#true} is VALID [2022-04-08 15:15:10,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {41213#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41213#true} is VALID [2022-04-08 15:15:10,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {41213#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41213#true} is VALID [2022-04-08 15:15:10,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {41213#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41213#true} is VALID [2022-04-08 15:15:10,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {41213#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41213#true} is VALID [2022-04-08 15:15:10,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {41213#true} assume 8464 == #t~mem55;havoc #t~mem55; {41213#true} is VALID [2022-04-08 15:15:10,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {41213#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {41213#true} is VALID [2022-04-08 15:15:10,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {41213#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {41213#true} is VALID [2022-04-08 15:15:10,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {41213#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {41218#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:15:10,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {41218#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {41218#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:15:10,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {41218#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41218#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:15:10,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {41218#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {41218#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:15:10,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {41218#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {41218#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:15:10,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {41218#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41219#(= |ssl3_accept_#t~mem47| 8496)} is VALID [2022-04-08 15:15:10,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {41219#(= |ssl3_accept_#t~mem47| 8496)} assume 12292 == #t~mem47;havoc #t~mem47; {41214#false} is VALID [2022-04-08 15:15:10,182 INFO L290 TraceCheckUtils]: 34: Hoare triple {41214#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {41214#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {41214#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {41214#false} is VALID [2022-04-08 15:15:10,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {41214#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,183 INFO L290 TraceCheckUtils]: 38: Hoare triple {41214#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {41214#false} is VALID [2022-04-08 15:15:10,183 INFO L290 TraceCheckUtils]: 39: Hoare triple {41214#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {41214#false} is VALID [2022-04-08 15:15:10,183 INFO L290 TraceCheckUtils]: 40: Hoare triple {41214#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,183 INFO L290 TraceCheckUtils]: 41: Hoare triple {41214#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,183 INFO L290 TraceCheckUtils]: 42: Hoare triple {41214#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,184 INFO L290 TraceCheckUtils]: 43: Hoare triple {41214#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41214#false} is VALID [2022-04-08 15:15:10,185 INFO L290 TraceCheckUtils]: 44: Hoare triple {41214#false} ~skip~0 := 0; {41214#false} is VALID [2022-04-08 15:15:10,185 INFO L290 TraceCheckUtils]: 45: Hoare triple {41214#false} assume !false; {41214#false} is VALID [2022-04-08 15:15:10,185 INFO L290 TraceCheckUtils]: 46: Hoare triple {41214#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,185 INFO L290 TraceCheckUtils]: 47: Hoare triple {41214#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,185 INFO L290 TraceCheckUtils]: 48: Hoare triple {41214#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,185 INFO L290 TraceCheckUtils]: 49: Hoare triple {41214#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,185 INFO L290 TraceCheckUtils]: 50: Hoare triple {41214#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,185 INFO L290 TraceCheckUtils]: 51: Hoare triple {41214#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,185 INFO L290 TraceCheckUtils]: 52: Hoare triple {41214#false} assume 8480 == #t~mem52;havoc #t~mem52; {41214#false} is VALID [2022-04-08 15:15:10,185 INFO L290 TraceCheckUtils]: 53: Hoare triple {41214#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {41214#false} is VALID [2022-04-08 15:15:10,186 INFO L290 TraceCheckUtils]: 54: Hoare triple {41214#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,186 INFO L290 TraceCheckUtils]: 55: Hoare triple {41214#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,186 INFO L290 TraceCheckUtils]: 56: Hoare triple {41214#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41214#false} is VALID [2022-04-08 15:15:10,186 INFO L290 TraceCheckUtils]: 57: Hoare triple {41214#false} ~skip~0 := 0; {41214#false} is VALID [2022-04-08 15:15:10,186 INFO L290 TraceCheckUtils]: 58: Hoare triple {41214#false} assume !false; {41214#false} is VALID [2022-04-08 15:15:10,186 INFO L290 TraceCheckUtils]: 59: Hoare triple {41214#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,186 INFO L290 TraceCheckUtils]: 60: Hoare triple {41214#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,186 INFO L290 TraceCheckUtils]: 61: Hoare triple {41214#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,186 INFO L290 TraceCheckUtils]: 62: Hoare triple {41214#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,186 INFO L290 TraceCheckUtils]: 63: Hoare triple {41214#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,187 INFO L290 TraceCheckUtils]: 64: Hoare triple {41214#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,187 INFO L290 TraceCheckUtils]: 65: Hoare triple {41214#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,187 INFO L290 TraceCheckUtils]: 66: Hoare triple {41214#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,187 INFO L290 TraceCheckUtils]: 67: Hoare triple {41214#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,187 INFO L290 TraceCheckUtils]: 68: Hoare triple {41214#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,187 INFO L290 TraceCheckUtils]: 69: Hoare triple {41214#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,187 INFO L290 TraceCheckUtils]: 70: Hoare triple {41214#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,187 INFO L290 TraceCheckUtils]: 71: Hoare triple {41214#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,187 INFO L290 TraceCheckUtils]: 72: Hoare triple {41214#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,187 INFO L290 TraceCheckUtils]: 73: Hoare triple {41214#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,187 INFO L290 TraceCheckUtils]: 74: Hoare triple {41214#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,188 INFO L290 TraceCheckUtils]: 75: Hoare triple {41214#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,188 INFO L290 TraceCheckUtils]: 76: Hoare triple {41214#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,188 INFO L290 TraceCheckUtils]: 77: Hoare triple {41214#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,188 INFO L290 TraceCheckUtils]: 78: Hoare triple {41214#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,188 INFO L290 TraceCheckUtils]: 79: Hoare triple {41214#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,188 INFO L290 TraceCheckUtils]: 80: Hoare triple {41214#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,188 INFO L290 TraceCheckUtils]: 81: Hoare triple {41214#false} assume 8448 == #t~mem68;havoc #t~mem68; {41214#false} is VALID [2022-04-08 15:15:10,188 INFO L290 TraceCheckUtils]: 82: Hoare triple {41214#false} assume !(~num1~0 > 0); {41214#false} is VALID [2022-04-08 15:15:10,188 INFO L290 TraceCheckUtils]: 83: Hoare triple {41214#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {41214#false} is VALID [2022-04-08 15:15:10,188 INFO L290 TraceCheckUtils]: 84: Hoare triple {41214#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,188 INFO L290 TraceCheckUtils]: 85: Hoare triple {41214#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41214#false} is VALID [2022-04-08 15:15:10,189 INFO L290 TraceCheckUtils]: 86: Hoare triple {41214#false} ~skip~0 := 0; {41214#false} is VALID [2022-04-08 15:15:10,189 INFO L290 TraceCheckUtils]: 87: Hoare triple {41214#false} assume !false; {41214#false} is VALID [2022-04-08 15:15:10,189 INFO L290 TraceCheckUtils]: 88: Hoare triple {41214#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,189 INFO L290 TraceCheckUtils]: 89: Hoare triple {41214#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,189 INFO L290 TraceCheckUtils]: 90: Hoare triple {41214#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,189 INFO L290 TraceCheckUtils]: 91: Hoare triple {41214#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,189 INFO L290 TraceCheckUtils]: 92: Hoare triple {41214#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,189 INFO L290 TraceCheckUtils]: 93: Hoare triple {41214#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,189 INFO L290 TraceCheckUtils]: 94: Hoare triple {41214#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,189 INFO L290 TraceCheckUtils]: 95: Hoare triple {41214#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,190 INFO L290 TraceCheckUtils]: 96: Hoare triple {41214#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,190 INFO L290 TraceCheckUtils]: 97: Hoare triple {41214#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,190 INFO L290 TraceCheckUtils]: 98: Hoare triple {41214#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,190 INFO L290 TraceCheckUtils]: 99: Hoare triple {41214#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,190 INFO L290 TraceCheckUtils]: 100: Hoare triple {41214#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,190 INFO L290 TraceCheckUtils]: 101: Hoare triple {41214#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,190 INFO L290 TraceCheckUtils]: 102: Hoare triple {41214#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,190 INFO L290 TraceCheckUtils]: 103: Hoare triple {41214#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,190 INFO L290 TraceCheckUtils]: 104: Hoare triple {41214#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,190 INFO L290 TraceCheckUtils]: 105: Hoare triple {41214#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,191 INFO L290 TraceCheckUtils]: 106: Hoare triple {41214#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,191 INFO L290 TraceCheckUtils]: 107: Hoare triple {41214#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,191 INFO L290 TraceCheckUtils]: 108: Hoare triple {41214#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,191 INFO L290 TraceCheckUtils]: 109: Hoare triple {41214#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,191 INFO L290 TraceCheckUtils]: 110: Hoare triple {41214#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,191 INFO L290 TraceCheckUtils]: 111: Hoare triple {41214#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,191 INFO L290 TraceCheckUtils]: 112: Hoare triple {41214#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,191 INFO L290 TraceCheckUtils]: 113: Hoare triple {41214#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,191 INFO L290 TraceCheckUtils]: 114: Hoare triple {41214#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,191 INFO L290 TraceCheckUtils]: 115: Hoare triple {41214#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,192 INFO L290 TraceCheckUtils]: 116: Hoare triple {41214#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,192 INFO L290 TraceCheckUtils]: 117: Hoare triple {41214#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,192 INFO L290 TraceCheckUtils]: 118: Hoare triple {41214#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,192 INFO L290 TraceCheckUtils]: 119: Hoare triple {41214#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,192 INFO L290 TraceCheckUtils]: 120: Hoare triple {41214#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-08 15:15:10,192 INFO L290 TraceCheckUtils]: 121: Hoare triple {41214#false} assume 8672 == #t~mem79;havoc #t~mem79; {41214#false} is VALID [2022-04-08 15:15:10,192 INFO L290 TraceCheckUtils]: 122: Hoare triple {41214#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {41214#false} is VALID [2022-04-08 15:15:10,192 INFO L290 TraceCheckUtils]: 123: Hoare triple {41214#false} assume 3 == ~blastFlag~0; {41214#false} is VALID [2022-04-08 15:15:10,192 INFO L290 TraceCheckUtils]: 124: Hoare triple {41214#false} assume !false; {41214#false} is VALID [2022-04-08 15:15:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-08 15:15:10,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:15:10,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491952179] [2022-04-08 15:15:10,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491952179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:10,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:10,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:15:10,193 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:15:10,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [591187248] [2022-04-08 15:15:10,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [591187248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:10,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:10,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:15:10,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192418620] [2022-04-08 15:15:10,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:15:10,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 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 125 [2022-04-08 15:15:10,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:15:10,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 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:15:10,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:10,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:15:10,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:10,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:15:10,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:15:10,269 INFO L87 Difference]: Start difference. First operand 355 states and 561 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 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:15:12,294 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:15:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:13,208 INFO L93 Difference]: Finished difference Result 692 states and 1104 transitions. [2022-04-08 15:15:13,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:15:13,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 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 125 [2022-04-08 15:15:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:15:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 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:15:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-08 15:15:13,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 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:15:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-08 15:15:13,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 434 transitions. [2022-04-08 15:15:13,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:13,517 INFO L225 Difference]: With dead ends: 692 [2022-04-08 15:15:13,517 INFO L226 Difference]: Without dead ends: 363 [2022-04-08 15:15:13,518 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:15:13,518 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 32 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:15:13,519 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 495 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:15:13,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-04-08 15:15:13,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 355. [2022-04-08 15:15:13,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:15:13,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand has 355 states, 350 states have (on average 1.5885714285714285) internal successors, (556), 350 states have internal predecessors, (556), 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:15:13,536 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand has 355 states, 350 states have (on average 1.5885714285714285) internal successors, (556), 350 states have internal predecessors, (556), 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:15:13,536 INFO L87 Difference]: Start difference. First operand 363 states. Second operand has 355 states, 350 states have (on average 1.5885714285714285) internal successors, (556), 350 states have internal predecessors, (556), 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:15:13,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:13,544 INFO L93 Difference]: Finished difference Result 363 states and 572 transitions. [2022-04-08 15:15:13,544 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 572 transitions. [2022-04-08 15:15:13,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:13,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:13,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 355 states, 350 states have (on average 1.5885714285714285) internal successors, (556), 350 states have internal predecessors, (556), 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 363 states. [2022-04-08 15:15:13,545 INFO L87 Difference]: Start difference. First operand has 355 states, 350 states have (on average 1.5885714285714285) internal successors, (556), 350 states have internal predecessors, (556), 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 363 states. [2022-04-08 15:15:13,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:13,552 INFO L93 Difference]: Finished difference Result 363 states and 572 transitions. [2022-04-08 15:15:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 572 transitions. [2022-04-08 15:15:13,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:13,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:13,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:15:13,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:15:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 350 states have (on average 1.5885714285714285) internal successors, (556), 350 states have internal predecessors, (556), 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:15:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 560 transitions. [2022-04-08 15:15:13,562 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 560 transitions. Word has length 125 [2022-04-08 15:15:13,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:15:13,562 INFO L478 AbstractCegarLoop]: Abstraction has 355 states and 560 transitions. [2022-04-08 15:15:13,563 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 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:15:13,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 355 states and 560 transitions. [2022-04-08 15:15:14,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 560 edges. 560 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:14,087 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 560 transitions. [2022-04-08 15:15:14,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-08 15:15:14,088 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:15:14,088 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:14,089 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 15:15:14,089 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:15:14,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:15:14,089 INFO L85 PathProgramCache]: Analyzing trace with hash -489530676, now seen corresponding path program 1 times [2022-04-08 15:15:14,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:14,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [231037048] [2022-04-08 15:15:14,179 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:15:14,180 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:15:14,180 INFO L85 PathProgramCache]: Analyzing trace with hash -489530676, now seen corresponding path program 2 times [2022-04-08 15:15:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:15:14,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633521982] [2022-04-08 15:15:14,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:15:14,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:15:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:14,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:15:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:14,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {44054#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {44045#true} is VALID [2022-04-08 15:15:14,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {44045#true} assume true; {44045#true} is VALID [2022-04-08 15:15:14,721 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44045#true} {44045#true} #661#return; {44045#true} is VALID [2022-04-08 15:15:14,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {44045#true} call ULTIMATE.init(); {44054#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:15:14,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {44054#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {44045#true} is VALID [2022-04-08 15:15:14,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {44045#true} assume true; {44045#true} is VALID [2022-04-08 15:15:14,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44045#true} {44045#true} #661#return; {44045#true} is VALID [2022-04-08 15:15:14,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {44045#true} call #t~ret161 := main(); {44045#true} is VALID [2022-04-08 15:15:14,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {44045#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {44045#true} is VALID [2022-04-08 15:15:14,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {44045#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {44050#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} is VALID [2022-04-08 15:15:14,725 INFO L272 TraceCheckUtils]: 7: Hoare triple {44050#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {44051#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} is VALID [2022-04-08 15:15:14,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {44051#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {44052#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-08 15:15:14,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {44052#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {44052#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-08 15:15:14,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {44052#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {44052#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-08 15:15:14,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {44052#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {44052#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-08 15:15:14,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {44052#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {44053#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-08 15:15:14,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {44053#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {44046#false} is VALID [2022-04-08 15:15:14,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {44046#false} assume !false; {44046#false} is VALID [2022-04-08 15:15:14,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {44046#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {44046#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {44046#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {44046#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {44046#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {44046#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {44046#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {44046#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {44046#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {44046#false} assume 8464 == #t~mem55;havoc #t~mem55; {44046#false} is VALID [2022-04-08 15:15:14,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {44046#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {44046#false} is VALID [2022-04-08 15:15:14,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {44046#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {44046#false} is VALID [2022-04-08 15:15:14,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {44046#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {44046#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {44046#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44046#false} is VALID [2022-04-08 15:15:14,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {44046#false} ~skip~0 := 0; {44046#false} is VALID [2022-04-08 15:15:14,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {44046#false} assume !false; {44046#false} is VALID [2022-04-08 15:15:14,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {44046#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,733 INFO L290 TraceCheckUtils]: 33: Hoare triple {44046#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {44046#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,733 INFO L290 TraceCheckUtils]: 35: Hoare triple {44046#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {44046#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {44046#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {44046#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {44046#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {44046#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {44046#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,733 INFO L290 TraceCheckUtils]: 42: Hoare triple {44046#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,733 INFO L290 TraceCheckUtils]: 43: Hoare triple {44046#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,734 INFO L290 TraceCheckUtils]: 44: Hoare triple {44046#false} assume 8496 == #t~mem58;havoc #t~mem58; {44046#false} is VALID [2022-04-08 15:15:14,734 INFO L290 TraceCheckUtils]: 45: Hoare triple {44046#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {44046#false} is VALID [2022-04-08 15:15:14,734 INFO L290 TraceCheckUtils]: 46: Hoare triple {44046#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {44046#false} is VALID [2022-04-08 15:15:14,734 INFO L290 TraceCheckUtils]: 47: Hoare triple {44046#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,734 INFO L290 TraceCheckUtils]: 48: Hoare triple {44046#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,734 INFO L290 TraceCheckUtils]: 49: Hoare triple {44046#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,734 INFO L290 TraceCheckUtils]: 50: Hoare triple {44046#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {44046#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44046#false} is VALID [2022-04-08 15:15:14,734 INFO L290 TraceCheckUtils]: 52: Hoare triple {44046#false} ~skip~0 := 0; {44046#false} is VALID [2022-04-08 15:15:14,734 INFO L290 TraceCheckUtils]: 53: Hoare triple {44046#false} assume !false; {44046#false} is VALID [2022-04-08 15:15:14,734 INFO L290 TraceCheckUtils]: 54: Hoare triple {44046#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,735 INFO L290 TraceCheckUtils]: 55: Hoare triple {44046#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,735 INFO L290 TraceCheckUtils]: 56: Hoare triple {44046#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,735 INFO L290 TraceCheckUtils]: 57: Hoare triple {44046#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,735 INFO L290 TraceCheckUtils]: 58: Hoare triple {44046#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,735 INFO L290 TraceCheckUtils]: 59: Hoare triple {44046#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,735 INFO L290 TraceCheckUtils]: 60: Hoare triple {44046#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,735 INFO L290 TraceCheckUtils]: 61: Hoare triple {44046#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,735 INFO L290 TraceCheckUtils]: 62: Hoare triple {44046#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,735 INFO L290 TraceCheckUtils]: 63: Hoare triple {44046#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,735 INFO L290 TraceCheckUtils]: 64: Hoare triple {44046#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,735 INFO L290 TraceCheckUtils]: 65: Hoare triple {44046#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,736 INFO L290 TraceCheckUtils]: 66: Hoare triple {44046#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,736 INFO L290 TraceCheckUtils]: 67: Hoare triple {44046#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,736 INFO L290 TraceCheckUtils]: 68: Hoare triple {44046#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,736 INFO L290 TraceCheckUtils]: 69: Hoare triple {44046#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,736 INFO L290 TraceCheckUtils]: 70: Hoare triple {44046#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,736 INFO L290 TraceCheckUtils]: 71: Hoare triple {44046#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,736 INFO L290 TraceCheckUtils]: 72: Hoare triple {44046#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,736 INFO L290 TraceCheckUtils]: 73: Hoare triple {44046#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,736 INFO L290 TraceCheckUtils]: 74: Hoare triple {44046#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,736 INFO L290 TraceCheckUtils]: 75: Hoare triple {44046#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,736 INFO L290 TraceCheckUtils]: 76: Hoare triple {44046#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,737 INFO L290 TraceCheckUtils]: 77: Hoare triple {44046#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,737 INFO L290 TraceCheckUtils]: 78: Hoare triple {44046#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,737 INFO L290 TraceCheckUtils]: 79: Hoare triple {44046#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,737 INFO L290 TraceCheckUtils]: 80: Hoare triple {44046#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,737 INFO L290 TraceCheckUtils]: 81: Hoare triple {44046#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,737 INFO L290 TraceCheckUtils]: 82: Hoare triple {44046#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,737 INFO L290 TraceCheckUtils]: 83: Hoare triple {44046#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,737 INFO L290 TraceCheckUtils]: 84: Hoare triple {44046#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,737 INFO L290 TraceCheckUtils]: 85: Hoare triple {44046#false} assume 8656 == #t~mem77;havoc #t~mem77; {44046#false} is VALID [2022-04-08 15:15:14,737 INFO L290 TraceCheckUtils]: 86: Hoare triple {44046#false} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {44046#false} is VALID [2022-04-08 15:15:14,738 INFO L290 TraceCheckUtils]: 87: Hoare triple {44046#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {44046#false} is VALID [2022-04-08 15:15:14,738 INFO L290 TraceCheckUtils]: 88: Hoare triple {44046#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {44046#false} is VALID [2022-04-08 15:15:14,738 INFO L290 TraceCheckUtils]: 89: Hoare triple {44046#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,738 INFO L290 TraceCheckUtils]: 90: Hoare triple {44046#false} assume !(0 == ~tmp___10~0); {44046#false} is VALID [2022-04-08 15:15:14,738 INFO L290 TraceCheckUtils]: 91: Hoare triple {44046#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,738 INFO L290 TraceCheckUtils]: 92: Hoare triple {44046#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44046#false} is VALID [2022-04-08 15:15:14,738 INFO L290 TraceCheckUtils]: 93: Hoare triple {44046#false} ~skip~0 := 0; {44046#false} is VALID [2022-04-08 15:15:14,738 INFO L290 TraceCheckUtils]: 94: Hoare triple {44046#false} assume !false; {44046#false} is VALID [2022-04-08 15:15:14,738 INFO L290 TraceCheckUtils]: 95: Hoare triple {44046#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,738 INFO L290 TraceCheckUtils]: 96: Hoare triple {44046#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,738 INFO L290 TraceCheckUtils]: 97: Hoare triple {44046#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,739 INFO L290 TraceCheckUtils]: 98: Hoare triple {44046#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,739 INFO L290 TraceCheckUtils]: 99: Hoare triple {44046#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,739 INFO L290 TraceCheckUtils]: 100: Hoare triple {44046#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,739 INFO L290 TraceCheckUtils]: 101: Hoare triple {44046#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,739 INFO L290 TraceCheckUtils]: 102: Hoare triple {44046#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,739 INFO L290 TraceCheckUtils]: 103: Hoare triple {44046#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,739 INFO L290 TraceCheckUtils]: 104: Hoare triple {44046#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,739 INFO L290 TraceCheckUtils]: 105: Hoare triple {44046#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,739 INFO L290 TraceCheckUtils]: 106: Hoare triple {44046#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,739 INFO L290 TraceCheckUtils]: 107: Hoare triple {44046#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,739 INFO L290 TraceCheckUtils]: 108: Hoare triple {44046#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,740 INFO L290 TraceCheckUtils]: 109: Hoare triple {44046#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,740 INFO L290 TraceCheckUtils]: 110: Hoare triple {44046#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,740 INFO L290 TraceCheckUtils]: 111: Hoare triple {44046#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,740 INFO L290 TraceCheckUtils]: 112: Hoare triple {44046#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,740 INFO L290 TraceCheckUtils]: 113: Hoare triple {44046#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,740 INFO L290 TraceCheckUtils]: 114: Hoare triple {44046#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,740 INFO L290 TraceCheckUtils]: 115: Hoare triple {44046#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,740 INFO L290 TraceCheckUtils]: 116: Hoare triple {44046#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,740 INFO L290 TraceCheckUtils]: 117: Hoare triple {44046#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,740 INFO L290 TraceCheckUtils]: 118: Hoare triple {44046#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,741 INFO L290 TraceCheckUtils]: 119: Hoare triple {44046#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,741 INFO L290 TraceCheckUtils]: 120: Hoare triple {44046#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,741 INFO L290 TraceCheckUtils]: 121: Hoare triple {44046#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,741 INFO L290 TraceCheckUtils]: 122: Hoare triple {44046#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,741 INFO L290 TraceCheckUtils]: 123: Hoare triple {44046#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,741 INFO L290 TraceCheckUtils]: 124: Hoare triple {44046#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,741 INFO L290 TraceCheckUtils]: 125: Hoare triple {44046#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,741 INFO L290 TraceCheckUtils]: 126: Hoare triple {44046#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,741 INFO L290 TraceCheckUtils]: 127: Hoare triple {44046#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-08 15:15:14,741 INFO L290 TraceCheckUtils]: 128: Hoare triple {44046#false} assume 8672 == #t~mem79;havoc #t~mem79; {44046#false} is VALID [2022-04-08 15:15:14,741 INFO L290 TraceCheckUtils]: 129: Hoare triple {44046#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {44046#false} is VALID [2022-04-08 15:15:14,742 INFO L290 TraceCheckUtils]: 130: Hoare triple {44046#false} assume 3 == ~blastFlag~0; {44046#false} is VALID [2022-04-08 15:15:14,742 INFO L290 TraceCheckUtils]: 131: Hoare triple {44046#false} assume !false; {44046#false} is VALID [2022-04-08 15:15:14,742 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-08 15:15:14,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:15:14,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633521982] [2022-04-08 15:15:14,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633521982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:14,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:14,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 15:15:14,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:15:14,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [231037048] [2022-04-08 15:15:14,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [231037048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:14,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:14,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 15:15:14,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198988796] [2022-04-08 15:15:14,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:15:14,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 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) Word has length 132 [2022-04-08 15:15:14,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:15:14,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 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:15:14,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:14,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 15:15:14,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:14,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 15:15:14,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 15:15:14,803 INFO L87 Difference]: Start difference. First operand 355 states and 560 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 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:15:18,733 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:15:20,737 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:15:22,771 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:15:24,798 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:15:26,824 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:15:28,846 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:15:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:30,217 INFO L93 Difference]: Finished difference Result 703 states and 1112 transitions. [2022-04-08 15:15:30,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 15:15:30,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 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) Word has length 132 [2022-04-08 15:15:30,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:15:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 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:15:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2022-04-08 15:15:30,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 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:15:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2022-04-08 15:15:30,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 402 transitions. [2022-04-08 15:15:30,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:30,489 INFO L225 Difference]: With dead ends: 703 [2022-04-08 15:15:30,489 INFO L226 Difference]: Without dead ends: 355 [2022-04-08 15:15:30,490 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 15:15:30,490 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 7 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 4 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:15:30,490 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 791 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 430 Invalid, 5 Unknown, 0 Unchecked, 12.4s Time] [2022-04-08 15:15:30,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-04-08 15:15:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2022-04-08 15:15:30,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:15:30,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand has 355 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 350 states have internal predecessors, (555), 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:15:30,504 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand has 355 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 350 states have internal predecessors, (555), 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:15:30,504 INFO L87 Difference]: Start difference. First operand 355 states. Second operand has 355 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 350 states have internal predecessors, (555), 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:15:30,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:30,509 INFO L93 Difference]: Finished difference Result 355 states and 559 transitions. [2022-04-08 15:15:30,509 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 559 transitions. [2022-04-08 15:15:30,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:30,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:30,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 355 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 350 states have internal predecessors, (555), 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 355 states. [2022-04-08 15:15:30,510 INFO L87 Difference]: Start difference. First operand has 355 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 350 states have internal predecessors, (555), 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 355 states. [2022-04-08 15:15:30,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:30,517 INFO L93 Difference]: Finished difference Result 355 states and 559 transitions. [2022-04-08 15:15:30,517 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 559 transitions. [2022-04-08 15:15:30,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:30,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:30,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:15:30,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:15:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 350 states have internal predecessors, (555), 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:15:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 559 transitions. [2022-04-08 15:15:30,527 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 559 transitions. Word has length 132 [2022-04-08 15:15:30,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:15:30,527 INFO L478 AbstractCegarLoop]: Abstraction has 355 states and 559 transitions. [2022-04-08 15:15:30,527 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 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:15:30,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 355 states and 559 transitions. [2022-04-08 15:15:31,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 559 edges. 559 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:31,050 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 559 transitions. [2022-04-08 15:15:31,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-08 15:15:31,050 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:15:31,051 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:31,051 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 15:15:31,051 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:15:31,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:15:31,051 INFO L85 PathProgramCache]: Analyzing trace with hash -919188982, now seen corresponding path program 1 times [2022-04-08 15:15:31,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:31,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1990720374] [2022-04-08 15:15:31,142 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:15:31,142 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:15:31,142 INFO L85 PathProgramCache]: Analyzing trace with hash -919188982, now seen corresponding path program 2 times [2022-04-08 15:15:31,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:15:31,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638476153] [2022-04-08 15:15:31,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:15:31,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:15:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 15:15:31,705 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 15:15:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 15:15:31,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 15:15:31,960 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 15:15:31,960 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 15:15:31,965 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 15:15:31,966 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 15:15:31,969 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 15:15:31,971 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 15:15:32,017 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 15:15:32,017 WARN L170 areAnnotationChecker]: SSLv3_server_methodENTRY has no Hoare annotation [2022-04-08 15:15:32,017 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 15:15:32,017 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 15:15:32,017 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 15:15:32,017 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 15:15:32,017 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-08 15:15:32,017 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: ssl3_acceptENTRY has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: ssl3_get_server_methodENTRY has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: L1743 has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: L1743 has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-08 15:15:32,018 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-08 15:15:32,019 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-08 15:15:32,019 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-08 15:15:32,019 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-08 15:15:32,019 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 15:15:32,019 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 15:15:32,019 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-08 15:15:32,019 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-08 15:15:32,019 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-08 15:15:32,019 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-08 15:15:32,019 WARN L170 areAnnotationChecker]: L1743-1 has no Hoare annotation [2022-04-08 15:15:32,019 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-08 15:15:32,019 WARN L170 areAnnotationChecker]: L1146-2 has no Hoare annotation [2022-04-08 15:15:32,019 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-08 15:15:32,019 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-08 15:15:32,019 WARN L170 areAnnotationChecker]: ssl3_get_server_methodFINAL has no Hoare annotation [2022-04-08 15:15:32,019 WARN L170 areAnnotationChecker]: L1063-1 has no Hoare annotation [2022-04-08 15:15:32,019 WARN L170 areAnnotationChecker]: SSLv3_server_methodFINAL has no Hoare annotation [2022-04-08 15:15:32,019 WARN L170 areAnnotationChecker]: L1106 has no Hoare annotation [2022-04-08 15:15:32,019 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: SSLv3_server_methodEXIT has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: L1065-1 has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: ssl3_acceptFINAL has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-08 15:15:32,020 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: ssl3_acceptEXIT has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: L1723 has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: L1727 has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: L1727 has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: L1727-2 has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: L1285-2 has no Hoare annotation [2022-04-08 15:15:32,021 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-08 15:15:32,022 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1654 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1692 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1692 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1693 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1693 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1692-1 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-08 15:15:32,023 WARN L170 areAnnotationChecker]: L1694 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1694 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1696 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1696 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1694-2 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1694-2 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1705 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1705 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1376-2 has no Hoare annotation [2022-04-08 15:15:32,024 WARN L170 areAnnotationChecker]: L1376-2 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1376 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1376 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1387-2 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1396-2 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1400 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1400 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1412 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1412 has no Hoare annotation [2022-04-08 15:15:32,025 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1412-2 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1417 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1417 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1458 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1458 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1434 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1459 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1459 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-08 15:15:32,026 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1460 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1460 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1468 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1500 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1500 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1423-1 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1469 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1469 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-08 15:15:32,027 WARN L170 areAnnotationChecker]: L1427 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1427 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1470 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1470 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1478 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1513 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1513 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1510-1 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1481 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1481 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1528 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1528 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1428-2 has no Hoare annotation [2022-04-08 15:15:32,028 WARN L170 areAnnotationChecker]: L1428-2 has no Hoare annotation [2022-04-08 15:15:32,029 WARN L170 areAnnotationChecker]: L1533 has no Hoare annotation [2022-04-08 15:15:32,029 WARN L170 areAnnotationChecker]: L1533 has no Hoare annotation [2022-04-08 15:15:32,029 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-08 15:15:32,029 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-08 15:15:32,029 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-08 15:15:32,029 WARN L170 areAnnotationChecker]: L1537 has no Hoare annotation [2022-04-08 15:15:32,029 WARN L170 areAnnotationChecker]: L1537 has no Hoare annotation [2022-04-08 15:15:32,029 WARN L170 areAnnotationChecker]: L1549 has no Hoare annotation [2022-04-08 15:15:32,029 WARN L170 areAnnotationChecker]: L1549 has no Hoare annotation [2022-04-08 15:15:32,029 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-08 15:15:32,029 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-08 15:15:32,029 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-08 15:15:32,029 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-08 15:15:32,029 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-08 15:15:32,030 WARN L170 areAnnotationChecker]: L1560 has no Hoare annotation [2022-04-08 15:15:32,030 WARN L170 areAnnotationChecker]: L1560 has no Hoare annotation [2022-04-08 15:15:32,030 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-08 15:15:32,030 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-08 15:15:32,030 WARN L170 areAnnotationChecker]: L1258 has no Hoare annotation [2022-04-08 15:15:32,030 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-08 15:15:32,030 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-08 15:15:32,030 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-08 15:15:32,030 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-08 15:15:32,030 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-08 15:15:32,030 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-08 15:15:32,031 WARN L170 areAnnotationChecker]: L1576 has no Hoare annotation [2022-04-08 15:15:32,031 WARN L170 areAnnotationChecker]: L1576 has no Hoare annotation [2022-04-08 15:15:32,031 WARN L170 areAnnotationChecker]: L1264 has no Hoare annotation [2022-04-08 15:15:32,031 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-08 15:15:32,031 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-08 15:15:32,031 WARN L170 areAnnotationChecker]: L1576-2 has no Hoare annotation [2022-04-08 15:15:32,031 WARN L170 areAnnotationChecker]: L1586 has no Hoare annotation [2022-04-08 15:15:32,031 WARN L170 areAnnotationChecker]: L1586 has no Hoare annotation [2022-04-08 15:15:32,031 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-08 15:15:32,031 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1593 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1593 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1270 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1593-2 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1593-2 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1615 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1615 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1605 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1605 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1616 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1616 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1620 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1620 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1273 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1276 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-08 15:15:32,032 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-08 15:15:32,033 WARN L170 areAnnotationChecker]: L1636 has no Hoare annotation [2022-04-08 15:15:32,033 WARN L170 areAnnotationChecker]: L1636 has no Hoare annotation [2022-04-08 15:15:32,033 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-08 15:15:32,033 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-08 15:15:32,033 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-08 15:15:32,033 WARN L170 areAnnotationChecker]: L1636-1 has no Hoare annotation [2022-04-08 15:15:32,033 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:15:32,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 03:15:32 BoogieIcfgContainer [2022-04-08 15:15:32,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 15:15:32,037 INFO L158 Benchmark]: Toolchain (without parser) took 126086.84ms. Allocated memory was 180.4MB in the beginning and 373.3MB in the end (delta: 192.9MB). Free memory was 122.9MB in the beginning and 147.4MB in the end (delta: -24.5MB). Peak memory consumption was 169.8MB. Max. memory is 8.0GB. [2022-04-08 15:15:32,037 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 180.4MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 15:15:32,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.52ms. Allocated memory was 180.4MB in the beginning and 302.0MB in the end (delta: 121.6MB). Free memory was 122.7MB in the beginning and 250.3MB in the end (delta: -127.6MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-04-08 15:15:32,039 INFO L158 Benchmark]: Boogie Preprocessor took 164.48ms. Allocated memory is still 302.0MB. Free memory was 250.3MB in the beginning and 240.3MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 15:15:32,040 INFO L158 Benchmark]: RCFGBuilder took 2421.73ms. Allocated memory is still 302.0MB. Free memory was 240.3MB in the beginning and 207.8MB in the end (delta: 32.5MB). Peak memory consumption was 38.5MB. Max. memory is 8.0GB. [2022-04-08 15:15:32,040 INFO L158 Benchmark]: TraceAbstraction took 122935.76ms. Allocated memory was 302.0MB in the beginning and 373.3MB in the end (delta: 71.3MB). Free memory was 207.3MB in the beginning and 147.4MB in the end (delta: 59.9MB). Peak memory consumption was 131.7MB. Max. memory is 8.0GB. [2022-04-08 15:15:32,046 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.15ms. Allocated memory is still 180.4MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 558.52ms. Allocated memory was 180.4MB in the beginning and 302.0MB in the end (delta: 121.6MB). Free memory was 122.7MB in the beginning and 250.3MB in the end (delta: -127.6MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 164.48ms. Allocated memory is still 302.0MB. Free memory was 250.3MB in the beginning and 240.3MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 2421.73ms. Allocated memory is still 302.0MB. Free memory was 240.3MB in the beginning and 207.8MB in the end (delta: 32.5MB). Peak memory consumption was 38.5MB. Max. memory is 8.0GB. * TraceAbstraction took 122935.76ms. Allocated memory was 302.0MB in the beginning and 373.3MB in the end (delta: 71.3MB). Free memory was 207.3MB in the beginning and 147.4MB in the end (delta: 59.9MB). Peak memory consumption was 131.7MB. 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: 1733]: 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 1152. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf ; [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 = __VERIFIER_nondet_int() ; [L1126] int tmp___4 = __VERIFIER_nondet_int() ; [L1127] int tmp___5 = __VERIFIER_nondet_int() ; [L1128] int tmp___6 = __VERIFIER_nondet_int() ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 = __VERIFIER_nondet_int() ; [L1132] int tmp___10 = __VERIFIER_nondet_int() ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) [L1161] EXPR s->cert [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 [L1167] COND TRUE 1 [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 [L1382] COND FALSE !(ret <= 0) [L1387] s->hit [L1387] COND TRUE s->hit [L1388] s->state = 8656 [L1392] s->init_num = 0 [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 [L1167] COND TRUE 1 [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state [L1260] COND TRUE s->state == 8656 [L1585] EXPR s->session [L1585] EXPR s->s3 [L1585] EXPR (s->s3)->tmp.new_cipher [L1585] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1586] COND FALSE !(! tmp___9) [L1592] ret = __VERIFIER_nondet_int() [L1593] COND TRUE blastFlag == 2 [L1594] blastFlag = 3 [L1598] COND FALSE !(ret <= 0) [L1603] s->state = 8672 [L1604] s->init_num = 0 [L1605] COND FALSE !(! tmp___10) [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 [L1167] COND TRUE 1 [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state [L1260] COND FALSE !(s->state == 8656) [L1263] EXPR s->state [L1263] COND FALSE !(s->state == 8657) [L1266] EXPR s->state [L1266] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND TRUE blastFlag == 3 [L1733] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 184 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 122.8s, OverallIterations: 26, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 106.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 31 mSolverCounterUnknown, 1287 SdHoareTripleChecker+Valid, 75.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1287 mSDsluCounter, 11457 SdHoareTripleChecker+Invalid, 75.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7203 mSDsCounter, 532 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9964 IncrementalHoareTripleChecker+Invalid, 10527 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 532 mSolverCounterUnsat, 4254 mSDtfsCounter, 9964 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=355occurred in iteration=23, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 880 StatesRemovedByMinimization, 23 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:15:32,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...