/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.01.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 16:19:31,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 16:19:31,369 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 16:19:31,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 16:19:31,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 16:19:31,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 16:19:31,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 16:19:31,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 16:19:31,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 16:19:31,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 16:19:31,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 16:19:31,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 16:19:31,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 16:19:31,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 16:19:31,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 16:19:31,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 16:19:31,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 16:19:31,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 16:19:31,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 16:19:31,461 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 16:19:31,463 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 16:19:31,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 16:19:31,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 16:19:31,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 16:19:31,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 16:19:31,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 16:19:31,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 16:19:31,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 16:19:31,469 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 16:19:31,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 16:19:31,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 16:19:31,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 16:19:31,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 16:19:31,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 16:19:31,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 16:19:31,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 16:19:31,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 16:19:31,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 16:19:31,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 16:19:31,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 16:19:31,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 16:19:31,476 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:31,484 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 16:19:31,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 16:19:31,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 16:19:31,485 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 16:19:31,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 16:19:31,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 16:19:31,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 16:19:31,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 16:19:31,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 16:19:31,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 16:19:31,486 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 16:19:31,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 16:19:31,486 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 16:19:31,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 16:19:31,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 16:19:31,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 16:19:31,487 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 16:19:31,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 16:19:31,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 16:19:31,487 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 16:19:31,488 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 16:19:31,488 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 16:19:31,489 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:31,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 16:19:31,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 16:19:31,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 16:19:31,759 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 16:19:31,759 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 16:19:31,760 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c [2022-01-31 16:19:31,821 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de611820/ff09d042cdf5433283e951dd5c3304f6/FLAG7f7b80009 [2022-01-31 16:19:32,365 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 16:19:32,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c [2022-01-31 16:19:32,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de611820/ff09d042cdf5433283e951dd5c3304f6/FLAG7f7b80009 [2022-01-31 16:19:32,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de611820/ff09d042cdf5433283e951dd5c3304f6 [2022-01-31 16:19:32,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 16:19:32,643 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 16:19:32,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 16:19:32,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 16:19:32,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 16:19:32,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:19:32" (1/1) ... [2022-01-31 16:19:32,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d0d3d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:19:32, skipping insertion in model container [2022-01-31 16:19:32,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:19:32" (1/1) ... [2022-01-31 16:19:32,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 16:19:32,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 16:19:33,061 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.01.i.cil-2.c[72913,72926] [2022-01-31 16:19:33,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 16:19:33,094 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 16:19:33,244 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.01.i.cil-2.c[72913,72926] [2022-01-31 16:19:33,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 16:19:33,273 INFO L208 MainTranslator]: Completed translation [2022-01-31 16:19:33,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:19:33 WrapperNode [2022-01-31 16:19:33,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 16:19:33,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 16:19:33,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 16:19:33,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 16:19:33,286 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:33" (1/1) ... [2022-01-31 16:19:33,287 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:33" (1/1) ... [2022-01-31 16:19:33,320 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:33" (1/1) ... [2022-01-31 16:19:33,321 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:33" (1/1) ... [2022-01-31 16:19:33,374 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:33" (1/1) ... [2022-01-31 16:19:33,392 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:33" (1/1) ... [2022-01-31 16:19:33,396 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:33" (1/1) ... [2022-01-31 16:19:33,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 16:19:33,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 16:19:33,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 16:19:33,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 16:19:33,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:19:33" (1/1) ... [2022-01-31 16:19:33,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 16:19:33,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:19:33,441 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:33,461 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:33,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 16:19:33,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 16:19:33,477 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 16:19:33,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-01-31 16:19:33,478 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-01-31 16:19:33,478 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 16:19:33,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-01-31 16:19:33,478 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-01-31 16:19:33,479 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-01-31 16:19:33,479 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-01-31 16:19:33,479 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 16:19:33,479 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 16:19:33,479 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 16:19:33,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 16:19:33,480 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 16:19:33,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-01-31 16:19:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 16:19:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-01-31 16:19:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-01-31 16:19:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-01-31 16:19:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-01-31 16:19:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-01-31 16:19:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-01-31 16:19:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-01-31 16:19:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-01-31 16:19:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-31 16:19:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 16:19:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 16:19:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 16:19:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-31 16:19:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 16:19:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-01-31 16:19:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-01-31 16:19:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 16:19:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 16:19:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 16:19:33,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-01-31 16:19:33,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-01-31 16:19:33,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-01-31 16:19:33,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-01-31 16:19:33,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 16:19:33,672 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 16:19:33,674 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 16:19:36,028 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:19:36,589 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-01-31 16:19:36,589 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-01-31 16:19:36,600 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 16:19:36,620 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 16:19:36,620 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 16:19:36,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:19:36 BoogieIcfgContainer [2022-01-31 16:19:36,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 16:19:36,623 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 16:19:36,623 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 16:19:36,624 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 16:19:36,627 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:19:36" (1/1) ... [2022-01-31 16:19:36,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 04:19:36 BasicIcfg [2022-01-31 16:19:36,709 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 16:19:36,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 16:19:36,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 16:19:36,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 16:19:36,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:19:32" (1/4) ... [2022-01-31 16:19:36,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f49c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:19:36, skipping insertion in model container [2022-01-31 16:19:36,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:19:33" (2/4) ... [2022-01-31 16:19:36,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f49c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:19:36, skipping insertion in model container [2022-01-31 16:19:36,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:19:36" (3/4) ... [2022-01-31 16:19:36,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f49c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:19:36, skipping insertion in model container [2022-01-31 16:19:36,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 04:19:36" (4/4) ... [2022-01-31 16:19:36,716 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.cJordan [2022-01-31 16:19:36,722 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 16:19:36,722 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 16:19:36,770 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 16:19:36,777 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:36,777 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 16:19:36,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 147 states have (on average 1.6870748299319729) internal successors, (248), 148 states have internal predecessors, (248), 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:36,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 16:19:36,807 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:19:36,809 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:36,809 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:19:36,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:19:36,815 INFO L85 PathProgramCache]: Analyzing trace with hash -546615762, now seen corresponding path program 1 times [2022-01-31 16:19:36,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:19:36,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895747491] [2022-01-31 16:19:36,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:19:36,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:19:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:37,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:19:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:37,315 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:37,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:19:37,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895747491] [2022-01-31 16:19:37,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895747491] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:19:37,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:19:37,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:19:37,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711599998] [2022-01-31 16:19:37,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:19:37,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:19:37,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:19:37,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:19:37,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:19:37,351 INFO L87 Difference]: Start difference. First operand has 155 states, 147 states have (on average 1.6870748299319729) internal successors, (248), 148 states have internal predecessors, (248), 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:39,394 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:40,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:19:40,192 INFO L93 Difference]: Finished difference Result 281 states and 462 transitions. [2022-01-31 16:19:40,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:19:40,195 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:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:19:40,207 INFO L225 Difference]: With dead ends: 281 [2022-01-31 16:19:40,207 INFO L226 Difference]: Without dead ends: 255 [2022-01-31 16:19:40,208 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:40,211 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 142 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 65 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:19:40,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 439 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 521 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-01-31 16:19:40,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-01-31 16:19:40,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 182. [2022-01-31 16:19:40,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 177 states have (on average 1.6045197740112995) internal successors, (284), 177 states have internal predecessors, (284), 3 states have call successors, (3), 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:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 288 transitions. [2022-01-31 16:19:40,253 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 288 transitions. Word has length 52 [2022-01-31 16:19:40,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:19:40,254 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 288 transitions. [2022-01-31 16:19:40,254 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:40,254 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 288 transitions. [2022-01-31 16:19:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 16:19:40,256 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:19:40,257 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:40,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 16:19:40,257 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:19:40,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:19:40,258 INFO L85 PathProgramCache]: Analyzing trace with hash 235729787, now seen corresponding path program 1 times [2022-01-31 16:19:40,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:19:40,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053075240] [2022-01-31 16:19:40,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:19:40,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:19:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:40,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:19:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:40,454 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:40,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:19:40,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053075240] [2022-01-31 16:19:40,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053075240] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:19:40,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:19:40,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:19:40,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408508975] [2022-01-31 16:19:40,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:19:40,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:19:40,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:19:40,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:19:40,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:19:40,458 INFO L87 Difference]: Start difference. First operand 182 states and 288 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:42,470 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:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:19:42,945 INFO L93 Difference]: Finished difference Result 210 states and 328 transitions. [2022-01-31 16:19:42,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:19:42,946 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:42,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:19:42,947 INFO L225 Difference]: With dead ends: 210 [2022-01-31 16:19:42,948 INFO L226 Difference]: Without dead ends: 210 [2022-01-31 16:19:42,948 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:42,949 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 22 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:19:42,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 460 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 355 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-01-31 16:19:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-01-31 16:19:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 193. [2022-01-31 16:19:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.6117021276595744) internal successors, (303), 188 states have internal predecessors, (303), 3 states have call successors, (3), 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:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 307 transitions. [2022-01-31 16:19:42,961 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 307 transitions. Word has length 53 [2022-01-31 16:19:42,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:19:42,962 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 307 transitions. [2022-01-31 16:19:42,962 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:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 307 transitions. [2022-01-31 16:19:42,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 16:19:42,964 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:19:42,964 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:42,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 16:19:42,965 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:19:42,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:19:42,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1009606034, now seen corresponding path program 1 times [2022-01-31 16:19:42,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:19:42,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436485899] [2022-01-31 16:19:42,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:19:42,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:19:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:43,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:19:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:43,100 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:43,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:19:43,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436485899] [2022-01-31 16:19:43,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436485899] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:19:43,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:19:43,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:19:43,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22855645] [2022-01-31 16:19:43,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:19:43,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:19:43,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:19:43,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:19:43,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:19:43,103 INFO L87 Difference]: Start difference. First operand 193 states and 307 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:45,113 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:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:19:45,511 INFO L93 Difference]: Finished difference Result 210 states and 327 transitions. [2022-01-31 16:19:45,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:19:45,512 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:45,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:19:45,513 INFO L225 Difference]: With dead ends: 210 [2022-01-31 16:19:45,513 INFO L226 Difference]: Without dead ends: 210 [2022-01-31 16:19:45,514 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:45,515 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 24 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:19:45,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 462 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 353 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 16:19:45,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-01-31 16:19:45,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 193. [2022-01-31 16:19:45,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.6063829787234043) internal successors, (302), 188 states have internal predecessors, (302), 3 states have call successors, (3), 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:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 306 transitions. [2022-01-31 16:19:45,530 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 306 transitions. Word has length 66 [2022-01-31 16:19:45,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:19:45,531 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 306 transitions. [2022-01-31 16:19:45,531 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:45,531 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 306 transitions. [2022-01-31 16:19:45,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 16:19:45,533 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:19:45,533 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:45,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 16:19:45,533 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:19:45,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:19:45,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1483880639, now seen corresponding path program 1 times [2022-01-31 16:19:45,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:19:45,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605219352] [2022-01-31 16:19:45,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:19:45,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:19:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:45,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:19:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:45,723 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:45,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:19:45,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605219352] [2022-01-31 16:19:45,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605219352] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:19:45,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:19:45,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:19:45,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995416963] [2022-01-31 16:19:45,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:19:45,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:19:45,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:19:45,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:19:45,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:19:45,728 INFO L87 Difference]: Start difference. First operand 193 states and 306 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:47,738 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:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:19:48,138 INFO L93 Difference]: Finished difference Result 208 states and 324 transitions. [2022-01-31 16:19:48,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:19:48,138 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:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:19:48,139 INFO L225 Difference]: With dead ends: 208 [2022-01-31 16:19:48,140 INFO L226 Difference]: Without dead ends: 208 [2022-01-31 16:19:48,140 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:48,141 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 22 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:19:48,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 466 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 349 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 16:19:48,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-01-31 16:19:48,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 193. [2022-01-31 16:19:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.601063829787234) internal successors, (301), 188 states have internal predecessors, (301), 3 states have call successors, (3), 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:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 305 transitions. [2022-01-31 16:19:48,150 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 305 transitions. Word has length 67 [2022-01-31 16:19:48,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:19:48,150 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 305 transitions. [2022-01-31 16:19:48,150 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:48,150 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 305 transitions. [2022-01-31 16:19:48,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 16:19:48,152 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:19:48,152 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:48,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 16:19:48,153 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:19:48,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:19:48,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1189450432, now seen corresponding path program 1 times [2022-01-31 16:19:48,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:19:48,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3587884] [2022-01-31 16:19:48,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:19:48,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:19:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:48,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:19:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:48,305 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:48,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:19:48,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3587884] [2022-01-31 16:19:48,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3587884] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:19:48,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:19:48,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:19:48,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118428892] [2022-01-31 16:19:48,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:19:48,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:19:48,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:19:48,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:19:48,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:19:48,307 INFO L87 Difference]: Start difference. First operand 193 states and 305 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:50,080 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:19:52,106 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:54,130 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:19:56,152 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:19:56,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:19:56,553 INFO L93 Difference]: Finished difference Result 207 states and 322 transitions. [2022-01-31 16:19:56,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:19:56,554 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:56,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:19:56,555 INFO L225 Difference]: With dead ends: 207 [2022-01-31 16:19:56,555 INFO L226 Difference]: Without dead ends: 207 [2022-01-31 16:19:56,555 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:56,556 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 20 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-01-31 16:19:56,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 468 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 348 Invalid, 3 Unknown, 0 Unchecked, 8.2s Time] [2022-01-31 16:19:56,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-01-31 16:19:56,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 193. [2022-01-31 16:19:56,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.5957446808510638) internal successors, (300), 188 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:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 304 transitions. [2022-01-31 16:19:56,564 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 304 transitions. Word has length 67 [2022-01-31 16:19:56,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:19:56,565 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 304 transitions. [2022-01-31 16:19:56,565 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:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 304 transitions. [2022-01-31 16:19:56,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 16:19:56,567 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:19:56,567 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, 1] [2022-01-31 16:19:56,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 16:19:56,567 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:19:56,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:19:56,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1168461526, now seen corresponding path program 1 times [2022-01-31 16:19:56,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:19:56,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127822671] [2022-01-31 16:19:56,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:19:56,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:19:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:56,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:19:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:56,680 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:56,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:19:56,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127822671] [2022-01-31 16:19:56,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127822671] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:19:56,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:19:56,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:19:56,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827601182] [2022-01-31 16:19:56,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:19:56,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:19:56,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:19:56,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:19:56,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:19:56,682 INFO L87 Difference]: Start difference. First operand 193 states and 304 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:19:58,694 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:59,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:19:59,077 INFO L93 Difference]: Finished difference Result 206 states and 320 transitions. [2022-01-31 16:19:59,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:19:59,078 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:19:59,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:19:59,079 INFO L225 Difference]: With dead ends: 206 [2022-01-31 16:19:59,079 INFO L226 Difference]: Without dead ends: 206 [2022-01-31 16:19:59,080 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,080 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 26 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:19:59,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 16:19:59,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-01-31 16:19:59,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 193. [2022-01-31 16:19:59,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.5904255319148937) internal successors, (299), 188 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:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 303 transitions. [2022-01-31 16:19:59,087 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 303 transitions. Word has length 68 [2022-01-31 16:19:59,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:19:59,087 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 303 transitions. [2022-01-31 16:19:59,087 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:19:59,087 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 303 transitions. [2022-01-31 16:19:59,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 16:19:59,088 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:19:59,088 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, 1] [2022-01-31 16:19:59,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 16:19:59,089 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:19:59,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:19:59,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1224145162, now seen corresponding path program 1 times [2022-01-31 16:19:59,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:19:59,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785041721] [2022-01-31 16:19:59,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:19:59,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:19:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:59,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:19:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:19:59,197 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:59,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:19:59,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785041721] [2022-01-31 16:19:59,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785041721] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:19:59,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:19:59,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:19:59,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704803829] [2022-01-31 16:19:59,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:19:59,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:19:59,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:19:59,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:19:59,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:19:59,200 INFO L87 Difference]: Start difference. First operand 193 states and 303 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:01,209 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:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:01,779 INFO L93 Difference]: Finished difference Result 309 states and 479 transitions. [2022-01-31 16:20:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:01,780 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:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:01,782 INFO L225 Difference]: With dead ends: 309 [2022-01-31 16:20:01,782 INFO L226 Difference]: Without dead ends: 309 [2022-01-31 16:20:01,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:20:01,783 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 144 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:01,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 323 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 467 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-01-31 16:20:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-01-31 16:20:01,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 205. [2022-01-31 16:20:01,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.575) internal successors, (315), 200 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:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 319 transitions. [2022-01-31 16:20:01,790 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 319 transitions. Word has length 68 [2022-01-31 16:20:01,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:01,791 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 319 transitions. [2022-01-31 16:20:01,791 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:01,794 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 319 transitions. [2022-01-31 16:20:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-31 16:20:01,796 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:01,796 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, 1] [2022-01-31 16:20:01,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 16:20:01,796 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:01,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:01,797 INFO L85 PathProgramCache]: Analyzing trace with hash -735767643, now seen corresponding path program 1 times [2022-01-31 16:20:01,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:01,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565065196] [2022-01-31 16:20:01,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:01,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:01,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:01,953 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:01,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:01,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565065196] [2022-01-31 16:20:01,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565065196] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:01,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:01,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:01,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112876864] [2022-01-31 16:20:01,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:01,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:01,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:01,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:01,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:01,955 INFO L87 Difference]: Start difference. First operand 205 states and 319 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:03,972 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:04,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:04,449 INFO L93 Difference]: Finished difference Result 309 states and 476 transitions. [2022-01-31 16:20:04,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:04,450 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:04,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:04,451 INFO L225 Difference]: With dead ends: 309 [2022-01-31 16:20:04,451 INFO L226 Difference]: Without dead ends: 309 [2022-01-31 16:20:04,452 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:04,452 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 142 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:04,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 323 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 467 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-01-31 16:20:04,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-01-31 16:20:04,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 206. [2022-01-31 16:20:04,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 201 states have (on average 1.5621890547263682) internal successors, (314), 201 states have internal predecessors, (314), 3 states have call successors, (3), 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:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 318 transitions. [2022-01-31 16:20:04,459 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 318 transitions. Word has length 69 [2022-01-31 16:20:04,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:04,459 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 318 transitions. [2022-01-31 16:20:04,459 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:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 318 transitions. [2022-01-31 16:20:04,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-31 16:20:04,460 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:04,460 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, 1] [2022-01-31 16:20:04,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 16:20:04,460 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:04,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:04,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1756828634, now seen corresponding path program 1 times [2022-01-31 16:20:04,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:04,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328422038] [2022-01-31 16:20:04,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:04,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:04,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:04,562 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:04,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:04,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328422038] [2022-01-31 16:20:04,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328422038] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:04,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:04,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:04,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657367529] [2022-01-31 16:20:04,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:04,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:04,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:04,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:04,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:04,564 INFO L87 Difference]: Start difference. First operand 206 states and 318 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:06,580 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:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:06,918 INFO L93 Difference]: Finished difference Result 219 states and 334 transitions. [2022-01-31 16:20:06,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:06,918 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:06,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:06,919 INFO L225 Difference]: With dead ends: 219 [2022-01-31 16:20:06,920 INFO L226 Difference]: Without dead ends: 219 [2022-01-31 16:20:06,920 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:06,920 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 20 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:06,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-01-31 16:20:06,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-01-31 16:20:06,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 206. [2022-01-31 16:20:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 201 states have (on average 1.5572139303482586) internal successors, (313), 201 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:20:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 317 transitions. [2022-01-31 16:20:06,926 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 317 transitions. Word has length 70 [2022-01-31 16:20:06,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:06,927 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 317 transitions. [2022-01-31 16:20:06,927 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:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 317 transitions. [2022-01-31 16:20:06,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-31 16:20:06,928 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:06,928 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:06,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 16:20:06,928 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:06,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:06,929 INFO L85 PathProgramCache]: Analyzing trace with hash 213226400, now seen corresponding path program 1 times [2022-01-31 16:20:06,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:06,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151432467] [2022-01-31 16:20:06,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:06,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:07,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:07,031 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:07,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:07,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151432467] [2022-01-31 16:20:07,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151432467] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:07,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:07,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:07,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988424060] [2022-01-31 16:20:07,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:07,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:07,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:07,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:07,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:07,049 INFO L87 Difference]: Start difference. First operand 206 states and 317 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:09,063 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:09,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:09,447 INFO L93 Difference]: Finished difference Result 249 states and 380 transitions. [2022-01-31 16:20:09,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:09,452 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:09,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:09,454 INFO L225 Difference]: With dead ends: 249 [2022-01-31 16:20:09,454 INFO L226 Difference]: Without dead ends: 249 [2022-01-31 16:20:09,454 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:09,455 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 32 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:09,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 510 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 403 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 16:20:09,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-01-31 16:20:09,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 228. [2022-01-31 16:20:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 223 states have (on average 1.5650224215246638) internal successors, (349), 223 states have internal predecessors, (349), 3 states have call successors, (3), 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:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 353 transitions. [2022-01-31 16:20:09,461 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 353 transitions. Word has length 70 [2022-01-31 16:20:09,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:09,461 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 353 transitions. [2022-01-31 16:20:09,462 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:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 353 transitions. [2022-01-31 16:20:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 16:20:09,462 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:09,463 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, 1] [2022-01-31 16:20:09,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 16:20:09,463 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:09,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:09,463 INFO L85 PathProgramCache]: Analyzing trace with hash 822506376, now seen corresponding path program 1 times [2022-01-31 16:20:09,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:09,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593361521] [2022-01-31 16:20:09,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:09,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:09,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:09,574 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:09,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:09,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593361521] [2022-01-31 16:20:09,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593361521] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:09,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:09,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:09,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180257516] [2022-01-31 16:20:09,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:09,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:09,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:09,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:09,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:09,576 INFO L87 Difference]: Start difference. First operand 228 states and 353 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:20:11,586 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,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:12,052 INFO L93 Difference]: Finished difference Result 331 states and 507 transitions. [2022-01-31 16:20:12,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:12,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-01-31 16:20:12,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:12,054 INFO L225 Difference]: With dead ends: 331 [2022-01-31 16:20:12,054 INFO L226 Difference]: Without dead ends: 331 [2022-01-31 16:20:12,054 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,055 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 139 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:12,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 323 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 467 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-01-31 16:20:12,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-01-31 16:20:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 230. [2022-01-31 16:20:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 225 states have (on average 1.551111111111111) internal successors, (349), 225 states have internal predecessors, (349), 3 states have call successors, (3), 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,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2022-01-31 16:20:12,061 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 71 [2022-01-31 16:20:12,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:12,061 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2022-01-31 16:20:12,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:20:12,062 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2022-01-31 16:20:12,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-31 16:20:12,062 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:12,062 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:12,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 16:20:12,063 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:12,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:12,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1852382835, now seen corresponding path program 1 times [2022-01-31 16:20:12,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:12,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487570077] [2022-01-31 16:20:12,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:12,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:12,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:12,174 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:12,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:12,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487570077] [2022-01-31 16:20:12,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487570077] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:12,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:12,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:12,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174965925] [2022-01-31 16:20:12,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:12,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:12,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:12,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:12,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:12,176 INFO L87 Difference]: Start difference. First operand 230 states and 353 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:14,192 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:14,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:14,623 INFO L93 Difference]: Finished difference Result 374 states and 581 transitions. [2022-01-31 16:20:14,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:14,623 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:14,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:14,625 INFO L225 Difference]: With dead ends: 374 [2022-01-31 16:20:14,625 INFO L226 Difference]: Without dead ends: 374 [2022-01-31 16:20:14,625 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:14,626 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 138 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:14,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 323 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 468 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 16:20:14,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-01-31 16:20:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 247. [2022-01-31 16:20:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 242 states have (on average 1.537190082644628) internal successors, (372), 242 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:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 376 transitions. [2022-01-31 16:20:14,633 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 376 transitions. Word has length 83 [2022-01-31 16:20:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:14,633 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 376 transitions. [2022-01-31 16:20:14,633 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:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 376 transitions. [2022-01-31 16:20:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-31 16:20:14,634 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:14,634 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:20:14,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 16:20:14,635 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:14,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:14,635 INFO L85 PathProgramCache]: Analyzing trace with hash -11222362, now seen corresponding path program 1 times [2022-01-31 16:20:14,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:14,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915537786] [2022-01-31 16:20:14,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:14,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:14,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:20:14,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:14,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915537786] [2022-01-31 16:20:14,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915537786] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:14,740 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:14,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:14,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947919966] [2022-01-31 16:20:14,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:14,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:14,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:14,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:14,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:14,741 INFO L87 Difference]: Start difference. First operand 247 states and 376 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:16,756 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,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:17,325 INFO L93 Difference]: Finished difference Result 347 states and 525 transitions. [2022-01-31 16:20:17,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:17,326 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:17,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:17,327 INFO L225 Difference]: With dead ends: 347 [2022-01-31 16:20:17,327 INFO L226 Difference]: Without dead ends: 347 [2022-01-31 16:20:17,327 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,328 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 137 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:17,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 323 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 467 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-01-31 16:20:17,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-01-31 16:20:17,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 248. [2022-01-31 16:20:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 243 states have (on average 1.5267489711934157) internal successors, (371), 243 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:17,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 375 transitions. [2022-01-31 16:20:17,334 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 375 transitions. Word has length 84 [2022-01-31 16:20:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:17,335 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 375 transitions. [2022-01-31 16:20:17,335 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:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 375 transitions. [2022-01-31 16:20:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-31 16:20:17,336 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:17,336 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:17,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 16:20:17,336 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:17,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:17,337 INFO L85 PathProgramCache]: Analyzing trace with hash 283207845, now seen corresponding path program 1 times [2022-01-31 16:20:17,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:17,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265442536] [2022-01-31 16:20:17,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:17,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:17,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:17,443 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:17,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:17,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265442536] [2022-01-31 16:20:17,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265442536] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:17,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:17,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:17,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084547074] [2022-01-31 16:20:17,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:17,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:17,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:17,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:17,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:17,445 INFO L87 Difference]: Start difference. First operand 248 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:19,458 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:19,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:19,857 INFO L93 Difference]: Finished difference Result 266 states and 398 transitions. [2022-01-31 16:20:19,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:19,858 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:19,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:19,859 INFO L225 Difference]: With dead ends: 266 [2022-01-31 16:20:19,859 INFO L226 Difference]: Without dead ends: 266 [2022-01-31 16:20:19,860 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:19,860 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 32 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:19,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 488 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 380 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 16:20:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-01-31 16:20:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 248. [2022-01-31 16:20:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 243 states have (on average 1.522633744855967) internal successors, (370), 243 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:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 374 transitions. [2022-01-31 16:20:19,865 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 374 transitions. Word has length 84 [2022-01-31 16:20:19,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:19,865 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 374 transitions. [2022-01-31 16:20:19,865 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:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 374 transitions. [2022-01-31 16:20:19,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-31 16:20:19,866 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:19,866 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:20:19,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 16:20:19,867 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:19,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:19,868 INFO L85 PathProgramCache]: Analyzing trace with hash -423772143, now seen corresponding path program 1 times [2022-01-31 16:20:19,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:19,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183050477] [2022-01-31 16:20:19,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:19,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:20,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:20,019 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-31 16:20:20,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:20,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183050477] [2022-01-31 16:20:20,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183050477] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:20,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:20,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:20,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975029659] [2022-01-31 16:20:20,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:20,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:20,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:20,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:20,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:20,021 INFO L87 Difference]: Start difference. First operand 248 states and 374 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:22,031 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:22,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:22,396 INFO L93 Difference]: Finished difference Result 261 states and 389 transitions. [2022-01-31 16:20:22,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:22,396 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 85 [2022-01-31 16:20:22,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:22,397 INFO L225 Difference]: With dead ends: 261 [2022-01-31 16:20:22,397 INFO L226 Difference]: Without dead ends: 261 [2022-01-31 16:20:22,397 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,398 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 19 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:22,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 547 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 16:20:22,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-01-31 16:20:22,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 248. [2022-01-31 16:20:22,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 243 states have (on average 1.5185185185185186) internal successors, (369), 243 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:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2022-01-31 16:20:22,403 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 85 [2022-01-31 16:20:22,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:22,403 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2022-01-31 16:20:22,404 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:22,404 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2022-01-31 16:20:22,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-01-31 16:20:22,405 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:22,405 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:20:22,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 16:20:22,405 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:22,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:22,405 INFO L85 PathProgramCache]: Analyzing trace with hash -975947891, now seen corresponding path program 1 times [2022-01-31 16:20:22,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:22,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904366296] [2022-01-31 16:20:22,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:22,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:22,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 16:20:22,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:22,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904366296] [2022-01-31 16:20:22,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904366296] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:22,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:22,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:20:22,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028266843] [2022-01-31 16:20:22,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:22,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:20:22,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:22,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:20:22,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:20:22,538 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 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:24,547 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:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:24,931 INFO L93 Difference]: Finished difference Result 257 states and 384 transitions. [2022-01-31 16:20:24,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:20:24,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 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 86 [2022-01-31 16:20:24,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:24,932 INFO L225 Difference]: With dead ends: 257 [2022-01-31 16:20:24,933 INFO L226 Difference]: Without dead ends: 257 [2022-01-31 16:20:24,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 16:20:24,933 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 2 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:24,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 605 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 424 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 16:20:24,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-01-31 16:20:24,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2022-01-31 16:20:24,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 252 states have (on average 1.507936507936508) internal successors, (380), 252 states have internal predecessors, (380), 3 states have call successors, (3), 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:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 384 transitions. [2022-01-31 16:20:24,941 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 384 transitions. Word has length 86 [2022-01-31 16:20:24,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:24,941 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 384 transitions. [2022-01-31 16:20:24,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 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:24,942 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 384 transitions. [2022-01-31 16:20:24,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-31 16:20:24,942 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:24,942 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, 1] [2022-01-31 16:20:24,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 16:20:24,943 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:24,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:24,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1583750601, now seen corresponding path program 1 times [2022-01-31 16:20:24,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:24,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39933475] [2022-01-31 16:20:24,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:24,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:25,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:25,047 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:25,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:25,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39933475] [2022-01-31 16:20:25,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39933475] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:25,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:25,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:25,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342085032] [2022-01-31 16:20:25,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:25,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:25,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:25,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:25,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:25,049 INFO L87 Difference]: Start difference. First operand 257 states and 384 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:26,657 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:20:28,683 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:20:30,708 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,732 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,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:33,097 INFO L93 Difference]: Finished difference Result 274 states and 405 transitions. [2022-01-31 16:20:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:33,098 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:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:33,099 INFO L225 Difference]: With dead ends: 274 [2022-01-31 16:20:33,099 INFO L226 Difference]: Without dead ends: 274 [2022-01-31 16:20:33,099 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,100 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 34 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:33,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 490 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 379 Invalid, 3 Unknown, 0 Unchecked, 8.0s Time] [2022-01-31 16:20:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-01-31 16:20:33,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 257. [2022-01-31 16:20:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 252 states have (on average 1.503968253968254) internal successors, (379), 252 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:20:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 383 transitions. [2022-01-31 16:20:33,106 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 383 transitions. Word has length 88 [2022-01-31 16:20:33,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:33,106 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 383 transitions. [2022-01-31 16:20:33,106 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:33,106 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 383 transitions. [2022-01-31 16:20:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-31 16:20:33,107 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:33,107 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:33,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 16:20:33,108 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:33,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:33,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1434817728, now seen corresponding path program 1 times [2022-01-31 16:20:33,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:33,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795846011] [2022-01-31 16:20:33,108 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,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:33,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:33,221 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:33,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:33,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795846011] [2022-01-31 16:20:33,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795846011] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:33,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:33,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:33,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462336151] [2022-01-31 16:20:33,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:33,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:33,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:33,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:33,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:33,223 INFO L87 Difference]: Start difference. First operand 257 states and 383 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:35,233 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:35,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:35,753 INFO L93 Difference]: Finished difference Result 365 states and 543 transitions. [2022-01-31 16:20:35,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:35,753 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:35,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:35,754 INFO L225 Difference]: With dead ends: 365 [2022-01-31 16:20:35,754 INFO L226 Difference]: Without dead ends: 363 [2022-01-31 16:20:35,755 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:35,755 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 110 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:35,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 337 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 474 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-01-31 16:20:35,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-01-31 16:20:35,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 282. [2022-01-31 16:20:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 277 states have (on average 1.5451263537906137) internal successors, (428), 277 states have internal predecessors, (428), 3 states have call successors, (3), 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,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2022-01-31 16:20:35,761 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 92 [2022-01-31 16:20:35,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:35,761 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2022-01-31 16:20:35,762 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:35,762 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2022-01-31 16:20:35,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-31 16:20:35,763 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:35,763 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, 1] [2022-01-31 16:20:35,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 16:20:35,763 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:35,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:35,764 INFO L85 PathProgramCache]: Analyzing trace with hash -162237622, now seen corresponding path program 1 times [2022-01-31 16:20:35,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:35,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80278869] [2022-01-31 16:20:35,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:35,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:35,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:35,878 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:35,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:35,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80278869] [2022-01-31 16:20:35,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80278869] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:35,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:35,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:35,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325885396] [2022-01-31 16:20:35,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:35,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:35,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:35,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:35,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:35,880 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 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,889 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,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:38,341 INFO L93 Difference]: Finished difference Result 383 states and 581 transitions. [2022-01-31 16:20:38,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:38,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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 121 [2022-01-31 16:20:38,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:38,343 INFO L225 Difference]: With dead ends: 383 [2022-01-31 16:20:38,343 INFO L226 Difference]: Without dead ends: 383 [2022-01-31 16:20:38,343 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:38,344 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 82 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:38,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 482 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 516 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 16:20:38,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-01-31 16:20:38,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 316. [2022-01-31 16:20:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 311 states have (on average 1.5530546623794212) internal successors, (483), 311 states have internal predecessors, (483), 3 states have call successors, (3), 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,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 487 transitions. [2022-01-31 16:20:38,350 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 487 transitions. Word has length 121 [2022-01-31 16:20:38,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:38,350 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 487 transitions. [2022-01-31 16:20:38,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 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,350 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 487 transitions. [2022-01-31 16:20:38,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-31 16:20:38,351 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:38,352 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, 1] [2022-01-31 16:20:38,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 16:20:38,352 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:38,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:38,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1117758901, now seen corresponding path program 1 times [2022-01-31 16:20:38,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:38,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289658015] [2022-01-31 16:20:38,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:38,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:38,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:38,465 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:38,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:38,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289658015] [2022-01-31 16:20:38,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289658015] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:38,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:38,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:38,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741311103] [2022-01-31 16:20:38,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:38,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:38,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:38,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:38,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:38,467 INFO L87 Difference]: Start difference. First operand 316 states and 487 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 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,476 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:40,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:40,981 INFO L93 Difference]: Finished difference Result 435 states and 661 transitions. [2022-01-31 16:20:40,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:40,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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 121 [2022-01-31 16:20:40,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:40,983 INFO L225 Difference]: With dead ends: 435 [2022-01-31 16:20:40,983 INFO L226 Difference]: Without dead ends: 435 [2022-01-31 16:20:40,983 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,984 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 117 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:40,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 353 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 469 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-01-31 16:20:40,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-01-31 16:20:40,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 314. [2022-01-31 16:20:40,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 309 states have (on average 1.5533980582524272) internal successors, (480), 309 states have internal predecessors, (480), 3 states have call successors, (3), 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,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 484 transitions. [2022-01-31 16:20:40,990 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 484 transitions. Word has length 121 [2022-01-31 16:20:40,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:40,990 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 484 transitions. [2022-01-31 16:20:40,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 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,990 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 484 transitions. [2022-01-31 16:20:40,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-01-31 16:20:40,992 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:40,992 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:20:40,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 16:20:40,992 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:40,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:40,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1374739250, now seen corresponding path program 1 times [2022-01-31 16:20:40,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:40,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70043148] [2022-01-31 16:20:40,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:40,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:41,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-01-31 16:20:41,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:41,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70043148] [2022-01-31 16:20:41,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70043148] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:41,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:41,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:20:41,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351444265] [2022-01-31 16:20:41,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:41,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:20:41,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:41,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:20:41,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:20:41,110 INFO L87 Difference]: Start difference. First operand 314 states and 484 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 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,125 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:43,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:43,580 INFO L93 Difference]: Finished difference Result 385 states and 575 transitions. [2022-01-31 16:20:43,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:20:43,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 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 127 [2022-01-31 16:20:43,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:43,582 INFO L225 Difference]: With dead ends: 385 [2022-01-31 16:20:43,582 INFO L226 Difference]: Without dead ends: 385 [2022-01-31 16:20:43,582 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:43,583 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 140 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 325 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.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:43,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 325 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-01-31 16:20:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-01-31 16:20:43,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 314. [2022-01-31 16:20:43,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 309 states have (on average 1.5372168284789645) internal successors, (475), 309 states have internal predecessors, (475), 3 states have call successors, (3), 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,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 479 transitions. [2022-01-31 16:20:43,589 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 479 transitions. Word has length 127 [2022-01-31 16:20:43,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:43,589 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 479 transitions. [2022-01-31 16:20:43,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 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,589 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 479 transitions. [2022-01-31 16:20:43,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-31 16:20:43,590 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:43,591 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:43,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 16:20:43,591 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:43,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:43,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1496927688, now seen corresponding path program 1 times [2022-01-31 16:20:43,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:43,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337255145] [2022-01-31 16:20:43,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:43,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:43,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 16:20:43,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:43,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337255145] [2022-01-31 16:20:43,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337255145] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:43,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:43,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 16:20:43,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723447669] [2022-01-31 16:20:43,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:43,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 16:20:43,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:43,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 16:20:43,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:20:43,718 INFO L87 Difference]: Start difference. First operand 314 states and 479 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 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,735 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:46,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:46,135 INFO L93 Difference]: Finished difference Result 602 states and 923 transitions. [2022-01-31 16:20:46,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 16:20:46,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 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 132 [2022-01-31 16:20:46,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:46,138 INFO L225 Difference]: With dead ends: 602 [2022-01-31 16:20:46,139 INFO L226 Difference]: Without dead ends: 602 [2022-01-31 16:20:46,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:20:46,139 INFO L933 BasicCegarLoop]: 370 mSDtfsCounter, 143 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:46,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 565 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 395 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 16:20:46,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-01-31 16:20:46,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2022-01-31 16:20:46,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 595 states have (on average 1.542857142857143) internal successors, (918), 595 states have internal predecessors, (918), 3 states have call successors, (3), 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:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 922 transitions. [2022-01-31 16:20:46,150 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 922 transitions. Word has length 132 [2022-01-31 16:20:46,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:46,150 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 922 transitions. [2022-01-31 16:20:46,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 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:46,151 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 922 transitions. [2022-01-31 16:20:46,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-31 16:20:46,152 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:46,152 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:46,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 16:20:46,152 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:46,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:46,153 INFO L85 PathProgramCache]: Analyzing trace with hash 472233767, now seen corresponding path program 1 times [2022-01-31 16:20:46,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:46,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809625909] [2022-01-31 16:20:46,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:46,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:46,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-31 16:20:46,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:46,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809625909] [2022-01-31 16:20:46,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809625909] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:46,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:46,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 16:20:46,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944817497] [2022-01-31 16:20:46,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:46,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 16:20:46,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:46,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 16:20:46,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:20:46,264 INFO L87 Difference]: Start difference. First operand 600 states and 922 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 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,272 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,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:48,616 INFO L93 Difference]: Finished difference Result 841 states and 1289 transitions. [2022-01-31 16:20:48,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 16:20:48,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 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 132 [2022-01-31 16:20:48,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:48,620 INFO L225 Difference]: With dead ends: 841 [2022-01-31 16:20:48,620 INFO L226 Difference]: Without dead ends: 841 [2022-01-31 16:20:48,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:20:48,621 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 138 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:48,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 438 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 267 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-01-31 16:20:48,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-01-31 16:20:48,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2022-01-31 16:20:48,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 836 states have (on average 1.5370813397129186) internal successors, (1285), 836 states have internal predecessors, (1285), 3 states have call successors, (3), 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,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1289 transitions. [2022-01-31 16:20:48,634 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1289 transitions. Word has length 132 [2022-01-31 16:20:48,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:48,634 INFO L470 AbstractCegarLoop]: Abstraction has 841 states and 1289 transitions. [2022-01-31 16:20:48,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 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,635 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1289 transitions. [2022-01-31 16:20:48,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-31 16:20:48,636 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:48,636 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,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 16:20:48,636 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:48,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:48,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1640430022, now seen corresponding path program 1 times [2022-01-31 16:20:48,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:48,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873586774] [2022-01-31 16:20:48,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:48,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:48,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-31 16:20:48,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:48,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873586774] [2022-01-31 16:20:48,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873586774] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:48,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:48,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 16:20:48,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073936091] [2022-01-31 16:20:48,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:48,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 16:20:48,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:48,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 16:20:48,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:20:48,732 INFO L87 Difference]: Start difference. First operand 841 states and 1289 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:20:50,749 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:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:50,982 INFO L93 Difference]: Finished difference Result 868 states and 1324 transitions. [2022-01-31 16:20:50,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 16:20:50,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-01-31 16:20:50,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:50,985 INFO L225 Difference]: With dead ends: 868 [2022-01-31 16:20:50,985 INFO L226 Difference]: Without dead ends: 868 [2022-01-31 16:20:50,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:20:50,986 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 15 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:50,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 411 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-31 16:20:50,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-01-31 16:20:50,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2022-01-31 16:20:50,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 863 states have (on average 1.52954808806489) internal successors, (1320), 863 states have internal predecessors, (1320), 3 states have call successors, (3), 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:50,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1324 transitions. [2022-01-31 16:20:50,999 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1324 transitions. Word has length 132 [2022-01-31 16:20:50,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:50,999 INFO L470 AbstractCegarLoop]: Abstraction has 868 states and 1324 transitions. [2022-01-31 16:20:51,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:20:51,000 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1324 transitions. [2022-01-31 16:20:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-31 16:20:51,001 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:51,002 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:51,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 16:20:51,002 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:51,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:51,002 INFO L85 PathProgramCache]: Analyzing trace with hash -818694427, now seen corresponding path program 1 times [2022-01-31 16:20:51,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:51,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028447419] [2022-01-31 16:20:51,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:51,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:51,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-01-31 16:20:51,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:51,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028447419] [2022-01-31 16:20:51,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028447419] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:51,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:51,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 16:20:51,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386818973] [2022-01-31 16:20:51,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:51,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 16:20:51,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:51,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 16:20:51,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:20:51,096 INFO L87 Difference]: Start difference. First operand 868 states and 1324 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:20:53,105 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:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:53,359 INFO L93 Difference]: Finished difference Result 584 states and 878 transitions. [2022-01-31 16:20:53,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 16:20:53,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-01-31 16:20:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:53,361 INFO L225 Difference]: With dead ends: 584 [2022-01-31 16:20:53,361 INFO L226 Difference]: Without dead ends: 584 [2022-01-31 16:20:53,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:20:53,362 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 4 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:53,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 388 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-01-31 16:20:53,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-01-31 16:20:53,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2022-01-31 16:20:53,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 579 states have (on average 1.5094991364421417) internal successors, (874), 579 states have internal predecessors, (874), 3 states have call successors, (3), 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:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 878 transitions. [2022-01-31 16:20:53,389 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 878 transitions. Word has length 132 [2022-01-31 16:20:53,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:53,389 INFO L470 AbstractCegarLoop]: Abstraction has 584 states and 878 transitions. [2022-01-31 16:20:53,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:20:53,389 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 878 transitions. [2022-01-31 16:20:53,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-01-31 16:20:53,390 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:53,391 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, 1] [2022-01-31 16:20:53,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 16:20:53,391 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:53,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:53,392 INFO L85 PathProgramCache]: Analyzing trace with hash -839880001, now seen corresponding path program 1 times [2022-01-31 16:20:53,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:53,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817177997] [2022-01-31 16:20:53,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:53,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:53,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:20:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:20:53,841 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:53,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:20:53,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817177997] [2022-01-31 16:20:53,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817177997] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:20:53,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:20:53,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 16:20:53,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046263668] [2022-01-31 16:20:53,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:20:53,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 16:20:53,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:20:53,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 16:20:53,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-31 16:20:53,843 INFO L87 Difference]: Start difference. First operand 584 states and 878 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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:55,865 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:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:20:56,344 INFO L93 Difference]: Finished difference Result 592 states and 888 transitions. [2022-01-31 16:20:56,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:20:56,345 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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 133 [2022-01-31 16:20:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:20:56,347 INFO L225 Difference]: With dead ends: 592 [2022-01-31 16:20:56,347 INFO L226 Difference]: Without dead ends: 584 [2022-01-31 16:20:56,347 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:56,348 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 7 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:20:56,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 797 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 429 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-01-31 16:20:56,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-01-31 16:20:56,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2022-01-31 16:20:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 579 states have (on average 1.5077720207253886) internal successors, (873), 579 states have internal predecessors, (873), 3 states have call successors, (3), 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:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 877 transitions. [2022-01-31 16:20:56,357 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 877 transitions. Word has length 133 [2022-01-31 16:20:56,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:20:56,358 INFO L470 AbstractCegarLoop]: Abstraction has 584 states and 877 transitions. [2022-01-31 16:20:56,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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:56,358 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 877 transitions. [2022-01-31 16:20:56,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-01-31 16:20:56,359 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:20:56,359 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, 1] [2022-01-31 16:20:56,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 16:20:56,360 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:20:56,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:20:56,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1090350848, now seen corresponding path program 1 times [2022-01-31 16:20:56,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:20:56,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522046095] [2022-01-31 16:20:56,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:20:56,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:20:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 16:20:56,833 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-31 16:20:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 16:20:57,082 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-31 16:20:57,083 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-31 16:20:57,084 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 16:20:57,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 16:20:57,092 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, 1, 1, 1, 1, 1] [2022-01-31 16:20:57,096 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 16:20:57,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:20:57 BasicIcfg [2022-01-31 16:20:57,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 16:20:57,203 INFO L158 Benchmark]: Toolchain (without parser) took 84560.02ms. Allocated memory was 176.2MB in the beginning and 252.7MB in the end (delta: 76.5MB). Free memory was 120.4MB in the beginning and 101.3MB in the end (delta: 19.1MB). Peak memory consumption was 97.2MB. Max. memory is 8.0GB. [2022-01-31 16:20:57,207 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory was 139.3MB in the beginning and 139.2MB in the end (delta: 80.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 16:20:57,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 629.13ms. Allocated memory is still 176.2MB. Free memory was 120.1MB in the beginning and 128.8MB in the end (delta: -8.7MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. [2022-01-31 16:20:57,209 INFO L158 Benchmark]: Boogie Preprocessor took 126.33ms. Allocated memory is still 176.2MB. Free memory was 128.8MB in the beginning and 121.5MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-01-31 16:20:57,210 INFO L158 Benchmark]: RCFGBuilder took 3220.20ms. Allocated memory was 176.2MB in the beginning and 252.7MB in the end (delta: 76.5MB). Free memory was 121.0MB in the beginning and 211.7MB in the end (delta: -90.8MB). Peak memory consumption was 77.0MB. Max. memory is 8.0GB. [2022-01-31 16:20:57,210 INFO L158 Benchmark]: IcfgTransformer took 85.67ms. Allocated memory is still 252.7MB. Free memory was 211.7MB in the beginning and 205.9MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-31 16:20:57,214 INFO L158 Benchmark]: TraceAbstraction took 80492.14ms. Allocated memory is still 252.7MB. Free memory was 205.4MB in the beginning and 101.3MB in the end (delta: 104.2MB). Peak memory consumption was 104.7MB. Max. memory is 8.0GB. [2022-01-31 16:20:57,217 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.16ms. Allocated memory is still 176.2MB. Free memory was 139.3MB in the beginning and 139.2MB in the end (delta: 80.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 629.13ms. Allocated memory is still 176.2MB. Free memory was 120.1MB in the beginning and 128.8MB in the end (delta: -8.7MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 126.33ms. Allocated memory is still 176.2MB. Free memory was 128.8MB in the beginning and 121.5MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 3220.20ms. Allocated memory was 176.2MB in the beginning and 252.7MB in the end (delta: 76.5MB). Free memory was 121.0MB in the beginning and 211.7MB in the end (delta: -90.8MB). Peak memory consumption was 77.0MB. Max. memory is 8.0GB. * IcfgTransformer took 85.67ms. Allocated memory is still 252.7MB. Free memory was 211.7MB in the beginning and 205.9MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * TraceAbstraction took 80492.14ms. Allocated memory is still 252.7MB. Free memory was 205.4MB in the beginning and 101.3MB in the end (delta: 104.2MB). Peak memory consumption was 104.7MB. 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: 1737]: 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 1151. 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={-4294967296:0}, SSLv3_server_data={4:0}] [L1112] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp = __VERIFIER_nondet_long() ; [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 ; [L1126] int tmp___4 ; [L1127] int tmp___5 ; [L1128] int tmp___6 ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 ; [L1132] int tmp___10 ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] Time = tmp [L1141] cb = (void (*)())((void *)0) [L1142] ret = -1 [L1143] skip = 0 [L1144] got_new_session = 0 [L1145] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:11}, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->info_callback={0:-1}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1145] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1146] EXPR s->info_callback [L1146] cb = s->info_callback [L1150] EXPR s->in_handshake [L1150] s->in_handshake += 1 [L1151] COND FALSE !(tmp___1 & 12288) VAL [={0:-1}, blastFlag=0, buf={0:11}, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1160] EXPR s->cert VAL [={0:-1}, blastFlag=0, buf={0:11}, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1160] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1166] COND TRUE 1 VAL [={0:-1}, blastFlag=0, buf={0:11}, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-1}, blastFlag=0, buf={0:11}, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-1}, blastFlag=0, buf={0:11}, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-1}, blastFlag=0, buf={0:11}, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-1}, blastFlag=0, buf={0:11}, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-1}, blastFlag=0, buf={0:11}, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-1}, blastFlag=0, buf={0:11}, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-1}, blastFlag=0, buf={0:11}, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-1}, blastFlag=0, buf={0:11}, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-1}, blastFlag=0, buf={0:11}, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1193] COND TRUE s->state == 8464 [L1349] s->shutdown = 0 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 0 [L1352] blastFlag = 1 VAL [={0:-1}, blastFlag=1, buf={0:11}, got_new_session=0, init=1, ret=9, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1356] COND FALSE !(ret <= 0) [L1361] got_new_session = 1 [L1362] s->state = 8496 [L1363] s->init_num = 0 VAL [={0:-1}, blastFlag=1, buf={0:11}, got_new_session=1, init=1, ret=9, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:-1}, (s->s3)->tmp.reuse_message=4294967338, blastFlag=1, buf={0:11}, got_new_session=1, init=1, ret=9, s={-4294967296:0}, s={-4294967296:0}, s->s3={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:-1}, blastFlag=1, buf={0:11}, got_new_session=1, init=1, ret=9, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1166] COND TRUE 1 VAL [={0:-1}, blastFlag=1, buf={0:11}, got_new_session=1, init=1, ret=9, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-1}, blastFlag=1, buf={0:11}, got_new_session=1, init=1, ret=9, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-1}, blastFlag=1, buf={0:11}, got_new_session=1, init=1, ret=9, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-1}, blastFlag=1, buf={0:11}, got_new_session=1, init=1, ret=9, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-1}, blastFlag=1, buf={0:11}, got_new_session=1, init=1, ret=9, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-1}, blastFlag=1, buf={0:11}, got_new_session=1, init=1, ret=9, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-1}, blastFlag=1, buf={0:11}, got_new_session=1, init=1, ret=9, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-1}, blastFlag=1, buf={0:11}, got_new_session=1, init=1, ret=9, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-1}, blastFlag=1, buf={0:11}, got_new_session=1, init=1, ret=9, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-1}, blastFlag=1, buf={0:11}, got_new_session=1, init=1, ret=9, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:-1}, blastFlag=1, buf={0:11}, got_new_session=1, init=1, ret=9, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:-1}, blastFlag=1, buf={0:11}, got_new_session=1, init=1, ret=9, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:-1}, blastFlag=1, buf={0:11}, got_new_session=1, init=1, ret=9, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1202] COND TRUE s->state == 8496 [L1367] ret = __VERIFIER_nondet_int() [L1368] COND TRUE blastFlag == 1 [L1369] blastFlag = 2 VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1373] COND FALSE !(ret <= 0) [L1378] s->hit VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->hit=7, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1378] COND TRUE s->hit [L1379] s->state = 8656 VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1383] s->init_num = 0 VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:-1}, (s->s3)->tmp.reuse_message=4294967338, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->s3={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1166] COND TRUE 1 VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:-1}, blastFlag=2, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1259] COND TRUE s->state == 8656 [L1583] EXPR s->session [L1583] EXPR s->s3 [L1583] EXPR (s->s3)->tmp.new_cipher [L1583] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1584] tmp___9 = __VERIFIER_nondet_int() [L1585] COND FALSE !(! tmp___9) [L1591] ret = __VERIFIER_nondet_int() [L1592] COND TRUE blastFlag == 2 [L1593] blastFlag = 5 VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0, tmp___9=13] [L1597] COND FALSE !(ret <= 0) [L1602] s->state = 8672 [L1603] s->init_num = 0 [L1604] tmp___10 = __VERIFIER_nondet_int() [L1605] COND FALSE !(! tmp___10) VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:-1}, (s->s3)->tmp.reuse_message=4294967338, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->s3={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1166] COND TRUE 1 VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1259] COND FALSE !(s->state == 8656) [L1262] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1262] COND FALSE !(s->state == 8657) [L1265] EXPR s->state VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1265] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND FALSE !(blastFlag == 4) VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=0, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1618] COND TRUE blastFlag == 5 VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=0, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] [L1737] reach_error() VAL [={0:-1}, blastFlag=5, buf={0:11}, got_new_session=1, init=1, ret=0, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=-14, tmp___2=0, tmp___8=0, tmp___9=13] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 80.3s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 75.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 30 mSolverCounterUnknown, 1851 SdHoareTripleChecker+Valid, 74.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1851 mSDsluCounter, 11586 SdHoareTripleChecker+Invalid, 72.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7016 mSDsCounter, 692 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10381 IncrementalHoareTripleChecker+Invalid, 11103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 692 mSolverCounterUnsat, 4570 mSDtfsCounter, 10381 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=868occurred in iteration=24, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 1107 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2486 NumberOfCodeBlocks, 2486 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2327 ConstructedInterpolants, 0 QuantifiedInterpolants, 6015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 1067/1067 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:57,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...