/usr/bin/java -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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.02.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 16:19:34,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 16:19:34,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 16:19:34,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 16:19:34,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 16:19:34,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 16:19:34,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 16:19:34,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 16:19:34,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 16:19:34,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 16:19:34,825 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 16:19:34,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 16:19:34,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 16:19:34,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 16:19:34,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 16:19:34,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 16:19:34,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 16:19:34,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 16:19:34,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 16:19:34,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 16:19:34,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 16:19:34,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 16:19:34,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 16:19:34,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 16:19:34,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 16:19:34,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 16:19:34,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 16:19:34,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 16:19:34,838 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 16:19:34,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 16:19:34,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 16:19:34,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 16:19:34,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 16:19:34,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 16:19:34,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 16:19:34,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 16:19:34,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 16:19:34,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 16:19:34,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 16:19:34,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 16:19:34,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 16:19:34,845 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 16:19:34,856 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 16:19:34,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 16:19:34,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 16:19:34,857 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 16:19:34,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 16:19:34,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 16:19:34,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 16:19:34,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 16:19:34,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 16:19:34,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 16:19:34,859 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 16:19:34,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 16:19:34,859 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 16:19:34,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 16:19:34,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 16:19:34,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 16:19:34,859 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 16:19:34,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 16:19:34,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 16:19:34,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 16:19:34,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 16:19:34,860 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 16:19:34,860 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-01-31 16:19:35,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 16:19:35,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 16:19:35,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 16:19:35,059 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 16:19:35,059 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 16:19:35,060 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-01-31 16:19:35,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2bdb9fda/949028b064f24736b638f3fe6592aa18/FLAGf1873c993 [2022-01-31 16:19:35,500 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 16:19:35,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.02.i.cil-1.c [2022-01-31 16:19:35,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2bdb9fda/949028b064f24736b638f3fe6592aa18/FLAGf1873c993 [2022-01-31 16:19:35,856 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2bdb9fda/949028b064f24736b638f3fe6592aa18 [2022-01-31 16:19:35,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 16:19:35,859 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 16:19:35,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 16:19:35,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 16:19:35,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 16:19:35,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:19:35" (1/1) ... [2022-01-31 16:19:35,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e674b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:19:35, skipping insertion in model container [2022-01-31 16:19:35,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:19:35" (1/1) ... [2022-01-31 16:19:35,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 16:19:35,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 16:19:36,179 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-01-31 16:19:36,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 16:19:36,200 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 16:19:36,305 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-01-31 16:19:36,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 16:19:36,326 INFO L208 MainTranslator]: Completed translation [2022-01-31 16:19:36,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:19:36 WrapperNode [2022-01-31 16:19:36,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 16:19:36,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 16:19:36,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 16:19:36,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 16:19:36,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:19:36" (1/1) ... [2022-01-31 16:19:36,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:19:36" (1/1) ... [2022-01-31 16:19:36,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:19:36" (1/1) ... [2022-01-31 16:19:36,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:19:36" (1/1) ... [2022-01-31 16:19:36,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:19:36" (1/1) ... [2022-01-31 16:19:36,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:19:36" (1/1) ... [2022-01-31 16:19:36,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:19:36" (1/1) ... [2022-01-31 16:19:36,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 16:19:36,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 16:19:36,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 16:19:36,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 16:19:36,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:19:36" (1/1) ... [2022-01-31 16:19:36,428 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 16:19:36,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:19:36,446 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-01-31 16:19:36,451 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-01-31 16:19:36,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 16:19:36,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 16:19:36,474 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 16:19:36,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-01-31 16:19:36,474 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-01-31 16:19:36,474 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 16:19:36,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-01-31 16:19:36,474 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-01-31 16:19:36,475 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-01-31 16:19:36,475 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-01-31 16:19:36,475 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 16:19:36,475 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 16:19:36,475 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 16:19:36,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 16:19:36,475 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 16:19:36,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-01-31 16:19:36,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 16:19:36,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-01-31 16:19:36,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-01-31 16:19:36,475 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-01-31 16:19:36,476 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-01-31 16:19:36,476 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-01-31 16:19:36,476 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-01-31 16:19:36,476 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-01-31 16:19:36,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-01-31 16:19:36,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-31 16:19:36,476 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 16:19:36,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 16:19:36,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 16:19:36,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-31 16:19:36,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 16:19:36,476 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-01-31 16:19:36,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-01-31 16:19:36,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 16:19:36,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 16:19:36,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 16:19:36,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-01-31 16:19:36,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-01-31 16:19:36,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-01-31 16:19:36,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-01-31 16:19:36,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 16:19:36,592 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 16:19:36,593 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 16:19:38,883 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:19:39,164 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-01-31 16:19:39,164 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-01-31 16:19:39,174 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 16:19:39,182 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 16:19:39,182 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 16:19:39,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:19:39 BoogieIcfgContainer [2022-01-31 16:19:39,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 16:19:39,184 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 16:19:39,184 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 16:19:39,185 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 16:19:39,187 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:19:39" (1/1) ... [2022-01-31 16:19:39,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 04:19:39 BasicIcfg [2022-01-31 16:19:39,228 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 16:19:39,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 16:19:39,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 16:19:39,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 16:19:39,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:19:35" (1/4) ... [2022-01-31 16:19:39,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d2862b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:19:39, skipping insertion in model container [2022-01-31 16:19:39,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:19:36" (2/4) ... [2022-01-31 16:19:39,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d2862b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:19:39, skipping insertion in model container [2022-01-31 16:19:39,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:19:39" (3/4) ... [2022-01-31 16:19:39,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d2862b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:19:39, skipping insertion in model container [2022-01-31 16:19:39,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 04:19:39" (4/4) ... [2022-01-31 16:19:39,234 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.cJordan [2022-01-31 16:19:39,239 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 16:19:39,239 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 16:19:39,278 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 16:19:39,284 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 16:19:39,284 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 16:19:39,302 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-01-31 16:19:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 16:19:39,312 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:19:39,313 INFO L514 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-01-31 16:19:39,313 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:19:39,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:19:39,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1355699347, now seen corresponding path program 1 times [2022-01-31 16:19:39,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:19:39,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807131830] [2022-01-31 16:19:39,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:19:39,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:19:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:39,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:19:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:19:39,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:19:39,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807131830] [2022-01-31 16:19:39,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807131830] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:19:39,738 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:19:39,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:19:39,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586994114] [2022-01-31 16:19:39,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:19:39,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:19:39,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:19:39,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:19:39,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:19:39,770 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-01-31 16:19:42,486 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-01-31 16:19:44,518 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-01-31 16:19:46,548 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-01-31 16:19:47,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:19:47,204 INFO L93 Difference]: Finished difference Result 277 states and 458 transitions. [2022-01-31 16:19:47,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:19:47,208 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-01-31 16:19:47,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:19:47,215 INFO L225 Difference]: With dead ends: 277 [2022-01-31 16:19:47,215 INFO L226 Difference]: Without dead ends: 251 [2022-01-31 16:19:47,216 INFO L932 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-01-31 16:19:47,217 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 140 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 65 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:19:47,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 433 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 520 Invalid, 3 Unknown, 0 Unchecked, 7.4s Time] [2022-01-31 16:19:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-01-31 16:19:47,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 180. [2022-01-31 16:19:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 175 states have (on average 1.6057142857142856) internal successors, (281), 175 states have internal predecessors, (281), 3 states have call successors, (3), 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-01-31 16:19:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 285 transitions. [2022-01-31 16:19:47,249 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 285 transitions. Word has length 52 [2022-01-31 16:19:47,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:19:47,250 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 285 transitions. [2022-01-31 16:19:47,250 INFO L471 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-01-31 16:19:47,250 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 285 transitions. [2022-01-31 16:19:47,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 16:19:47,252 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:19:47,252 INFO L514 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, 1] [2022-01-31 16:19:47,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 16:19:47,252 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:19:47,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:19:47,252 INFO L85 PathProgramCache]: Analyzing trace with hash 923942425, now seen corresponding path program 1 times [2022-01-31 16:19:47,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:19:47,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287535832] [2022-01-31 16:19:47,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:19:47,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:19:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:47,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:19:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:19:47,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:19:47,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287535832] [2022-01-31 16:19:47,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287535832] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:19:47,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:19:47,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:19:47,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235096663] [2022-01-31 16:19:47,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:19:47,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:19:47,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:19:47,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:19:47,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:19:47,407 INFO L87 Difference]: Start difference. First operand 180 states and 285 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:19:49,415 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-01-31 16:19:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:19:49,780 INFO L93 Difference]: Finished difference Result 208 states and 325 transitions. [2022-01-31 16:19:49,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:19:49,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 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 53 [2022-01-31 16:19:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:19:49,782 INFO L225 Difference]: With dead ends: 208 [2022-01-31 16:19:49,782 INFO L226 Difference]: Without dead ends: 208 [2022-01-31 16:19:49,782 INFO L932 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-01-31 16:19:49,783 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 22 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:19:49,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 451 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-01-31 16:19:49,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-01-31 16:19:49,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2022-01-31 16:19:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.6129032258064515) internal successors, (300), 186 states have internal predecessors, (300), 3 states have call successors, (3), 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-01-31 16:19:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 304 transitions. [2022-01-31 16:19:49,793 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 304 transitions. Word has length 53 [2022-01-31 16:19:49,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:19:49,793 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 304 transitions. [2022-01-31 16:19:49,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:19:49,794 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 304 transitions. [2022-01-31 16:19:49,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 16:19:49,795 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:19:49,795 INFO L514 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, 1] [2022-01-31 16:19:49,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 16:19:49,795 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:19:49,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:19:49,796 INFO L85 PathProgramCache]: Analyzing trace with hash -965147185, now seen corresponding path program 1 times [2022-01-31 16:19:49,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:19:49,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587664059] [2022-01-31 16:19:49,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:19:49,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:19:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:49,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:19:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:19:49,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:19:49,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587664059] [2022-01-31 16:19:49,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587664059] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:19:49,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:19:49,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:19:49,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778176244] [2022-01-31 16:19:49,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:19:49,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:19:49,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:19:49,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:19:49,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:19:49,940 INFO L87 Difference]: Start difference. First operand 191 states and 304 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-01-31 16:19:51,949 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-01-31 16:19:52,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:19:52,300 INFO L93 Difference]: Finished difference Result 208 states and 324 transitions. [2022-01-31 16:19:52,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:19:52,300 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-01-31 16:19:52,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:19:52,302 INFO L225 Difference]: With dead ends: 208 [2022-01-31 16:19:52,302 INFO L226 Difference]: Without dead ends: 208 [2022-01-31 16:19:52,302 INFO L932 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-01-31 16:19:52,303 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 24 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:19:52,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 453 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-01-31 16:19:52,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-01-31 16:19:52,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2022-01-31 16:19:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.60752688172043) internal successors, (299), 186 states have internal predecessors, (299), 3 states have call successors, (3), 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-01-31 16:19:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 303 transitions. [2022-01-31 16:19:52,324 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 303 transitions. Word has length 66 [2022-01-31 16:19:52,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:19:52,324 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 303 transitions. [2022-01-31 16:19:52,324 INFO L471 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-01-31 16:19:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 303 transitions. [2022-01-31 16:19:52,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 16:19:52,325 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:19:52,326 INFO L514 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, 1] [2022-01-31 16:19:52,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 16:19:52,326 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:19:52,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:19:52,326 INFO L85 PathProgramCache]: Analyzing trace with hash 328113503, now seen corresponding path program 1 times [2022-01-31 16:19:52,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:19:52,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560981025] [2022-01-31 16:19:52,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:19:52,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:19:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:52,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:19:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:19:52,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:19:52,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560981025] [2022-01-31 16:19:52,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560981025] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:19:52,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:19:52,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:19:52,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757892978] [2022-01-31 16:19:52,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:19:52,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:19:52,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:19:52,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:19:52,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:19:52,446 INFO L87 Difference]: Start difference. First operand 191 states and 303 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-01-31 16:19:54,456 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-01-31 16:19:54,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:19:54,863 INFO L93 Difference]: Finished difference Result 304 states and 475 transitions. [2022-01-31 16:19:54,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:19:54,863 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-01-31 16:19:54,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:19:54,864 INFO L225 Difference]: With dead ends: 304 [2022-01-31 16:19:54,864 INFO L226 Difference]: Without dead ends: 304 [2022-01-31 16:19:54,865 INFO L932 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-01-31 16:19:54,865 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 142 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:19:54,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 316 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 16:19:54,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-01-31 16:19:54,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 202. [2022-01-31 16:19:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.5888324873096447) internal successors, (313), 197 states have internal predecessors, (313), 3 states have call successors, (3), 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-01-31 16:19:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 317 transitions. [2022-01-31 16:19:54,871 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 317 transitions. Word has length 67 [2022-01-31 16:19:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:19:54,871 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 317 transitions. [2022-01-31 16:19:54,871 INFO L471 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-01-31 16:19:54,871 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 317 transitions. [2022-01-31 16:19:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 16:19:54,872 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:19:54,872 INFO L514 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, 1] [2022-01-31 16:19:54,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 16:19:54,873 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:19:54,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:19:54,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1220763967, now seen corresponding path program 1 times [2022-01-31 16:19:54,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:19:54,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64589132] [2022-01-31 16:19:54,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:19:54,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:19:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:54,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:19:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:19:54,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:19:54,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64589132] [2022-01-31 16:19:54,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64589132] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:19:54,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:19:54,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:19:54,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871255907] [2022-01-31 16:19:54,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:19:54,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:19:54,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:19:54,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:19:54,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:19:54,987 INFO L87 Difference]: Start difference. First operand 202 states and 317 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-01-31 16:19:56,995 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-01-31 16:19:57,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:19:57,318 INFO L93 Difference]: Finished difference Result 218 states and 336 transitions. [2022-01-31 16:19:57,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:19:57,318 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-01-31 16:19:57,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:19:57,319 INFO L225 Difference]: With dead ends: 218 [2022-01-31 16:19:57,319 INFO L226 Difference]: Without dead ends: 218 [2022-01-31 16:19:57,319 INFO L932 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-01-31 16:19:57,320 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 26 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:19:57,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 455 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 348 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-01-31 16:19:57,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-01-31 16:19:57,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 202. [2022-01-31 16:19:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.583756345177665) internal successors, (312), 197 states have internal predecessors, (312), 3 states have call successors, (3), 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-01-31 16:19:57,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 316 transitions. [2022-01-31 16:19:57,325 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 316 transitions. Word has length 67 [2022-01-31 16:19:57,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:19:57,329 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 316 transitions. [2022-01-31 16:19:57,329 INFO L471 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-01-31 16:19:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 316 transitions. [2022-01-31 16:19:57,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 16:19:57,330 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:19:57,330 INFO L514 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, 1] [2022-01-31 16:19:57,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 16:19:57,330 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:19:57,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:19:57,331 INFO L85 PathProgramCache]: Analyzing trace with hash 669903327, now seen corresponding path program 1 times [2022-01-31 16:19:57,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:19:57,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940254859] [2022-01-31 16:19:57,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:19:57,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:19:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:57,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:19:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:19:57,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:19:57,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940254859] [2022-01-31 16:19:57,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940254859] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:19:57,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:19:57,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:19:57,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421793048] [2022-01-31 16:19:57,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:19:57,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:19:57,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:19:57,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:19:57,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:19:57,429 INFO L87 Difference]: Start difference. First operand 202 states and 316 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-01-31 16:19:59,437 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-01-31 16:19:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:19:59,789 INFO L93 Difference]: Finished difference Result 217 states and 334 transitions. [2022-01-31 16:19:59,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:19:59,790 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-01-31 16:19:59,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:19:59,791 INFO L225 Difference]: With dead ends: 217 [2022-01-31 16:19:59,791 INFO L226 Difference]: Without dead ends: 217 [2022-01-31 16:19:59,791 INFO L932 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-01-31 16:19:59,791 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 19 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:19:59,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 457 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 346 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-01-31 16:19:59,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-01-31 16:19:59,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 202. [2022-01-31 16:19:59,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.5786802030456852) internal successors, (311), 197 states have internal predecessors, (311), 3 states have call successors, (3), 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-01-31 16:19:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 315 transitions. [2022-01-31 16:19:59,796 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 315 transitions. Word has length 67 [2022-01-31 16:19:59,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:19:59,796 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 315 transitions. [2022-01-31 16:19:59,796 INFO L471 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-01-31 16:19:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 315 transitions. [2022-01-31 16:19:59,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 16:19:59,797 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:19:59,797 INFO L514 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, 1] [2022-01-31 16:19:59,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 16:19:59,797 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:19:59,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:19:59,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1997406977, now seen corresponding path program 1 times [2022-01-31 16:19:59,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:19:59,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376292161] [2022-01-31 16:19:59,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:19:59,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:19:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:59,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:19:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:59,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:19:59,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:19:59,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376292161] [2022-01-31 16:19:59,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376292161] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:19:59,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:19:59,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:19:59,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653849749] [2022-01-31 16:19:59,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:19:59,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:19:59,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:19:59,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:19:59,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:19:59,884 INFO L87 Difference]: Start difference. First operand 202 states and 315 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-01-31 16:20:01,891 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-01-31 16:20:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:02,324 INFO L93 Difference]: Finished difference Result 304 states and 470 transitions. [2022-01-31 16:20:02,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:02,324 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-01-31 16:20:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:02,325 INFO L225 Difference]: With dead ends: 304 [2022-01-31 16:20:02,326 INFO L226 Difference]: Without dead ends: 304 [2022-01-31 16:20:02,326 INFO L932 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-01-31 16:20:02,326 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 135 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:02,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 316 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 16:20:02,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-01-31 16:20:02,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 208. [2022-01-31 16:20:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.5763546798029557) internal successors, (320), 203 states have internal predecessors, (320), 3 states have call successors, (3), 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-01-31 16:20:02,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 324 transitions. [2022-01-31 16:20:02,331 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 324 transitions. Word has length 67 [2022-01-31 16:20:02,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:02,331 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 324 transitions. [2022-01-31 16:20:02,331 INFO L471 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-01-31 16:20:02,331 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 324 transitions. [2022-01-31 16:20:02,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 16:20:02,332 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:02,332 INFO L514 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, 1] [2022-01-31 16:20:02,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 16:20:02,332 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:02,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:02,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1264278193, now seen corresponding path program 1 times [2022-01-31 16:20:02,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:02,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609185879] [2022-01-31 16:20:02,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:02,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:02,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:02,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:20:02,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:02,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609185879] [2022-01-31 16:20:02,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609185879] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:02,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:02,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:02,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776882844] [2022-01-31 16:20:02,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:02,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:02,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:02,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:02,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:02,421 INFO L87 Difference]: Start difference. First operand 208 states and 324 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-01-31 16:20:03,704 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:20:05,725 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-01-31 16:20:07,748 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-01-31 16:20:09,769 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-01-31 16:20:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:10,217 INFO L93 Difference]: Finished difference Result 304 states and 467 transitions. [2022-01-31 16:20:10,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:10,217 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-01-31 16:20:10,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:10,219 INFO L225 Difference]: With dead ends: 304 [2022-01-31 16:20:10,219 INFO L226 Difference]: Without dead ends: 304 [2022-01-31 16:20:10,219 INFO L932 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-01-31 16:20:10,219 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 138 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 63 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:10,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 316 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 463 Invalid, 3 Unknown, 0 Unchecked, 7.8s Time] [2022-01-31 16:20:10,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-01-31 16:20:10,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 208. [2022-01-31 16:20:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.561576354679803) internal successors, (317), 203 states have internal predecessors, (317), 3 states have call successors, (3), 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-01-31 16:20:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 321 transitions. [2022-01-31 16:20:10,224 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 321 transitions. Word has length 68 [2022-01-31 16:20:10,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:10,224 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 321 transitions. [2022-01-31 16:20:10,224 INFO L471 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-01-31 16:20:10,224 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 321 transitions. [2022-01-31 16:20:10,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-31 16:20:10,224 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:10,225 INFO L514 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, 1] [2022-01-31 16:20:10,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 16:20:10,225 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:10,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:10,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1953334341, now seen corresponding path program 1 times [2022-01-31 16:20:10,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:10,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073958269] [2022-01-31 16:20:10,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:10,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:10,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:10,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:20:10,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:10,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073958269] [2022-01-31 16:20:10,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073958269] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:10,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:10,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:10,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563333279] [2022-01-31 16:20:10,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:10,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:10,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:10,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:10,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:10,332 INFO L87 Difference]: Start difference. First operand 208 states and 321 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-01-31 16:20:12,340 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-01-31 16:20:12,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:12,663 INFO L93 Difference]: Finished difference Result 221 states and 337 transitions. [2022-01-31 16:20:12,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:12,663 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-01-31 16:20:12,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:12,664 INFO L225 Difference]: With dead ends: 221 [2022-01-31 16:20:12,664 INFO L226 Difference]: Without dead ends: 221 [2022-01-31 16:20:12,664 INFO L932 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-01-31 16:20:12,664 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 20 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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-01-31 16:20:12,665 INFO L934 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-01-31 16:20:12,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-01-31 16:20:12,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 208. [2022-01-31 16:20:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.5566502463054188) internal successors, (316), 203 states have internal predecessors, (316), 3 states have call successors, (3), 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-01-31 16:20:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 320 transitions. [2022-01-31 16:20:12,668 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 320 transitions. Word has length 69 [2022-01-31 16:20:12,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:12,669 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 320 transitions. [2022-01-31 16:20:12,669 INFO L471 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-01-31 16:20:12,669 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 320 transitions. [2022-01-31 16:20:12,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-31 16:20:12,669 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:12,669 INFO L514 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, 1] [2022-01-31 16:20:12,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 16:20:12,670 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:12,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:12,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1734108460, now seen corresponding path program 1 times [2022-01-31 16:20:12,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:12,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204932513] [2022-01-31 16:20:12,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:12,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:12,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:12,763 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:20:12,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:12,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204932513] [2022-01-31 16:20:12,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204932513] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:12,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:12,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:12,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422661229] [2022-01-31 16:20:12,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:12,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:12,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:12,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:12,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:12,765 INFO L87 Difference]: Start difference. First operand 208 states and 320 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-01-31 16:20:14,776 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-01-31 16:20:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:15,084 INFO L93 Difference]: Finished difference Result 211 states and 323 transitions. [2022-01-31 16:20:15,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:15,085 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-01-31 16:20:15,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:15,087 INFO L225 Difference]: With dead ends: 211 [2022-01-31 16:20:15,087 INFO L226 Difference]: Without dead ends: 211 [2022-01-31 16:20:15,087 INFO L932 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-01-31 16:20:15,087 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 11 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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-01-31 16:20:15,088 INFO L934 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-01-31 16:20:15,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-01-31 16:20:15,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2022-01-31 16:20:15,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.5517241379310345) internal successors, (315), 203 states have internal predecessors, (315), 3 states have call successors, (3), 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-01-31 16:20:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 319 transitions. [2022-01-31 16:20:15,092 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 319 transitions. Word has length 70 [2022-01-31 16:20:15,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:15,092 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 319 transitions. [2022-01-31 16:20:15,092 INFO L471 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-01-31 16:20:15,092 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 319 transitions. [2022-01-31 16:20:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-31 16:20:15,094 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:15,095 INFO L514 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-01-31 16:20:15,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 16:20:15,095 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:15,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:15,095 INFO L85 PathProgramCache]: Analyzing trace with hash 338203677, now seen corresponding path program 1 times [2022-01-31 16:20:15,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:15,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121873708] [2022-01-31 16:20:15,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:15,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:15,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:20:15,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:15,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121873708] [2022-01-31 16:20:15,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121873708] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:15,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:15,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:15,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843275115] [2022-01-31 16:20:15,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:15,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:15,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:15,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:15,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:15,191 INFO L87 Difference]: Start difference. First operand 208 states and 319 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-01-31 16:20:17,206 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-01-31 16:20:17,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:17,564 INFO L93 Difference]: Finished difference Result 251 states and 382 transitions. [2022-01-31 16:20:17,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:17,564 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-01-31 16:20:17,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:17,565 INFO L225 Difference]: With dead ends: 251 [2022-01-31 16:20:17,565 INFO L226 Difference]: Without dead ends: 251 [2022-01-31 16:20:17,565 INFO L932 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-01-31 16:20:17,566 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 33 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:17,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 475 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-01-31 16:20:17,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-01-31 16:20:17,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 230. [2022-01-31 16:20:17,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 225 states have (on average 1.5555555555555556) internal successors, (350), 225 states have internal predecessors, (350), 3 states have call successors, (3), 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-01-31 16:20:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2022-01-31 16:20:17,570 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 70 [2022-01-31 16:20:17,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:17,570 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2022-01-31 16:20:17,570 INFO L471 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-01-31 16:20:17,570 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2022-01-31 16:20:17,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-31 16:20:17,571 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:17,571 INFO L514 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-01-31 16:20:17,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 16:20:17,571 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:17,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:17,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1716885067, now seen corresponding path program 1 times [2022-01-31 16:20:17,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:17,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463631577] [2022-01-31 16:20:17,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:17,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:17,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:20:17,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:17,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463631577] [2022-01-31 16:20:17,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463631577] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:17,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:17,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:17,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777486254] [2022-01-31 16:20:17,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:17,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:17,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:17,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:17,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:17,659 INFO L87 Difference]: Start difference. First operand 230 states and 354 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-01-31 16:20:19,676 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-01-31 16:20:20,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:20,178 INFO L93 Difference]: Finished difference Result 367 states and 572 transitions. [2022-01-31 16:20:20,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:20,178 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-01-31 16:20:20,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:20,180 INFO L225 Difference]: With dead ends: 367 [2022-01-31 16:20:20,180 INFO L226 Difference]: Without dead ends: 367 [2022-01-31 16:20:20,180 INFO L932 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-01-31 16:20:20,181 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 135 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:20,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 536 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 569 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-01-31 16:20:20,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-01-31 16:20:20,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 246. [2022-01-31 16:20:20,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5435684647302905) internal successors, (372), 241 states have internal predecessors, (372), 3 states have call successors, (3), 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-01-31 16:20:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 376 transitions. [2022-01-31 16:20:20,185 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 376 transitions. Word has length 83 [2022-01-31 16:20:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:20,185 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 376 transitions. [2022-01-31 16:20:20,186 INFO L471 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-01-31 16:20:20,186 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 376 transitions. [2022-01-31 16:20:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-31 16:20:20,186 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:20,186 INFO L514 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] [2022-01-31 16:20:20,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 16:20:20,186 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:20,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:20,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1535582141, now seen corresponding path program 1 times [2022-01-31 16:20:20,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:20,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505262909] [2022-01-31 16:20:20,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:20,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:20,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 16:20:20,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:20,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505262909] [2022-01-31 16:20:20,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505262909] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:20,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:20,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:20,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87514182] [2022-01-31 16:20:20,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:20,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:20,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:20,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:20,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:20,273 INFO L87 Difference]: Start difference. First operand 246 states and 376 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:20:22,287 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-01-31 16:20:22,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:22,635 INFO L93 Difference]: Finished difference Result 258 states and 390 transitions. [2022-01-31 16:20:22,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:22,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-01-31 16:20:22,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:22,636 INFO L225 Difference]: With dead ends: 258 [2022-01-31 16:20:22,636 INFO L226 Difference]: Without dead ends: 258 [2022-01-31 16:20:22,636 INFO L932 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-01-31 16:20:22,637 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 20 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:22,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 540 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 380 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-01-31 16:20:22,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-01-31 16:20:22,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 246. [2022-01-31 16:20:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5394190871369295) internal successors, (371), 241 states have internal predecessors, (371), 3 states have call successors, (3), 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-01-31 16:20:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 375 transitions. [2022-01-31 16:20:22,641 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 375 transitions. Word has length 84 [2022-01-31 16:20:22,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:22,642 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 375 transitions. [2022-01-31 16:20:22,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:20:22,642 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 375 transitions. [2022-01-31 16:20:22,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-31 16:20:22,642 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:22,642 INFO L514 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-01-31 16:20:22,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 16:20:22,642 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:22,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2086442781, now seen corresponding path program 1 times [2022-01-31 16:20:22,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:22,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322349747] [2022-01-31 16:20:22,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:22,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:22,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:20:22,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:22,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322349747] [2022-01-31 16:20:22,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322349747] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:22,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:22,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:22,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982171988] [2022-01-31 16:20:22,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:22,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:22,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:22,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:22,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:22,731 INFO L87 Difference]: Start difference. First operand 246 states and 375 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-01-31 16:20:24,741 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-01-31 16:20:25,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:25,182 INFO L93 Difference]: Finished difference Result 341 states and 517 transitions. [2022-01-31 16:20:25,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:25,182 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-01-31 16:20:25,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:25,183 INFO L225 Difference]: With dead ends: 341 [2022-01-31 16:20:25,183 INFO L226 Difference]: Without dead ends: 341 [2022-01-31 16:20:25,184 INFO L932 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-01-31 16:20:25,184 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 133 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:25,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 318 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 460 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 16:20:25,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-01-31 16:20:25,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 247. [2022-01-31 16:20:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 242 states have (on average 1.5289256198347108) internal successors, (370), 242 states have internal predecessors, (370), 3 states have call successors, (3), 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-01-31 16:20:25,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 374 transitions. [2022-01-31 16:20:25,188 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 374 transitions. Word has length 84 [2022-01-31 16:20:25,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:25,188 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 374 transitions. [2022-01-31 16:20:25,188 INFO L471 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-01-31 16:20:25,188 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 374 transitions. [2022-01-31 16:20:25,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-31 16:20:25,189 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:25,189 INFO L514 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-01-31 16:20:25,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 16:20:25,189 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:25,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:25,189 INFO L85 PathProgramCache]: Analyzing trace with hash 710751120, now seen corresponding path program 1 times [2022-01-31 16:20:25,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:25,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670687716] [2022-01-31 16:20:25,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:25,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:25,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:20:25,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:25,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670687716] [2022-01-31 16:20:25,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670687716] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:25,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:25,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:25,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473154501] [2022-01-31 16:20:25,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:25,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:25,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:25,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:25,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:25,267 INFO L87 Difference]: Start difference. First operand 247 states and 374 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-01-31 16:20:26,702 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:20:28,724 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-01-31 16:20:30,748 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-01-31 16:20:32,771 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-01-31 16:20:33,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:33,095 INFO L93 Difference]: Finished difference Result 265 states and 398 transitions. [2022-01-31 16:20:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:33,096 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-01-31 16:20:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:33,097 INFO L225 Difference]: With dead ends: 265 [2022-01-31 16:20:33,097 INFO L226 Difference]: Without dead ends: 265 [2022-01-31 16:20:33,097 INFO L932 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-01-31 16:20:33,097 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 40 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:33,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 481 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 376 Invalid, 3 Unknown, 0 Unchecked, 7.8s Time] [2022-01-31 16:20:33,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-01-31 16:20:33,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2022-01-31 16:20:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 242 states have (on average 1.524793388429752) internal successors, (369), 242 states have internal predecessors, (369), 3 states have call successors, (3), 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-01-31 16:20:33,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 373 transitions. [2022-01-31 16:20:33,107 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 373 transitions. Word has length 85 [2022-01-31 16:20:33,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:33,107 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 373 transitions. [2022-01-31 16:20:33,108 INFO L471 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-01-31 16:20:33,108 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 373 transitions. [2022-01-31 16:20:33,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-31 16:20:33,108 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:33,108 INFO L514 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-01-31 16:20:33,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 16:20:33,108 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:33,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:33,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1818163604, now seen corresponding path program 1 times [2022-01-31 16:20:33,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:33,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851310374] [2022-01-31 16:20:33,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:33,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:33,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:20:33,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:33,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851310374] [2022-01-31 16:20:33,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851310374] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:33,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:33,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:33,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086676753] [2022-01-31 16:20:33,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:33,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:33,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:33,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:33,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:33,206 INFO L87 Difference]: Start difference. First operand 247 states and 373 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-01-31 16:20:35,213 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-01-31 16:20:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:35,551 INFO L93 Difference]: Finished difference Result 265 states and 397 transitions. [2022-01-31 16:20:35,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:35,552 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-01-31 16:20:35,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:35,553 INFO L225 Difference]: With dead ends: 265 [2022-01-31 16:20:35,553 INFO L226 Difference]: Without dead ends: 265 [2022-01-31 16:20:35,553 INFO L932 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-01-31 16:20:35,553 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 37 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:35,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 481 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 375 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-01-31 16:20:35,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-01-31 16:20:35,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2022-01-31 16:20:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 242 states have (on average 1.5206611570247934) internal successors, (368), 242 states have internal predecessors, (368), 3 states have call successors, (3), 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-01-31 16:20:35,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 372 transitions. [2022-01-31 16:20:35,557 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 372 transitions. Word has length 87 [2022-01-31 16:20:35,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:35,557 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 372 transitions. [2022-01-31 16:20:35,557 INFO L471 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-01-31 16:20:35,557 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 372 transitions. [2022-01-31 16:20:35,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-31 16:20:35,558 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:35,558 INFO L514 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-01-31 16:20:35,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 16:20:35,558 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:35,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:35,559 INFO L85 PathProgramCache]: Analyzing trace with hash 989898955, now seen corresponding path program 1 times [2022-01-31 16:20:35,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:35,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483680027] [2022-01-31 16:20:35,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:35,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:35,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:20:35,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:35,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483680027] [2022-01-31 16:20:35,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483680027] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:35,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:35,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:35,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385467736] [2022-01-31 16:20:35,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:35,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:35,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:35,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:35,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:35,678 INFO L87 Difference]: Start difference. First operand 247 states and 372 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-01-31 16:20:37,685 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-01-31 16:20:38,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:38,019 INFO L93 Difference]: Finished difference Result 255 states and 383 transitions. [2022-01-31 16:20:38,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:38,019 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-01-31 16:20:38,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:38,020 INFO L225 Difference]: With dead ends: 255 [2022-01-31 16:20:38,020 INFO L226 Difference]: Without dead ends: 255 [2022-01-31 16:20:38,020 INFO L932 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-01-31 16:20:38,021 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 28 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 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-01-31 16:20:38,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 495 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-01-31 16:20:38,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-01-31 16:20:38,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 247. [2022-01-31 16:20:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 242 states have (on average 1.5165289256198347) internal successors, (367), 242 states have internal predecessors, (367), 3 states have call successors, (3), 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-01-31 16:20:38,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 371 transitions. [2022-01-31 16:20:38,024 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 371 transitions. Word has length 88 [2022-01-31 16:20:38,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:38,024 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 371 transitions. [2022-01-31 16:20:38,025 INFO L471 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-01-31 16:20:38,025 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 371 transitions. [2022-01-31 16:20:38,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-31 16:20:38,025 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:38,025 INFO L514 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-01-31 16:20:38,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 16:20:38,025 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:38,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:38,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1607176068, now seen corresponding path program 1 times [2022-01-31 16:20:38,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:38,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960115560] [2022-01-31 16:20:38,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:38,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:38,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:38,112 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-31 16:20:38,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:38,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960115560] [2022-01-31 16:20:38,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960115560] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:38,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:38,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:38,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584100543] [2022-01-31 16:20:38,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:38,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:38,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:38,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:38,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:38,113 INFO L87 Difference]: Start difference. First operand 247 states and 371 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-01-31 16:20:40,123 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-01-31 16:20:40,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:40,596 INFO L93 Difference]: Finished difference Result 339 states and 510 transitions. [2022-01-31 16:20:40,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:40,597 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-01-31 16:20:40,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:40,598 INFO L225 Difference]: With dead ends: 339 [2022-01-31 16:20:40,598 INFO L226 Difference]: Without dead ends: 339 [2022-01-31 16:20:40,598 INFO L932 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-01-31 16:20:40,598 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 73 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:40,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 443 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 499 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-01-31 16:20:40,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-01-31 16:20:40,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 290. [2022-01-31 16:20:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 285 states have (on average 1.543859649122807) internal successors, (440), 285 states have internal predecessors, (440), 3 states have call successors, (3), 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-01-31 16:20:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 444 transitions. [2022-01-31 16:20:40,602 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 444 transitions. Word has length 92 [2022-01-31 16:20:40,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:40,603 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 444 transitions. [2022-01-31 16:20:40,603 INFO L471 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-01-31 16:20:40,603 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 444 transitions. [2022-01-31 16:20:40,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-31 16:20:40,603 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:40,603 INFO L514 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-01-31 16:20:40,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 16:20:40,604 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:40,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:40,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1663097307, now seen corresponding path program 1 times [2022-01-31 16:20:40,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:40,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951739259] [2022-01-31 16:20:40,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:40,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:40,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-31 16:20:40,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:40,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951739259] [2022-01-31 16:20:40,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951739259] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:40,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:40,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:40,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279916095] [2022-01-31 16:20:40,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:40,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:40,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:40,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:40,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:40,695 INFO L87 Difference]: Start difference. First operand 290 states and 444 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-01-31 16:20:42,703 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-01-31 16:20:43,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:43,135 INFO L93 Difference]: Finished difference Result 384 states and 586 transitions. [2022-01-31 16:20:43,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:43,135 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-01-31 16:20:43,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:43,136 INFO L225 Difference]: With dead ends: 384 [2022-01-31 16:20:43,136 INFO L226 Difference]: Without dead ends: 382 [2022-01-31 16:20:43,136 INFO L932 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-01-31 16:20:43,137 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 107 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:43,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 328 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 465 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 16:20:43,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-01-31 16:20:43,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 314. [2022-01-31 16:20:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 309 states have (on average 1.5760517799352751) internal successors, (487), 309 states have internal predecessors, (487), 3 states have call successors, (3), 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-01-31 16:20:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 491 transitions. [2022-01-31 16:20:43,142 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 491 transitions. Word has length 92 [2022-01-31 16:20:43,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:43,142 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 491 transitions. [2022-01-31 16:20:43,142 INFO L471 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-01-31 16:20:43,142 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 491 transitions. [2022-01-31 16:20:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-31 16:20:43,143 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:43,143 INFO L514 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-01-31 16:20:43,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 16:20:43,143 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:43,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:43,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1099971198, now seen corresponding path program 1 times [2022-01-31 16:20:43,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:43,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416868945] [2022-01-31 16:20:43,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:43,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:43,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-31 16:20:43,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:43,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416868945] [2022-01-31 16:20:43,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416868945] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:43,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:43,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:43,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46814977] [2022-01-31 16:20:43,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:43,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:43,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:43,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:43,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:43,234 INFO L87 Difference]: Start difference. First operand 314 states and 491 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-01-31 16:20:45,247 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-01-31 16:20:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:45,666 INFO L93 Difference]: Finished difference Result 421 states and 649 transitions. [2022-01-31 16:20:45,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:45,666 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-01-31 16:20:45,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:45,667 INFO L225 Difference]: With dead ends: 421 [2022-01-31 16:20:45,667 INFO L226 Difference]: Without dead ends: 421 [2022-01-31 16:20:45,668 INFO L932 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-01-31 16:20:45,668 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 115 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 48 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:45,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 330 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 452 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 16:20:45,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-01-31 16:20:45,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 346. [2022-01-31 16:20:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 341 states have (on average 1.5777126099706744) internal successors, (538), 341 states have internal predecessors, (538), 3 states have call successors, (3), 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-01-31 16:20:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 542 transitions. [2022-01-31 16:20:45,672 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 542 transitions. Word has length 120 [2022-01-31 16:20:45,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:45,673 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 542 transitions. [2022-01-31 16:20:45,673 INFO L471 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-01-31 16:20:45,673 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 542 transitions. [2022-01-31 16:20:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-31 16:20:45,674 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:45,674 INFO L514 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-01-31 16:20:45,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 16:20:45,674 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:45,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:45,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1373336550, now seen corresponding path program 1 times [2022-01-31 16:20:45,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:45,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995225994] [2022-01-31 16:20:45,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:45,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:45,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:45,987 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-01-31 16:20:45,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:45,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995225994] [2022-01-31 16:20:45,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995225994] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:45,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:45,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 16:20:45,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118874658] [2022-01-31 16:20:45,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:45,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 16:20:45,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:45,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 16:20:45,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-31 16:20:45,989 INFO L87 Difference]: Start difference. First operand 346 states and 542 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-01-31 16:20:47,998 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-01-31 16:20:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:48,447 INFO L93 Difference]: Finished difference Result 354 states and 552 transitions. [2022-01-31 16:20:48,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:20:48,447 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-01-31 16:20:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:48,448 INFO L225 Difference]: With dead ends: 354 [2022-01-31 16:20:48,448 INFO L226 Difference]: Without dead ends: 346 [2022-01-31 16:20:48,448 INFO L932 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-01-31 16:20:48,449 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 7 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:48,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 792 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 428 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 16:20:48,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-01-31 16:20:48,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2022-01-31 16:20:48,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 341 states have (on average 1.5747800586510263) internal successors, (537), 341 states have internal predecessors, (537), 3 states have call successors, (3), 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-01-31 16:20:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 541 transitions. [2022-01-31 16:20:48,453 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 541 transitions. Word has length 132 [2022-01-31 16:20:48,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:48,453 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 541 transitions. [2022-01-31 16:20:48,453 INFO L471 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-01-31 16:20:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 541 transitions. [2022-01-31 16:20:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-31 16:20:48,454 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:48,454 INFO L514 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-01-31 16:20:48,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 16:20:48,454 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:48,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:48,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1158507397, now seen corresponding path program 1 times [2022-01-31 16:20:48,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:48,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009954325] [2022-01-31 16:20:48,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:48,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 16:20:48,743 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-31 16:20:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 16:20:48,932 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-31 16:20:48,932 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-31 16:20:48,933 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 16:20:48,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 16:20:48,938 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:20:48,941 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 16:20:49,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:20:49 BasicIcfg [2022-01-31 16:20:49,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 16:20:49,045 INFO L158 Benchmark]: Toolchain (without parser) took 73186.84ms. Allocated memory was 206.6MB in the beginning and 275.8MB in the end (delta: 69.2MB). Free memory was 152.2MB in the beginning and 94.0MB in the end (delta: 58.3MB). Peak memory consumption was 128.3MB. Max. memory is 8.0GB. [2022-01-31 16:20:49,045 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 206.6MB. Free memory is still 170.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 16:20:49,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.49ms. Allocated memory was 206.6MB in the beginning and 275.8MB in the end (delta: 69.2MB). Free memory was 152.0MB in the beginning and 230.1MB in the end (delta: -78.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-31 16:20:49,046 INFO L158 Benchmark]: Boogie Preprocessor took 92.51ms. Allocated memory is still 275.8MB. Free memory was 230.1MB in the beginning and 222.2MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-01-31 16:20:49,046 INFO L158 Benchmark]: RCFGBuilder took 2762.48ms. Allocated memory is still 275.8MB. Free memory was 222.2MB in the beginning and 143.1MB in the end (delta: 79.2MB). Peak memory consumption was 78.6MB. Max. memory is 8.0GB. [2022-01-31 16:20:49,048 INFO L158 Benchmark]: IcfgTransformer took 43.87ms. Allocated memory is still 275.8MB. Free memory was 143.1MB in the beginning and 137.8MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-31 16:20:49,048 INFO L158 Benchmark]: TraceAbstraction took 69815.59ms. Allocated memory is still 275.8MB. Free memory was 137.3MB in the beginning and 94.0MB in the end (delta: 43.4MB). Peak memory consumption was 43.4MB. Max. memory is 8.0GB. [2022-01-31 16:20:49,052 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 206.6MB. Free memory is still 170.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 463.49ms. Allocated memory was 206.6MB in the beginning and 275.8MB in the end (delta: 69.2MB). Free memory was 152.0MB in the beginning and 230.1MB in the end (delta: -78.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 92.51ms. Allocated memory is still 275.8MB. Free memory was 230.1MB in the beginning and 222.2MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2762.48ms. Allocated memory is still 275.8MB. Free memory was 222.2MB in the beginning and 143.1MB in the end (delta: 79.2MB). Peak memory consumption was 78.6MB. Max. memory is 8.0GB. * IcfgTransformer took 43.87ms. Allocated memory is still 275.8MB. Free memory was 143.1MB in the beginning and 137.8MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * TraceAbstraction took 69815.59ms. Allocated memory is still 275.8MB. Free memory was 137.3MB in the beginning and 94.0MB in the end (delta: 43.4MB). Peak memory consumption was 43.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 ; VAL [\old(init)=4294967301, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={4:0}] [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) VAL [init=1, s={-4294967292:0}, SSLv3_server_data={4:0}] [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 VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967292:0}, s={-4294967292:0}, s->info_callback={0:-2}, skip=0, SSLv3_server_data={4:0}, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [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) VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967292:0}, s={-4294967292:0}, skip=0, SSLv3_server_data={4:0}, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1161] EXPR s->cert VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967292:0}, s={-4294967292:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967292:0}, s={-4294967292:0}, skip=0, SSLv3_server_data={4:0}, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967292:0}, s={-4294967292:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967292:0}, s={-4294967292:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967292:0}, s={-4294967292:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967292:0}, s={-4294967292:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967292:0}, s={-4294967292:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967292:0}, s={-4294967292:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967292:0}, s={-4294967292:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967292:0}, s={-4294967292:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967292:0}, s={-4294967292:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [={0:-2}, blastFlag=1, got_new_session=0, init=1, ret=17, s={-4294967292:0}, s={-4294967292:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967292:0}, s={-4294967292:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2}, (s->s3)->tmp.reuse_message=4294967325, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967292:0}, s={-4294967292:0}, s->s3={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967292:0}, s={-4294967292:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967292:0}, s={-4294967292:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967292:0}, s={-4294967292:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967292:0}, s={-4294967292:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967292:0}, s={-4294967292:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967292:0}, s={-4294967292:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967292:0}, s={-4294967292:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967292:0}, s={-4294967292:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967292:0}, s={-4294967292:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967292:0}, s={-4294967292:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967292:0}, s={-4294967292:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967292:0}, s={-4294967292:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967292:0}, s={-4294967292:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967292:0}, s={-4294967292:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1382] COND FALSE !(ret <= 0) [L1387] s->hit VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->hit=9, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1387] COND TRUE s->hit [L1388] s->state = 8656 VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1392] s->init_num = 0 VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2}, (s->s3)->tmp.reuse_message=4294967325, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->s3={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [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 VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1598] COND FALSE !(ret <= 0) [L1603] s->state = 8672 [L1604] s->init_num = 0 VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1605] COND FALSE !(! tmp___10) VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2}, (s->s3)->tmp.reuse_message=4294967325, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->s3={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1260] COND FALSE !(s->state == 8656) [L1263] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1263] COND FALSE !(s->state == 8657) [L1266] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967292:0}, s={-4294967292:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1266] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND TRUE blastFlag == 3 VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=-13, s={-4294967292:0}, s={-4294967292:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1733] reach_error() VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=-13, s={-4294967292:0}, s={-4294967292:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=0, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.7s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 66.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 1405 SdHoareTripleChecker+Valid, 65.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1405 mSDsluCounter, 9352 SdHoareTripleChecker+Invalid, 63.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5894 mSDsCounter, 578 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8720 IncrementalHoareTripleChecker+Invalid, 9325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 578 mSolverCounterUnsat, 3458 mSDtfsCounter, 8720 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=20, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 930 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1795 NumberOfCodeBlocks, 1795 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1642 ConstructedInterpolants, 0 QuantifiedInterpolants, 4952 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 500/500 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-01-31 16:20:49,090 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...