/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/loops/s3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 17:38:01,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 17:38:01,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 17:38:01,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 17:38:01,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 17:38:01,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 17:38:01,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 17:38:01,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 17:38:01,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 17:38:01,638 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 17:38:01,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 17:38:01,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 17:38:01,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 17:38:01,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 17:38:01,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 17:38:01,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 17:38:01,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 17:38:01,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 17:38:01,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 17:38:01,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 17:38:01,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 17:38:01,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 17:38:01,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 17:38:01,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 17:38:01,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 17:38:01,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 17:38:01,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 17:38:01,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 17:38:01,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 17:38:01,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 17:38:01,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 17:38:01,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 17:38:01,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 17:38:01,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 17:38:01,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 17:38:01,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 17:38:01,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 17:38:01,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 17:38:01,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 17:38:01,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 17:38:01,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 17:38:01,657 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2021-05-02 17:38:01,664 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 17:38:01,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 17:38:01,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 17:38:01,665 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 17:38:01,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 17:38:01,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 17:38:01,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 17:38:01,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 17:38:01,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 17:38:01,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 17:38:01,665 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 17:38:01,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 17:38:01,666 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 17:38:01,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 17:38:01,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 17:38:01,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 17:38:01,666 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 17:38:01,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 17:38:01,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 17:38:01,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 17:38:01,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 17:38:01,667 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-05-02 17:38:01,667 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; [2021-05-02 17:38:01,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 17:38:01,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 17:38:01,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 17:38:01,915 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 17:38:01,915 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 17:38:01,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/s3.i [2021-05-02 17:38:01,962 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b48ce24/ac598187e31e4597a4ec40b0b1903444/FLAG36daabe86 [2021-05-02 17:38:02,402 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 17:38:02,403 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i [2021-05-02 17:38:02,416 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b48ce24/ac598187e31e4597a4ec40b0b1903444/FLAG36daabe86 [2021-05-02 17:38:02,766 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b48ce24/ac598187e31e4597a4ec40b0b1903444 [2021-05-02 17:38:02,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 17:38:02,769 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-05-02 17:38:02,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 17:38:02,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 17:38:02,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 17:38:02,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 05:38:02" (1/1) ... [2021-05-02 17:38:02,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68a611dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:38:02, skipping insertion in model container [2021-05-02 17:38:02,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 05:38:02" (1/1) ... [2021-05-02 17:38:02,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 17:38:02,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 17:38:03,067 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i[63567,63580] [2021-05-02 17:38:03,073 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 17:38:03,087 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 17:38:03,148 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i[63567,63580] [2021-05-02 17:38:03,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 17:38:03,161 INFO L208 MainTranslator]: Completed translation [2021-05-02 17:38:03,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:38:03 WrapperNode [2021-05-02 17:38:03,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 17:38:03,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 17:38:03,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 17:38:03,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 17:38:03,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:38:03" (1/1) ... [2021-05-02 17:38:03,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:38:03" (1/1) ... [2021-05-02 17:38:03,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:38:03" (1/1) ... [2021-05-02 17:38:03,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:38:03" (1/1) ... [2021-05-02 17:38:03,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:38:03" (1/1) ... [2021-05-02 17:38:03,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:38:03" (1/1) ... [2021-05-02 17:38:03,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:38:03" (1/1) ... [2021-05-02 17:38:03,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 17:38:03,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 17:38:03,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 17:38:03,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 17:38:03,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:38:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 17:38:03,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 17:38:03,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 17:38:03,316 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 17:38:03,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2021-05-02 17:38:03,316 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2021-05-02 17:38:03,316 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 17:38:03,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2021-05-02 17:38:03,316 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2021-05-02 17:38:03,316 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-05-02 17:38:03,317 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-05-02 17:38:03,317 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 17:38:03,317 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 17:38:03,317 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 17:38:03,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 17:38:03,317 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-05-02 17:38:03,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 17:38:03,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2021-05-02 17:38:03,318 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2021-05-02 17:38:03,318 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2021-05-02 17:38:03,318 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2021-05-02 17:38:03,320 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2021-05-02 17:38:03,320 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2021-05-02 17:38:03,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-05-02 17:38:03,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-05-02 17:38:03,320 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 17:38:03,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-05-02 17:38:03,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 17:38:03,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-05-02 17:38:03,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 17:38:03,320 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-05-02 17:38:03,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-05-02 17:38:03,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 17:38:03,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 17:38:03,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 17:38:03,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-05-02 17:38:03,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-05-02 17:38:03,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-05-02 17:38:03,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-05-02 17:38:03,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 17:38:03,662 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-05-02 17:38:04,083 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-05-02 17:38:04,083 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-05-02 17:38:04,111 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 17:38:04,111 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-02 17:38:04,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 05:38:04 BoogieIcfgContainer [2021-05-02 17:38:04,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 17:38:04,114 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2021-05-02 17:38:04,114 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2021-05-02 17:38:04,114 INFO L275 PluginConnector]: IcfgTransformer initialized [2021-05-02 17:38:04,116 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 05:38:04" (1/1) ... [2021-05-02 17:38:04,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 02.05 05:38:04 BasicIcfg [2021-05-02 17:38:04,157 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2021-05-02 17:38:04,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 17:38:04,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 17:38:04,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 17:38:04,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 05:38:02" (1/4) ... [2021-05-02 17:38:04,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7faf4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 05:38:04, skipping insertion in model container [2021-05-02 17:38:04,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:38:03" (2/4) ... [2021-05-02 17:38:04,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7faf4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 05:38:04, skipping insertion in model container [2021-05-02 17:38:04,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 05:38:04" (3/4) ... [2021-05-02 17:38:04,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7faf4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 05:38:04, skipping insertion in model container [2021-05-02 17:38:04,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 02.05 05:38:04" (4/4) ... [2021-05-02 17:38:04,165 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.iJordan [2021-05-02 17:38:04,169 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2021-05-02 17:38:04,173 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 17:38:04,184 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 17:38:04,205 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 17:38:04,206 INFO L377 AbstractCegarLoop]: Hoare is false [2021-05-02 17:38:04,206 INFO L378 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2021-05-02 17:38:04,206 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 17:38:04,206 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 17:38:04,206 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 17:38:04,206 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 17:38:04,206 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 17:38:04,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 17:38:04,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-05-02 17:38:04,229 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:04,230 INFO L523 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] [2021-05-02 17:38:04,230 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:04,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:04,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1407118819, now seen corresponding path program 1 times [2021-05-02 17:38:04,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:04,250 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913526395] [2021-05-02 17:38:04,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:04,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:38:04,520 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:04,520 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913526395] [2021-05-02 17:38:04,520 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913526395] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:04,520 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:04,520 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 17:38:04,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124421679] [2021-05-02 17:38:04,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 17:38:04,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:04,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 17:38:04,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 17:38:04,532 INFO L87 Difference]: Start difference. First operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:04,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:04,933 INFO L93 Difference]: Finished difference Result 258 states and 416 transitions. [2021-05-02 17:38:04,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 17:38:04,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-05-02 17:38:04,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:04,942 INFO L225 Difference]: With dead ends: 258 [2021-05-02 17:38:04,942 INFO L226 Difference]: Without dead ends: 223 [2021-05-02 17:38:04,943 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.8ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 17:38:04,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-05-02 17:38:04,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2021-05-02 17:38:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:04,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2021-05-02 17:38:04,973 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2021-05-02 17:38:04,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:04,973 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2021-05-02 17:38:04,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:04,973 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2021-05-02 17:38:04,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-02 17:38:04,975 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:04,975 INFO L523 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] [2021-05-02 17:38:04,975 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 17:38:04,975 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:04,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:04,976 INFO L82 PathProgramCache]: Analyzing trace with hash -455653265, now seen corresponding path program 1 times [2021-05-02 17:38:04,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:04,976 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259373179] [2021-05-02 17:38:04,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:05,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:05,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:38:05,098 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:05,098 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259373179] [2021-05-02 17:38:05,098 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259373179] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:05,098 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:05,098 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 17:38:05,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893356931] [2021-05-02 17:38:05,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 17:38:05,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:05,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 17:38:05,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 17:38:05,103 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:05,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:05,631 INFO L93 Difference]: Finished difference Result 325 states and 476 transitions. [2021-05-02 17:38:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 17:38:05,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 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 45 [2021-05-02 17:38:05,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:05,635 INFO L225 Difference]: With dead ends: 325 [2021-05-02 17:38:05,635 INFO L226 Difference]: Without dead ends: 325 [2021-05-02 17:38:05,635 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 17:38:05,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-05-02 17:38:05,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-05-02 17:38:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2021-05-02 17:38:05,648 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2021-05-02 17:38:05,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:05,648 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2021-05-02 17:38:05,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2021-05-02 17:38:05,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-05-02 17:38:05,650 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:05,650 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-02 17:38:05,650 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 17:38:05,650 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:05,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:05,651 INFO L82 PathProgramCache]: Analyzing trace with hash 702475222, now seen corresponding path program 1 times [2021-05-02 17:38:05,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:05,651 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314558222] [2021-05-02 17:38:05,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:05,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 17:38:05,747 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:05,747 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314558222] [2021-05-02 17:38:05,747 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314558222] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:05,747 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:05,747 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:05,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803899169] [2021-05-02 17:38:05,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:05,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:05,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:05,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:05,749 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:06,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:06,310 INFO L93 Difference]: Finished difference Result 513 states and 755 transitions. [2021-05-02 17:38:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:06,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2021-05-02 17:38:06,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:06,313 INFO L225 Difference]: With dead ends: 513 [2021-05-02 17:38:06,313 INFO L226 Difference]: Without dead ends: 513 [2021-05-02 17:38:06,313 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:06,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-05-02 17:38:06,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2021-05-02 17:38:06,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2021-05-02 17:38:06,323 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2021-05-02 17:38:06,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:06,324 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2021-05-02 17:38:06,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2021-05-02 17:38:06,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-05-02 17:38:06,330 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:06,330 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-02 17:38:06,330 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 17:38:06,330 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:06,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:06,331 INFO L82 PathProgramCache]: Analyzing trace with hash 635468469, now seen corresponding path program 1 times [2021-05-02 17:38:06,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:06,331 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528459827] [2021-05-02 17:38:06,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:06,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 17:38:06,522 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:06,522 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528459827] [2021-05-02 17:38:06,522 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528459827] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:06,522 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:06,522 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:06,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360283745] [2021-05-02 17:38:06,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:06,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:06,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:06,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:06,524 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:06,985 INFO L93 Difference]: Finished difference Result 459 states and 685 transitions. [2021-05-02 17:38:06,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:06,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2021-05-02 17:38:06,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:06,987 INFO L225 Difference]: With dead ends: 459 [2021-05-02 17:38:06,987 INFO L226 Difference]: Without dead ends: 459 [2021-05-02 17:38:06,987 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:06,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-05-02 17:38:06,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2021-05-02 17:38:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 410 states have (on average 1.526829268292683) internal successors, (626), 410 states have internal predecessors, (626), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2021-05-02 17:38:06,995 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2021-05-02 17:38:06,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:06,995 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2021-05-02 17:38:06,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:06,995 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2021-05-02 17:38:06,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-02 17:38:06,997 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:06,997 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-02 17:38:06,997 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 17:38:06,997 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:06,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:06,997 INFO L82 PathProgramCache]: Analyzing trace with hash 302842584, now seen corresponding path program 1 times [2021-05-02 17:38:06,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:06,998 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659100843] [2021-05-02 17:38:06,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:07,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 17:38:07,079 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:07,079 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659100843] [2021-05-02 17:38:07,079 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659100843] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:07,079 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:07,079 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:07,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001628030] [2021-05-02 17:38:07,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:07,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:07,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:07,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:07,082 INFO L87 Difference]: Start difference. First operand 415 states and 630 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:07,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:07,700 INFO L93 Difference]: Finished difference Result 547 states and 814 transitions. [2021-05-02 17:38:07,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:07,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2021-05-02 17:38:07,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:07,702 INFO L225 Difference]: With dead ends: 547 [2021-05-02 17:38:07,702 INFO L226 Difference]: Without dead ends: 547 [2021-05-02 17:38:07,703 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-05-02 17:38:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 417. [2021-05-02 17:38:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 412 states have (on average 1.5242718446601942) internal successors, (628), 412 states have internal predecessors, (628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 632 transitions. [2021-05-02 17:38:07,710 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 632 transitions. Word has length 64 [2021-05-02 17:38:07,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:07,710 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 632 transitions. [2021-05-02 17:38:07,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 632 transitions. [2021-05-02 17:38:07,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-02 17:38:07,711 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:07,711 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-02 17:38:07,711 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 17:38:07,711 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:07,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:07,711 INFO L82 PathProgramCache]: Analyzing trace with hash 799385778, now seen corresponding path program 1 times [2021-05-02 17:38:07,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:07,712 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517480501] [2021-05-02 17:38:07,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:07,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:07,777 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 17:38:07,777 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:07,777 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517480501] [2021-05-02 17:38:07,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517480501] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:07,777 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:07,777 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:07,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95255043] [2021-05-02 17:38:07,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:07,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:07,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:07,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:07,778 INFO L87 Difference]: Start difference. First operand 417 states and 632 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:08,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:08,358 INFO L93 Difference]: Finished difference Result 547 states and 812 transitions. [2021-05-02 17:38:08,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:08,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2021-05-02 17:38:08,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:08,360 INFO L225 Difference]: With dead ends: 547 [2021-05-02 17:38:08,360 INFO L226 Difference]: Without dead ends: 547 [2021-05-02 17:38:08,360 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:08,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-05-02 17:38:08,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 419. [2021-05-02 17:38:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.5217391304347827) internal successors, (630), 414 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2021-05-02 17:38:08,367 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 65 [2021-05-02 17:38:08,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:08,367 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2021-05-02 17:38:08,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:08,368 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2021-05-02 17:38:08,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-05-02 17:38:08,368 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:08,368 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-02 17:38:08,368 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 17:38:08,369 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:08,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:08,369 INFO L82 PathProgramCache]: Analyzing trace with hash -987893291, now seen corresponding path program 1 times [2021-05-02 17:38:08,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:08,369 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240408786] [2021-05-02 17:38:08,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:08,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:08,438 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 17:38:08,438 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:08,438 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240408786] [2021-05-02 17:38:08,439 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240408786] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:08,439 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:08,439 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:08,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876931221] [2021-05-02 17:38:08,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:08,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:08,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:08,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:08,441 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:09,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:09,017 INFO L93 Difference]: Finished difference Result 537 states and 798 transitions. [2021-05-02 17:38:09,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:09,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2021-05-02 17:38:09,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:09,019 INFO L225 Difference]: With dead ends: 537 [2021-05-02 17:38:09,019 INFO L226 Difference]: Without dead ends: 537 [2021-05-02 17:38:09,019 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 49.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:09,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2021-05-02 17:38:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 421. [2021-05-02 17:38:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5192307692307692) internal successors, (632), 416 states have internal predecessors, (632), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 636 transitions. [2021-05-02 17:38:09,026 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 636 transitions. Word has length 66 [2021-05-02 17:38:09,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:09,026 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 636 transitions. [2021-05-02 17:38:09,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 636 transitions. [2021-05-02 17:38:09,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-02 17:38:09,027 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:09,027 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:09,027 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 17:38:09,027 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:09,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:09,028 INFO L82 PathProgramCache]: Analyzing trace with hash 712595926, now seen corresponding path program 1 times [2021-05-02 17:38:09,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:09,028 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242723182] [2021-05-02 17:38:09,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:09,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 17:38:09,097 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:09,097 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242723182] [2021-05-02 17:38:09,097 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242723182] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:09,097 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:09,097 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:09,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368607714] [2021-05-02 17:38:09,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:09,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:09,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:09,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:09,098 INFO L87 Difference]: Start difference. First operand 421 states and 636 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) [2021-05-02 17:38:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:09,628 INFO L93 Difference]: Finished difference Result 535 states and 794 transitions. [2021-05-02 17:38:09,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:09,633 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 78 [2021-05-02 17:38:09,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:09,634 INFO L225 Difference]: With dead ends: 535 [2021-05-02 17:38:09,634 INFO L226 Difference]: Without dead ends: 535 [2021-05-02 17:38:09,635 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:09,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-05-02 17:38:09,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2021-05-02 17:38:09,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5144230769230769) internal successors, (630), 416 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 634 transitions. [2021-05-02 17:38:09,642 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 634 transitions. Word has length 78 [2021-05-02 17:38:09,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:09,642 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 634 transitions. [2021-05-02 17:38:09,642 INFO L481 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) [2021-05-02 17:38:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 634 transitions. [2021-05-02 17:38:09,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-02 17:38:09,643 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:09,643 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:09,643 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 17:38:09,643 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:09,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:09,644 INFO L82 PathProgramCache]: Analyzing trace with hash -946707978, now seen corresponding path program 1 times [2021-05-02 17:38:09,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:09,644 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131806592] [2021-05-02 17:38:09,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:09,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 17:38:09,706 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:09,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131806592] [2021-05-02 17:38:09,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131806592] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:09,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:09,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:09,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613720825] [2021-05-02 17:38:09,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:09,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:09,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:09,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:09,707 INFO L87 Difference]: Start difference. First operand 421 states and 634 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) [2021-05-02 17:38:10,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:10,203 INFO L93 Difference]: Finished difference Result 535 states and 792 transitions. [2021-05-02 17:38:10,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:10,203 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 78 [2021-05-02 17:38:10,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:10,205 INFO L225 Difference]: With dead ends: 535 [2021-05-02 17:38:10,205 INFO L226 Difference]: Without dead ends: 535 [2021-05-02 17:38:10,205 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-05-02 17:38:10,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2021-05-02 17:38:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5096153846153846) internal successors, (628), 416 states have internal predecessors, (628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 632 transitions. [2021-05-02 17:38:10,211 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 632 transitions. Word has length 78 [2021-05-02 17:38:10,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:10,211 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 632 transitions. [2021-05-02 17:38:10,211 INFO L481 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) [2021-05-02 17:38:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 632 transitions. [2021-05-02 17:38:10,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-02 17:38:10,212 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:10,212 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2021-05-02 17:38:10,212 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 17:38:10,212 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:10,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:10,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1054477673, now seen corresponding path program 1 times [2021-05-02 17:38:10,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:10,213 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274887704] [2021-05-02 17:38:10,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:10,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 17:38:10,274 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:10,274 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274887704] [2021-05-02 17:38:10,274 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274887704] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:10,274 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:10,274 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:10,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441853734] [2021-05-02 17:38:10,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:10,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:10,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:10,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:10,275 INFO L87 Difference]: Start difference. First operand 421 states and 632 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) [2021-05-02 17:38:10,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:10,786 INFO L93 Difference]: Finished difference Result 535 states and 790 transitions. [2021-05-02 17:38:10,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:10,787 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 78 [2021-05-02 17:38:10,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:10,788 INFO L225 Difference]: With dead ends: 535 [2021-05-02 17:38:10,788 INFO L226 Difference]: Without dead ends: 535 [2021-05-02 17:38:10,789 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:10,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-05-02 17:38:10,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2021-05-02 17:38:10,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5048076923076923) internal successors, (626), 416 states have internal predecessors, (626), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 630 transitions. [2021-05-02 17:38:10,795 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 630 transitions. Word has length 78 [2021-05-02 17:38:10,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:10,795 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 630 transitions. [2021-05-02 17:38:10,795 INFO L481 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) [2021-05-02 17:38:10,795 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 630 transitions. [2021-05-02 17:38:10,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-02 17:38:10,796 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:10,796 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:10,796 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 17:38:10,796 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:10,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:10,796 INFO L82 PathProgramCache]: Analyzing trace with hash -210087657, now seen corresponding path program 1 times [2021-05-02 17:38:10,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:10,797 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307881016] [2021-05-02 17:38:10,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:10,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 17:38:10,869 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:10,870 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307881016] [2021-05-02 17:38:10,870 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307881016] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:10,870 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:10,870 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:10,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705613266] [2021-05-02 17:38:10,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:10,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:10,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:10,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:10,871 INFO L87 Difference]: Start difference. First operand 421 states and 630 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) [2021-05-02 17:38:11,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:11,257 INFO L93 Difference]: Finished difference Result 463 states and 681 transitions. [2021-05-02 17:38:11,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:11,257 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 78 [2021-05-02 17:38:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:11,259 INFO L225 Difference]: With dead ends: 463 [2021-05-02 17:38:11,259 INFO L226 Difference]: Without dead ends: 463 [2021-05-02 17:38:11,259 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:11,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-05-02 17:38:11,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2021-05-02 17:38:11,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5) internal successors, (624), 416 states have internal predecessors, (624), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:11,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 628 transitions. [2021-05-02 17:38:11,269 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 628 transitions. Word has length 78 [2021-05-02 17:38:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:11,271 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 628 transitions. [2021-05-02 17:38:11,271 INFO L481 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) [2021-05-02 17:38:11,271 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 628 transitions. [2021-05-02 17:38:11,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-02 17:38:11,272 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:11,272 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:11,272 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 17:38:11,272 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:11,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:11,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1869391561, now seen corresponding path program 1 times [2021-05-02 17:38:11,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:11,272 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989567354] [2021-05-02 17:38:11,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:11,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 17:38:11,341 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:11,341 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989567354] [2021-05-02 17:38:11,341 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989567354] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:11,341 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:11,341 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:11,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275459286] [2021-05-02 17:38:11,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:11,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:11,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:11,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:11,342 INFO L87 Difference]: Start difference. First operand 421 states and 628 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) [2021-05-02 17:38:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:11,739 INFO L93 Difference]: Finished difference Result 463 states and 679 transitions. [2021-05-02 17:38:11,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:11,740 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 78 [2021-05-02 17:38:11,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:11,741 INFO L225 Difference]: With dead ends: 463 [2021-05-02 17:38:11,741 INFO L226 Difference]: Without dead ends: 463 [2021-05-02 17:38:11,741 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:11,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-05-02 17:38:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2021-05-02 17:38:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4951923076923077) internal successors, (622), 416 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 626 transitions. [2021-05-02 17:38:11,747 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 626 transitions. Word has length 78 [2021-05-02 17:38:11,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:11,747 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 626 transitions. [2021-05-02 17:38:11,747 INFO L481 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) [2021-05-02 17:38:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 626 transitions. [2021-05-02 17:38:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-02 17:38:11,748 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:11,748 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2021-05-02 17:38:11,748 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-02 17:38:11,748 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:11,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:11,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1977161256, now seen corresponding path program 1 times [2021-05-02 17:38:11,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:11,749 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166304327] [2021-05-02 17:38:11,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:11,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:11,807 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 17:38:11,807 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:11,807 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166304327] [2021-05-02 17:38:11,807 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166304327] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:11,807 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:11,807 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:11,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823026295] [2021-05-02 17:38:11,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:11,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:11,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:11,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:11,808 INFO L87 Difference]: Start difference. First operand 421 states and 626 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) [2021-05-02 17:38:12,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:12,175 INFO L93 Difference]: Finished difference Result 463 states and 677 transitions. [2021-05-02 17:38:12,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:12,175 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 78 [2021-05-02 17:38:12,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:12,177 INFO L225 Difference]: With dead ends: 463 [2021-05-02 17:38:12,177 INFO L226 Difference]: Without dead ends: 463 [2021-05-02 17:38:12,177 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:12,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-05-02 17:38:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2021-05-02 17:38:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4903846153846154) internal successors, (620), 416 states have internal predecessors, (620), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:12,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 624 transitions. [2021-05-02 17:38:12,182 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 624 transitions. Word has length 78 [2021-05-02 17:38:12,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:12,182 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 624 transitions. [2021-05-02 17:38:12,182 INFO L481 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) [2021-05-02 17:38:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 624 transitions. [2021-05-02 17:38:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-02 17:38:12,183 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:12,183 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:12,183 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 17:38:12,184 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:12,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:12,184 INFO L82 PathProgramCache]: Analyzing trace with hash -913417389, now seen corresponding path program 1 times [2021-05-02 17:38:12,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:12,184 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805895781] [2021-05-02 17:38:12,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:12,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 17:38:12,245 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:12,245 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805895781] [2021-05-02 17:38:12,245 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805895781] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:12,245 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:12,245 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:12,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143908798] [2021-05-02 17:38:12,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:12,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:12,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:12,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:12,246 INFO L87 Difference]: Start difference. First operand 421 states and 624 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:12,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:12,754 INFO L93 Difference]: Finished difference Result 535 states and 782 transitions. [2021-05-02 17:38:12,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:12,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-05-02 17:38:12,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:12,756 INFO L225 Difference]: With dead ends: 535 [2021-05-02 17:38:12,756 INFO L226 Difference]: Without dead ends: 535 [2021-05-02 17:38:12,756 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:12,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-05-02 17:38:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2021-05-02 17:38:12,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4855769230769231) internal successors, (618), 416 states have internal predecessors, (618), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:12,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2021-05-02 17:38:12,762 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 79 [2021-05-02 17:38:12,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:12,762 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2021-05-02 17:38:12,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:12,762 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2021-05-02 17:38:12,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-02 17:38:12,763 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:12,763 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2021-05-02 17:38:12,763 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-02 17:38:12,763 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:12,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:12,763 INFO L82 PathProgramCache]: Analyzing trace with hash 597539124, now seen corresponding path program 1 times [2021-05-02 17:38:12,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:12,763 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363321942] [2021-05-02 17:38:12,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:12,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 17:38:12,843 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:12,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363321942] [2021-05-02 17:38:12,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363321942] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:12,843 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:12,843 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:12,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605427401] [2021-05-02 17:38:12,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:12,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:12,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:12,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:12,844 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:13,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:13,314 INFO L93 Difference]: Finished difference Result 529 states and 773 transitions. [2021-05-02 17:38:13,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:13,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-05-02 17:38:13,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:13,316 INFO L225 Difference]: With dead ends: 529 [2021-05-02 17:38:13,316 INFO L226 Difference]: Without dead ends: 529 [2021-05-02 17:38:13,316 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:13,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-05-02 17:38:13,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2021-05-02 17:38:13,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4807692307692308) internal successors, (616), 416 states have internal predecessors, (616), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 620 transitions. [2021-05-02 17:38:13,321 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 620 transitions. Word has length 79 [2021-05-02 17:38:13,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:13,322 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 620 transitions. [2021-05-02 17:38:13,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 620 transitions. [2021-05-02 17:38:13,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-02 17:38:13,322 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:13,323 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:13,323 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 17:38:13,323 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:13,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:13,323 INFO L82 PathProgramCache]: Analyzing trace with hash 548162610, now seen corresponding path program 1 times [2021-05-02 17:38:13,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:13,323 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496215349] [2021-05-02 17:38:13,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:13,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 17:38:13,377 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:13,377 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496215349] [2021-05-02 17:38:13,378 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496215349] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:13,378 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:13,378 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:13,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914956659] [2021-05-02 17:38:13,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:13,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:13,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:13,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:13,379 INFO L87 Difference]: Start difference. First operand 421 states and 620 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:13,757 INFO L93 Difference]: Finished difference Result 463 states and 671 transitions. [2021-05-02 17:38:13,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:13,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-05-02 17:38:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:13,759 INFO L225 Difference]: With dead ends: 463 [2021-05-02 17:38:13,759 INFO L226 Difference]: Without dead ends: 463 [2021-05-02 17:38:13,759 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:13,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-05-02 17:38:13,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2021-05-02 17:38:13,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4759615384615385) internal successors, (614), 416 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:13,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 618 transitions. [2021-05-02 17:38:13,764 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 618 transitions. Word has length 79 [2021-05-02 17:38:13,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:13,764 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 618 transitions. [2021-05-02 17:38:13,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:13,765 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 618 transitions. [2021-05-02 17:38:13,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-02 17:38:13,765 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:13,765 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2021-05-02 17:38:13,766 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-02 17:38:13,766 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:13,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:13,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2059119123, now seen corresponding path program 1 times [2021-05-02 17:38:13,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:13,766 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316520531] [2021-05-02 17:38:13,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:13,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:13,826 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 17:38:13,827 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:13,827 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316520531] [2021-05-02 17:38:13,827 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316520531] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:13,827 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:13,827 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:13,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449456849] [2021-05-02 17:38:13,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:13,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:13,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:13,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:13,830 INFO L87 Difference]: Start difference. First operand 421 states and 618 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:14,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:14,183 INFO L93 Difference]: Finished difference Result 457 states and 662 transitions. [2021-05-02 17:38:14,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:14,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-05-02 17:38:14,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:14,185 INFO L225 Difference]: With dead ends: 457 [2021-05-02 17:38:14,185 INFO L226 Difference]: Without dead ends: 457 [2021-05-02 17:38:14,185 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:14,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-05-02 17:38:14,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2021-05-02 17:38:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4711538461538463) internal successors, (612), 416 states have internal predecessors, (612), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2021-05-02 17:38:14,190 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 79 [2021-05-02 17:38:14,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:14,190 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2021-05-02 17:38:14,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2021-05-02 17:38:14,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-05-02 17:38:14,191 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:14,191 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:14,191 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-02 17:38:14,191 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:14,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:14,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1521790618, now seen corresponding path program 1 times [2021-05-02 17:38:14,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:14,192 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945352612] [2021-05-02 17:38:14,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:14,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 17:38:14,251 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:14,251 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945352612] [2021-05-02 17:38:14,251 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945352612] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:14,251 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:14,251 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:14,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131203660] [2021-05-02 17:38:14,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:14,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:14,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:14,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:14,252 INFO L87 Difference]: Start difference. First operand 421 states and 616 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:14,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:14,749 INFO L93 Difference]: Finished difference Result 529 states and 767 transitions. [2021-05-02 17:38:14,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:14,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2021-05-02 17:38:14,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:14,751 INFO L225 Difference]: With dead ends: 529 [2021-05-02 17:38:14,751 INFO L226 Difference]: Without dead ends: 529 [2021-05-02 17:38:14,751 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:14,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-05-02 17:38:14,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2021-05-02 17:38:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4663461538461537) internal successors, (610), 416 states have internal predecessors, (610), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:14,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 614 transitions. [2021-05-02 17:38:14,756 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 614 transitions. Word has length 80 [2021-05-02 17:38:14,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:14,757 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 614 transitions. [2021-05-02 17:38:14,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:14,757 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 614 transitions. [2021-05-02 17:38:14,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-05-02 17:38:14,758 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:14,758 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:14,758 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-02 17:38:14,758 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:14,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:14,758 INFO L82 PathProgramCache]: Analyzing trace with hash -413869669, now seen corresponding path program 1 times [2021-05-02 17:38:14,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:14,759 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031759239] [2021-05-02 17:38:14,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:14,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 17:38:14,815 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:14,815 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031759239] [2021-05-02 17:38:14,815 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031759239] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:14,815 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:14,815 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:14,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503827733] [2021-05-02 17:38:14,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:14,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:14,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:14,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:14,816 INFO L87 Difference]: Start difference. First operand 421 states and 614 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:15,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:15,177 INFO L93 Difference]: Finished difference Result 457 states and 658 transitions. [2021-05-02 17:38:15,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:15,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2021-05-02 17:38:15,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:15,179 INFO L225 Difference]: With dead ends: 457 [2021-05-02 17:38:15,179 INFO L226 Difference]: Without dead ends: 457 [2021-05-02 17:38:15,179 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:15,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-05-02 17:38:15,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2021-05-02 17:38:15,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4615384615384615) internal successors, (608), 416 states have internal predecessors, (608), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:15,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 612 transitions. [2021-05-02 17:38:15,183 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 612 transitions. Word has length 80 [2021-05-02 17:38:15,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:15,183 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 612 transitions. [2021-05-02 17:38:15,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:15,184 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 612 transitions. [2021-05-02 17:38:15,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-02 17:38:15,184 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:15,184 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:15,184 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 17:38:15,185 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:15,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:15,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1148974748, now seen corresponding path program 1 times [2021-05-02 17:38:15,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:15,185 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474309046] [2021-05-02 17:38:15,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:15,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 17:38:15,242 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:15,242 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474309046] [2021-05-02 17:38:15,242 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474309046] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:15,242 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:15,242 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:15,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056805782] [2021-05-02 17:38:15,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:15,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:15,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:15,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:15,243 INFO L87 Difference]: Start difference. First operand 421 states and 612 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:15,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:15,724 INFO L93 Difference]: Finished difference Result 529 states and 763 transitions. [2021-05-02 17:38:15,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:15,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-05-02 17:38:15,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:15,726 INFO L225 Difference]: With dead ends: 529 [2021-05-02 17:38:15,726 INFO L226 Difference]: Without dead ends: 529 [2021-05-02 17:38:15,726 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:15,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-05-02 17:38:15,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2021-05-02 17:38:15,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4567307692307692) internal successors, (606), 416 states have internal predecessors, (606), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 610 transitions. [2021-05-02 17:38:15,740 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 610 transitions. Word has length 81 [2021-05-02 17:38:15,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:15,740 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 610 transitions. [2021-05-02 17:38:15,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:15,740 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 610 transitions. [2021-05-02 17:38:15,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-02 17:38:15,741 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:15,741 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:15,741 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-02 17:38:15,741 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:15,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:15,742 INFO L82 PathProgramCache]: Analyzing trace with hash 756227318, now seen corresponding path program 1 times [2021-05-02 17:38:15,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:15,742 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216865710] [2021-05-02 17:38:15,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:15,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:15,796 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 17:38:15,797 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:15,797 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216865710] [2021-05-02 17:38:15,797 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216865710] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:15,797 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:15,797 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:15,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117344942] [2021-05-02 17:38:15,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:15,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:15,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:15,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:15,798 INFO L87 Difference]: Start difference. First operand 421 states and 610 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:16,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:16,241 INFO L93 Difference]: Finished difference Result 511 states and 739 transitions. [2021-05-02 17:38:16,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:16,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-05-02 17:38:16,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:16,242 INFO L225 Difference]: With dead ends: 511 [2021-05-02 17:38:16,242 INFO L226 Difference]: Without dead ends: 511 [2021-05-02 17:38:16,243 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:16,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-05-02 17:38:16,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2021-05-02 17:38:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4519230769230769) internal successors, (604), 416 states have internal predecessors, (604), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 608 transitions. [2021-05-02 17:38:16,247 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 608 transitions. Word has length 81 [2021-05-02 17:38:16,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:16,247 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 608 transitions. [2021-05-02 17:38:16,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:16,247 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 608 transitions. [2021-05-02 17:38:16,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-02 17:38:16,248 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:16,248 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:16,248 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-02 17:38:16,248 INFO L428 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:16,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:16,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1273047995, now seen corresponding path program 1 times [2021-05-02 17:38:16,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:16,249 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788343194] [2021-05-02 17:38:16,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:16,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-05-02 17:38:16,299 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:16,299 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788343194] [2021-05-02 17:38:16,299 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788343194] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:16,300 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:16,300 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 17:38:16,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636466794] [2021-05-02 17:38:16,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 17:38:16,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:16,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 17:38:16,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 17:38:16,300 INFO L87 Difference]: Start difference. First operand 421 states and 608 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:16,708 INFO L93 Difference]: Finished difference Result 573 states and 826 transitions. [2021-05-02 17:38:16,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 17:38:16,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-05-02 17:38:16,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:16,710 INFO L225 Difference]: With dead ends: 573 [2021-05-02 17:38:16,710 INFO L226 Difference]: Without dead ends: 573 [2021-05-02 17:38:16,710 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.8ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 17:38:16,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-05-02 17:38:16,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2021-05-02 17:38:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 568 states have (on average 1.4471830985915493) internal successors, (822), 568 states have internal predecessors, (822), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 826 transitions. [2021-05-02 17:38:16,715 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 826 transitions. Word has length 81 [2021-05-02 17:38:16,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:16,715 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 826 transitions. [2021-05-02 17:38:16,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 826 transitions. [2021-05-02 17:38:16,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-02 17:38:16,716 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:16,716 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:16,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-02 17:38:16,716 INFO L428 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:16,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:16,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1327386226, now seen corresponding path program 1 times [2021-05-02 17:38:16,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:16,717 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127733041] [2021-05-02 17:38:16,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:16,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-05-02 17:38:16,779 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:16,779 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127733041] [2021-05-02 17:38:16,779 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127733041] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:16,779 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:16,779 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 17:38:16,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102572138] [2021-05-02 17:38:16,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 17:38:16,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:16,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 17:38:16,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 17:38:16,780 INFO L87 Difference]: Start difference. First operand 573 states and 826 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:17,004 INFO L93 Difference]: Finished difference Result 726 states and 1049 transitions. [2021-05-02 17:38:17,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 17:38:17,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (3), 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 [2021-05-02 17:38:17,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:17,006 INFO L225 Difference]: With dead ends: 726 [2021-05-02 17:38:17,006 INFO L226 Difference]: Without dead ends: 726 [2021-05-02 17:38:17,006 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.9ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 17:38:17,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2021-05-02 17:38:17,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2021-05-02 17:38:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 721 states have (on average 1.449375866851595) internal successors, (1045), 721 states have internal predecessors, (1045), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1049 transitions. [2021-05-02 17:38:17,014 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1049 transitions. Word has length 83 [2021-05-02 17:38:17,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:17,014 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 1049 transitions. [2021-05-02 17:38:17,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:17,014 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1049 transitions. [2021-05-02 17:38:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-05-02 17:38:17,015 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:17,015 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:17,015 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-02 17:38:17,015 INFO L428 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:17,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:17,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1358069101, now seen corresponding path program 1 times [2021-05-02 17:38:17,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:17,016 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231380828] [2021-05-02 17:38:17,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:17,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-02 17:38:17,071 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:17,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231380828] [2021-05-02 17:38:17,071 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231380828] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:17,071 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:17,071 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 17:38:17,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720377748] [2021-05-02 17:38:17,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 17:38:17,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:17,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 17:38:17,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 17:38:17,072 INFO L87 Difference]: Start difference. First operand 726 states and 1049 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 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) [2021-05-02 17:38:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:17,444 INFO L93 Difference]: Finished difference Result 723 states and 1039 transitions. [2021-05-02 17:38:17,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 17:38:17,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 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 104 [2021-05-02 17:38:17,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:17,450 INFO L225 Difference]: With dead ends: 723 [2021-05-02 17:38:17,450 INFO L226 Difference]: Without dead ends: 723 [2021-05-02 17:38:17,450 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 17:38:17,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2021-05-02 17:38:17,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2021-05-02 17:38:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 718 states have (on average 1.4415041782729805) internal successors, (1035), 718 states have internal predecessors, (1035), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1039 transitions. [2021-05-02 17:38:17,458 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1039 transitions. Word has length 104 [2021-05-02 17:38:17,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:17,458 INFO L480 AbstractCegarLoop]: Abstraction has 723 states and 1039 transitions. [2021-05-02 17:38:17,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 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) [2021-05-02 17:38:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1039 transitions. [2021-05-02 17:38:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-05-02 17:38:17,459 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:17,459 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:17,459 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-02 17:38:17,459 INFO L428 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:17,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:17,460 INFO L82 PathProgramCache]: Analyzing trace with hash 596214831, now seen corresponding path program 1 times [2021-05-02 17:38:17,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:17,460 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578777908] [2021-05-02 17:38:17,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:17,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-02 17:38:17,529 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:17,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578777908] [2021-05-02 17:38:17,529 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578777908] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:17,529 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:17,529 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:17,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968119781] [2021-05-02 17:38:17,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:17,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:17,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:17,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:17,530 INFO L87 Difference]: Start difference. First operand 723 states and 1039 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:17,931 INFO L93 Difference]: Finished difference Result 979 states and 1408 transitions. [2021-05-02 17:38:17,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:17,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2021-05-02 17:38:17,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:17,934 INFO L225 Difference]: With dead ends: 979 [2021-05-02 17:38:17,934 INFO L226 Difference]: Without dead ends: 979 [2021-05-02 17:38:17,934 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:17,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2021-05-02 17:38:17,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 843. [2021-05-02 17:38:17,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 838 states have (on average 1.4856801909307875) internal successors, (1245), 838 states have internal predecessors, (1245), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1249 transitions. [2021-05-02 17:38:17,942 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1249 transitions. Word has length 106 [2021-05-02 17:38:17,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:17,942 INFO L480 AbstractCegarLoop]: Abstraction has 843 states and 1249 transitions. [2021-05-02 17:38:17,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:17,942 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1249 transitions. [2021-05-02 17:38:17,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-05-02 17:38:17,944 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:17,944 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:17,944 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-02 17:38:17,944 INFO L428 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:17,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:17,944 INFO L82 PathProgramCache]: Analyzing trace with hash -903827051, now seen corresponding path program 1 times [2021-05-02 17:38:17,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:17,945 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685029962] [2021-05-02 17:38:17,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:18,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:18,003 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-02 17:38:18,004 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:18,004 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685029962] [2021-05-02 17:38:18,004 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685029962] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:18,004 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:18,004 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:18,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879446895] [2021-05-02 17:38:18,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:18,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:18,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:18,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:18,005 INFO L87 Difference]: Start difference. First operand 843 states and 1249 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) [2021-05-02 17:38:18,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:18,408 INFO L93 Difference]: Finished difference Result 974 states and 1398 transitions. [2021-05-02 17:38:18,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:18,409 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 121 [2021-05-02 17:38:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:18,411 INFO L225 Difference]: With dead ends: 974 [2021-05-02 17:38:18,411 INFO L226 Difference]: Without dead ends: 974 [2021-05-02 17:38:18,411 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:18,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-05-02 17:38:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 843. [2021-05-02 17:38:18,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 838 states have (on average 1.4797136038186158) internal successors, (1240), 838 states have internal predecessors, (1240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1244 transitions. [2021-05-02 17:38:18,420 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1244 transitions. Word has length 121 [2021-05-02 17:38:18,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:18,420 INFO L480 AbstractCegarLoop]: Abstraction has 843 states and 1244 transitions. [2021-05-02 17:38:18,420 INFO L481 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) [2021-05-02 17:38:18,420 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1244 transitions. [2021-05-02 17:38:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-05-02 17:38:18,422 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:18,422 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:18,422 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-05-02 17:38:18,422 INFO L428 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:18,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:18,422 INFO L82 PathProgramCache]: Analyzing trace with hash -2062011979, now seen corresponding path program 1 times [2021-05-02 17:38:18,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:18,423 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997166733] [2021-05-02 17:38:18,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:18,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-02 17:38:18,490 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:18,490 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997166733] [2021-05-02 17:38:18,490 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997166733] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:18,490 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:18,490 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:18,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28527000] [2021-05-02 17:38:18,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:18,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:18,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:18,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:18,491 INFO L87 Difference]: Start difference. First operand 843 states and 1244 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) [2021-05-02 17:38:18,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:18,856 INFO L93 Difference]: Finished difference Result 974 states and 1393 transitions. [2021-05-02 17:38:18,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:18,856 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 121 [2021-05-02 17:38:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:18,859 INFO L225 Difference]: With dead ends: 974 [2021-05-02 17:38:18,859 INFO L226 Difference]: Without dead ends: 974 [2021-05-02 17:38:18,859 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:18,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-05-02 17:38:18,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 843. [2021-05-02 17:38:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 838 states have (on average 1.473747016706444) internal successors, (1235), 838 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1239 transitions. [2021-05-02 17:38:18,867 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1239 transitions. Word has length 121 [2021-05-02 17:38:18,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:18,867 INFO L480 AbstractCegarLoop]: Abstraction has 843 states and 1239 transitions. [2021-05-02 17:38:18,867 INFO L481 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) [2021-05-02 17:38:18,867 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1239 transitions. [2021-05-02 17:38:18,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-05-02 17:38:18,869 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:18,869 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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] [2021-05-02 17:38:18,869 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-02 17:38:18,869 INFO L428 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:18,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:18,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1745493526, now seen corresponding path program 1 times [2021-05-02 17:38:18,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:18,869 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188837009] [2021-05-02 17:38:18,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:18,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:18,940 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-05-02 17:38:18,940 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:18,940 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188837009] [2021-05-02 17:38:18,940 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188837009] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:18,940 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:18,940 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:18,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979346643] [2021-05-02 17:38:18,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:18,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:18,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:18,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:18,941 INFO L87 Difference]: Start difference. First operand 843 states and 1239 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:19,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:19,296 INFO L93 Difference]: Finished difference Result 981 states and 1438 transitions. [2021-05-02 17:38:19,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:19,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2021-05-02 17:38:19,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:19,299 INFO L225 Difference]: With dead ends: 981 [2021-05-02 17:38:19,299 INFO L226 Difference]: Without dead ends: 981 [2021-05-02 17:38:19,299 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2021-05-02 17:38:19,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 915. [2021-05-02 17:38:19,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 910 states have (on average 1.489010989010989) internal successors, (1355), 910 states have internal predecessors, (1355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1359 transitions. [2021-05-02 17:38:19,308 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1359 transitions. Word has length 121 [2021-05-02 17:38:19,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:19,308 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1359 transitions. [2021-05-02 17:38:19,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:19,308 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1359 transitions. [2021-05-02 17:38:19,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-05-02 17:38:19,309 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:19,309 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:19,309 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-02 17:38:19,310 INFO L428 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:19,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:19,310 INFO L82 PathProgramCache]: Analyzing trace with hash 586575468, now seen corresponding path program 1 times [2021-05-02 17:38:19,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:19,310 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072553324] [2021-05-02 17:38:19,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:19,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-02 17:38:19,370 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:19,370 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072553324] [2021-05-02 17:38:19,370 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072553324] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:19,370 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:19,370 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:19,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764451998] [2021-05-02 17:38:19,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:19,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:19,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:19,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:19,371 INFO L87 Difference]: Start difference. First operand 915 states and 1359 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:19,748 INFO L93 Difference]: Finished difference Result 1046 states and 1508 transitions. [2021-05-02 17:38:19,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:19,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2021-05-02 17:38:19,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:19,755 INFO L225 Difference]: With dead ends: 1046 [2021-05-02 17:38:19,755 INFO L226 Difference]: Without dead ends: 1046 [2021-05-02 17:38:19,755 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:19,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-05-02 17:38:19,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 915. [2021-05-02 17:38:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 910 states have (on average 1.4835164835164836) internal successors, (1350), 910 states have internal predecessors, (1350), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:19,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1354 transitions. [2021-05-02 17:38:19,764 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1354 transitions. Word has length 122 [2021-05-02 17:38:19,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:19,765 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1354 transitions. [2021-05-02 17:38:19,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:19,765 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1354 transitions. [2021-05-02 17:38:19,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-05-02 17:38:19,766 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:19,766 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:19,767 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-02 17:38:19,767 INFO L428 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:19,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:19,767 INFO L82 PathProgramCache]: Analyzing trace with hash 943634585, now seen corresponding path program 1 times [2021-05-02 17:38:19,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:19,767 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621491726] [2021-05-02 17:38:19,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:19,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-02 17:38:19,829 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:19,829 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621491726] [2021-05-02 17:38:19,829 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621491726] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:19,829 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:19,829 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:19,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643103850] [2021-05-02 17:38:19,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:19,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:19,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:19,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:19,830 INFO L87 Difference]: Start difference. First operand 915 states and 1354 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:20,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:20,225 INFO L93 Difference]: Finished difference Result 1046 states and 1503 transitions. [2021-05-02 17:38:20,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:20,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 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 123 [2021-05-02 17:38:20,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:20,228 INFO L225 Difference]: With dead ends: 1046 [2021-05-02 17:38:20,228 INFO L226 Difference]: Without dead ends: 1046 [2021-05-02 17:38:20,228 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:20,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-05-02 17:38:20,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 915. [2021-05-02 17:38:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 910 states have (on average 1.478021978021978) internal successors, (1345), 910 states have internal predecessors, (1345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1349 transitions. [2021-05-02 17:38:20,236 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1349 transitions. Word has length 123 [2021-05-02 17:38:20,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:20,236 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1349 transitions. [2021-05-02 17:38:20,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:20,236 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1349 transitions. [2021-05-02 17:38:20,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-05-02 17:38:20,237 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:20,237 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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] [2021-05-02 17:38:20,238 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-02 17:38:20,238 INFO L428 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:20,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:20,238 INFO L82 PathProgramCache]: Analyzing trace with hash 639627317, now seen corresponding path program 1 times [2021-05-02 17:38:20,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:20,238 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539054956] [2021-05-02 17:38:20,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:20,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:20,295 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2021-05-02 17:38:20,295 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:20,295 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539054956] [2021-05-02 17:38:20,295 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539054956] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:20,295 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:20,295 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:20,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029104034] [2021-05-02 17:38:20,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:20,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:20,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:20,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:20,296 INFO L87 Difference]: Start difference. First operand 915 states and 1349 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:20,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:20,659 INFO L93 Difference]: Finished difference Result 1146 states and 1683 transitions. [2021-05-02 17:38:20,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:20,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 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 124 [2021-05-02 17:38:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:20,662 INFO L225 Difference]: With dead ends: 1146 [2021-05-02 17:38:20,662 INFO L226 Difference]: Without dead ends: 1146 [2021-05-02 17:38:20,662 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:20,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2021-05-02 17:38:20,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1025. [2021-05-02 17:38:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1020 states have (on average 1.5049019607843137) internal successors, (1535), 1020 states have internal predecessors, (1535), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1539 transitions. [2021-05-02 17:38:20,670 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1539 transitions. Word has length 124 [2021-05-02 17:38:20,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:20,670 INFO L480 AbstractCegarLoop]: Abstraction has 1025 states and 1539 transitions. [2021-05-02 17:38:20,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:20,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1539 transitions. [2021-05-02 17:38:20,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-05-02 17:38:20,672 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:20,672 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:20,672 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-02 17:38:20,672 INFO L428 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:20,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:20,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1166469135, now seen corresponding path program 1 times [2021-05-02 17:38:20,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:20,673 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075417989] [2021-05-02 17:38:20,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:20,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-02 17:38:20,736 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:20,736 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075417989] [2021-05-02 17:38:20,736 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075417989] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:20,736 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:20,736 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:38:20,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662619962] [2021-05-02 17:38:20,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:38:20,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:20,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:38:20,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:38:20,738 INFO L87 Difference]: Start difference. First operand 1025 states and 1539 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) [2021-05-02 17:38:21,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:21,073 INFO L93 Difference]: Finished difference Result 1111 states and 1633 transitions. [2021-05-02 17:38:21,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:38:21,073 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 124 [2021-05-02 17:38:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:21,076 INFO L225 Difference]: With dead ends: 1111 [2021-05-02 17:38:21,076 INFO L226 Difference]: Without dead ends: 1111 [2021-05-02 17:38:21,076 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:38:21,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2021-05-02 17:38:21,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1025. [2021-05-02 17:38:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1020 states have (on average 1.5) internal successors, (1530), 1020 states have internal predecessors, (1530), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:21,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1534 transitions. [2021-05-02 17:38:21,092 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1534 transitions. Word has length 124 [2021-05-02 17:38:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:21,092 INFO L480 AbstractCegarLoop]: Abstraction has 1025 states and 1534 transitions. [2021-05-02 17:38:21,092 INFO L481 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) [2021-05-02 17:38:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1534 transitions. [2021-05-02 17:38:21,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-05-02 17:38:21,093 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:21,093 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:21,094 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-05-02 17:38:21,094 INFO L428 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:21,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:21,094 INFO L82 PathProgramCache]: Analyzing trace with hash 998047110, now seen corresponding path program 1 times [2021-05-02 17:38:21,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:21,094 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699371948] [2021-05-02 17:38:21,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:21,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:38:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:38:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-05-02 17:38:21,201 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:38:21,201 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699371948] [2021-05-02 17:38:21,201 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699371948] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:38:21,201 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:38:21,201 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 17:38:21,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368092656] [2021-05-02 17:38:21,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 17:38:21,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:38:21,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 17:38:21,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-02 17:38:21,202 INFO L87 Difference]: Start difference. First operand 1025 states and 1534 transitions. Second operand has 7 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 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) [2021-05-02 17:38:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:38:21,584 INFO L93 Difference]: Finished difference Result 1029 states and 1538 transitions. [2021-05-02 17:38:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 17:38:21,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 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 128 [2021-05-02 17:38:21,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:38:21,586 INFO L225 Difference]: With dead ends: 1029 [2021-05-02 17:38:21,586 INFO L226 Difference]: Without dead ends: 1029 [2021-05-02 17:38:21,587 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 84.9ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-05-02 17:38:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2021-05-02 17:38:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1028. [2021-05-02 17:38:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1023 states have (on average 1.498533724340176) internal successors, (1533), 1023 states have internal predecessors, (1533), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 17:38:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1537 transitions. [2021-05-02 17:38:21,594 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1537 transitions. Word has length 128 [2021-05-02 17:38:21,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:38:21,595 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1537 transitions. [2021-05-02 17:38:21,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 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) [2021-05-02 17:38:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1537 transitions. [2021-05-02 17:38:21,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-05-02 17:38:21,596 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:38:21,596 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:38:21,596 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-02 17:38:21,596 INFO L428 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:38:21,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:38:21,597 INFO L82 PathProgramCache]: Analyzing trace with hash 144716696, now seen corresponding path program 1 times [2021-05-02 17:38:21,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:38:21,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902281011] [2021-05-02 17:38:21,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:38:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 17:38:21,664 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 17:38:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 17:38:21,727 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 17:38:21,768 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-02 17:38:21,768 INFO L624 BasicCegarLoop]: Counterexample might be feasible [2021-05-02 17:38:21,768 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-05-02 17:38:21,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 05:38:21 BasicIcfg [2021-05-02 17:38:21,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 17:38:21,854 INFO L168 Benchmark]: Toolchain (without parser) took 19085.41 ms. Allocated memory was 205.5 MB in the beginning and 442.5 MB in the end (delta: 237.0 MB). Free memory was 169.6 MB in the beginning and 211.7 MB in the end (delta: -42.1 MB). Peak memory consumption was 195.3 MB. Max. memory is 8.0 GB. [2021-05-02 17:38:21,854 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 205.5 MB. Free memory is still 188.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 17:38:21,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.54 ms. Allocated memory is still 205.5 MB. Free memory was 169.4 MB in the beginning and 175.0 MB in the end (delta: -5.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 8.0 GB. [2021-05-02 17:38:21,858 INFO L168 Benchmark]: Boogie Preprocessor took 84.69 ms. Allocated memory is still 205.5 MB. Free memory was 175.0 MB in the beginning and 167.7 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2021-05-02 17:38:21,858 INFO L168 Benchmark]: RCFGBuilder took 865.26 ms. Allocated memory is still 205.5 MB. Free memory was 167.7 MB in the beginning and 152.5 MB in the end (delta: 15.2 MB). Peak memory consumption was 62.9 MB. Max. memory is 8.0 GB. [2021-05-02 17:38:21,858 INFO L168 Benchmark]: IcfgTransformer took 43.66 ms. Allocated memory is still 205.5 MB. Free memory was 152.5 MB in the beginning and 147.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-05-02 17:38:21,859 INFO L168 Benchmark]: TraceAbstraction took 17694.75 ms. Allocated memory was 205.5 MB in the beginning and 442.5 MB in the end (delta: 237.0 MB). Free memory was 147.2 MB in the beginning and 211.7 MB in the end (delta: -64.4 MB). Peak memory consumption was 172.0 MB. Max. memory is 8.0 GB. [2021-05-02 17:38:21,859 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.46 ms. Allocated memory is still 205.5 MB. Free memory is still 188.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 392.54 ms. Allocated memory is still 205.5 MB. Free memory was 169.4 MB in the beginning and 175.0 MB in the end (delta: -5.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 84.69 ms. Allocated memory is still 205.5 MB. Free memory was 175.0 MB in the beginning and 167.7 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 865.26 ms. Allocated memory is still 205.5 MB. Free memory was 167.7 MB in the beginning and 152.5 MB in the end (delta: 15.2 MB). Peak memory consumption was 62.9 MB. Max. memory is 8.0 GB. * IcfgTransformer took 43.66 ms. Allocated memory is still 205.5 MB. Free memory was 152.5 MB in the beginning and 147.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 17694.75 ms. Allocated memory was 205.5 MB in the beginning and 442.5 MB in the end (delta: 237.0 MB). Free memory was 147.2 MB in the beginning and 211.7 MB in the end (delta: -64.4 MB). Peak memory consumption was 172.0 MB. Max. memory is 8.0 GB. * 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: - UnprovableResult [Line: 1647]: 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 1332. Possible FailurePath: [L1041] static int init = 1; [L1042] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=4294967352, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={8:0}] [L1064] SSL *s ; [L1068] s = malloc (sizeof (SSL)) [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->state = 12292 [L1072] s->version = __VERIFIER_nondet_int() [L1073] CALL ssl3_connect(s) VAL [init=1, s={-3:0}, SSLv3_client_data={8:0}] [L1079] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1080] unsigned long tmp ; [L1081] unsigned long l ; [L1082] long num1 ; [L1083] void (*cb)() ; [L1084] int ret ; [L1085] int new_state ; [L1086] int state ; [L1087] int skip ; [L1088] int *tmp___0 ; [L1089] int tmp___1 = __VERIFIER_nondet_int(); [L1090] int tmp___2 = __VERIFIER_nondet_int(); [L1091] int tmp___3 ; [L1092] int tmp___4 ; [L1093] int tmp___5 ; [L1094] int tmp___6 ; [L1095] int tmp___7 ; [L1096] int tmp___8 ; [L1097] long tmp___9 ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->state = 12292 [L1104] s->hit = __VERIFIER_nondet_int() [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] tmp___0 = (int*)malloc(sizeof(int)) [L1111] *tmp___0 = 0 [L1112] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->info_callback={0:-4294967295}, skip=0, SSLv3_client_data={8:0}, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1112] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1113] EXPR s->info_callback [L1113] cb = s->info_callback [L1121] EXPR s->in_handshake [L1121] s->in_handshake += 1 [L1122] COND FALSE !(tmp___1 & 12288) VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=12292, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1135] COND TRUE s->state == 12292 [L1238] s->new_session = 1 [L1239] s->state = 4096 [L1240] EXPR s->ctx [L1240] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1240] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1245] s->server = 0 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1246] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1251] EXPR s->version VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->version=-2, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1251] COND FALSE !((s->version & 65280) != 768) [L1257] s->type = 4096 [L1258] EXPR s->init_buf VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->init_buf={13:-12}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1258] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1270] tmp___4 = __VERIFIER_nondet_int() [L1271] COND FALSE !(! tmp___4) [L1277] tmp___5 = __VERIFIER_nondet_int() [L1278] COND FALSE !(! tmp___5) [L1284] s->state = 4368 [L1285] EXPR s->ctx [L1285] EXPR (s->ctx)->stats.sess_connect [L1285] (s->ctx)->stats.sess_connect += 1 [L1286] s->init_num = 0 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1150] COND TRUE s->state == 4368 [L1290] s->shutdown = 0 [L1291] ret = __VERIFIER_nondet_int() [L1292] COND TRUE blastFlag == 0 [L1293] blastFlag = 1 VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1297] COND FALSE !(ret <= 0) [L1302] s->state = 4384 [L1303] s->init_num = 0 [L1304] EXPR s->bbio [L1304] EXPR s->wbio VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->bbio={17:-14}, s->wbio={-13:15}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1304] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1156] COND TRUE s->state == 4384 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 1 [L1314] blastFlag = 2 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1318] COND FALSE !(ret <= 0) [L1323] s->hit VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->hit=0, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1323] COND FALSE !(s->hit) [L1326] s->state = 4400 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1328] s->init_num = 0 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1162] COND TRUE s->state == 4400 [L1332] EXPR s->s3 [L1332] EXPR (s->s3)->tmp.new_cipher [L1332] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-4294967295}, ((s->s3)->tmp.new_cipher)->algorithms=4294967313, (s->s3)->tmp.new_cipher={4294967351:18}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1332] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1335] ret = __VERIFIER_nondet_int() [L1336] COND TRUE blastFlag == 2 [L1337] blastFlag = 3 VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1341] COND FALSE !(ret <= 0) VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1347] s->state = 4416 [L1348] s->init_num = 0 VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1162] COND FALSE !(s->state == 4400) [L1165] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1165] COND FALSE !(s->state == 4401) [L1168] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1168] COND TRUE s->state == 4416 [L1352] ret = __VERIFIER_nondet_int() [L1353] COND TRUE blastFlag == 3 [L1354] blastFlag = 4 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1358] COND FALSE !(ret <= 0) [L1363] s->state = 4432 [L1364] s->init_num = 0 [L1365] tmp___6 = __VERIFIER_nondet_int() [L1366] COND FALSE !(! tmp___6) VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1162] COND FALSE !(s->state == 4400) [L1165] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1165] COND FALSE !(s->state == 4401) [L1168] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1168] COND FALSE !(s->state == 4416) [L1171] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1171] COND FALSE !(s->state == 4417) [L1174] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1174] COND TRUE s->state == 4432 [L1375] ret = __VERIFIER_nondet_int() [L1376] COND FALSE !(blastFlag == 5) VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1381] COND FALSE !(ret <= 0) [L1386] s->state = 4448 [L1387] s->init_num = 0 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1162] COND FALSE !(s->state == 4400) [L1165] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1165] COND FALSE !(s->state == 4401) [L1168] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1168] COND FALSE !(s->state == 4416) [L1171] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1171] COND FALSE !(s->state == 4417) [L1174] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1174] COND FALSE !(s->state == 4432) [L1177] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1177] COND FALSE !(s->state == 4433) [L1180] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1180] COND TRUE s->state == 4448 [L1391] ret = __VERIFIER_nondet_int() [L1392] COND TRUE blastFlag == 4 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=0, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1647] reach_error() VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=0, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 140 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17564.7ms, OverallIterations: 34, TraceHistogramMax: 7, EmptinessCheckTime: 49.0ms, AutomataDifference: 14413.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7432 SDtfs, 2625 SDslu, 9610 SDs, 0 SdLazy, 13971 SolverSat, 271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10832.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 100 SyntacticMatches, 20 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1171.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1028occurred in iteration=33, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 258.4ms AutomataMinimizationTime, 33 MinimizatonAttempts, 2600 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 106.7ms SsaConstructionTime, 451.0ms SatisfiabilityAnalysisTime, 1937.0ms InterpolantComputationTime, 3003 NumberOfCodeBlocks, 3003 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2827 ConstructedInterpolants, 0 QuantifiedInterpolants, 8550 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 2610/2610 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 Received shutdown request...