java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loops/s3.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:25:07,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:25:07,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:25:07,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:25:07,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:25:07,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:25:07,457 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:25:07,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:25:07,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:25:07,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:25:07,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:25:07,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:25:07,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:25:07,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:25:07,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:25:07,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:25:07,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:25:07,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:25:07,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:25:07,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:25:07,486 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:25:07,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:25:07,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:25:07,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:25:07,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:25:07,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:25:07,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:25:07,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:25:07,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:25:07,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:25:07,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:25:07,502 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:25:07,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:25:07,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:25:07,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:25:07,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:25:07,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:25:07,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:25:07,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:25:07,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:25:07,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:25:07,515 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:25:07,539 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:25:07,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:25:07,540 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:25:07,541 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:25:07,541 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:25:07,541 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:25:07,542 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:25:07,542 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:25:07,544 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:25:07,544 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:25:07,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:25:07,546 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:25:07,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:25:07,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:25:07,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:25:07,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:25:07,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:25:07,548 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:25:07,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:25:07,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:25:07,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:25:07,549 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:25:07,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:25:07,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:25:07,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:25:07,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:25:07,550 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:25:07,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:25:07,550 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:25:07,550 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:25:07,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:25:07,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:25:07,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:25:07,635 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:25:07,635 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:25:07,636 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/s3.i [2019-09-20 13:25:07,703 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feba8c7b2/e5fbabba5a8c4f339f8b9a6ddb646fbc/FLAG70b557799 [2019-09-20 13:25:08,333 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:25:08,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i [2019-09-20 13:25:08,353 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feba8c7b2/e5fbabba5a8c4f339f8b9a6ddb646fbc/FLAG70b557799 [2019-09-20 13:25:08,626 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feba8c7b2/e5fbabba5a8c4f339f8b9a6ddb646fbc [2019-09-20 13:25:08,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:25:08,639 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:25:08,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:25:08,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:25:08,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:25:08,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:25:08" (1/1) ... [2019-09-20 13:25:08,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a817678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:08, skipping insertion in model container [2019-09-20 13:25:08,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:25:08" (1/1) ... [2019-09-20 13:25:08,654 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:25:08,721 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:25:09,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:25:09,398 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:25:09,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:25:09,580 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:25:09,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:09 WrapperNode [2019-09-20 13:25:09,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:25:09,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:25:09,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:25:09,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:25:09,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:09" (1/1) ... [2019-09-20 13:25:09,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:09" (1/1) ... [2019-09-20 13:25:09,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:09" (1/1) ... [2019-09-20 13:25:09,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:09" (1/1) ... [2019-09-20 13:25:09,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:09" (1/1) ... [2019-09-20 13:25:09,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:09" (1/1) ... [2019-09-20 13:25:09,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:09" (1/1) ... [2019-09-20 13:25:09,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:25:09,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:25:09,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:25:09,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:25:09,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:09" (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 [2019-09-20 13:25:09,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:25:09,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:25:09,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-20 13:25:09,835 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-20 13:25:09,836 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:25:09,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-20 13:25:09,836 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:25:09,836 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:25:09,836 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:25:09,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:25:09,837 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:25:09,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:25:09,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:25:09,837 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:25:09,837 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-20 13:25:09,838 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:25:09,838 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-20 13:25:09,838 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-20 13:25:09,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:25:09,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:25:09,839 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:25:09,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:25:09,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:25:09,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:25:09,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:25:09,839 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:25:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:25:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:25:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:25:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:25:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:25:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:25:09,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:25:09,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:25:09,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:25:09,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:25:09,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:25:10,326 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:25:11,155 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-20 13:25:11,156 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-20 13:25:11,176 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:25:11,176 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:25:11,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:25:11 BoogieIcfgContainer [2019-09-20 13:25:11,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:25:11,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:25:11,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:25:11,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:25:11,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:25:08" (1/3) ... [2019-09-20 13:25:11,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4397ed54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:25:11, skipping insertion in model container [2019-09-20 13:25:11,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:09" (2/3) ... [2019-09-20 13:25:11,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4397ed54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:25:11, skipping insertion in model container [2019-09-20 13:25:11,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:25:11" (3/3) ... [2019-09-20 13:25:11,187 INFO L109 eAbstractionObserver]: Analyzing ICFG s3.i [2019-09-20 13:25:11,197 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:25:11,208 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:25:11,225 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:25:11,257 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:25:11,257 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:25:11,258 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:25:11,258 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:25:11,258 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:25:11,258 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:25:11,258 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:25:11,258 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:25:11,290 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-09-20 13:25:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:25:11,307 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:11,308 INFO L407 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] [2019-09-20 13:25:11,311 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:11,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:11,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1412419194, now seen corresponding path program 1 times [2019-09-20 13:25:11,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:11,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:11,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:11,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:11,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:11,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:11,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:25:11,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:11,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:25:11,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:25:11,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:11,775 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-09-20 13:25:11,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:11,910 INFO L93 Difference]: Finished difference Result 258 states and 416 transitions. [2019-09-20 13:25:11,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:25:11,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:25:11,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:11,938 INFO L225 Difference]: With dead ends: 258 [2019-09-20 13:25:11,938 INFO L226 Difference]: Without dead ends: 223 [2019-09-20 13:25:11,944 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:11,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-20 13:25:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-09-20 13:25:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-20 13:25:12,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2019-09-20 13:25:12,050 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2019-09-20 13:25:12,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:12,051 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2019-09-20 13:25:12,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:25:12,051 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2019-09-20 13:25:12,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 13:25:12,054 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:12,054 INFO L407 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] [2019-09-20 13:25:12,054 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:12,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:12,055 INFO L82 PathProgramCache]: Analyzing trace with hash -512814518, now seen corresponding path program 1 times [2019-09-20 13:25:12,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:12,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:12,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:12,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:12,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:12,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:12,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:25:12,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:12,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:25:12,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:25:12,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:12,183 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand 3 states. [2019-09-20 13:25:12,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:12,263 INFO L93 Difference]: Finished difference Result 325 states and 476 transitions. [2019-09-20 13:25:12,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:25:12,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-20 13:25:12,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:12,267 INFO L225 Difference]: With dead ends: 325 [2019-09-20 13:25:12,267 INFO L226 Difference]: Without dead ends: 325 [2019-09-20 13:25:12,268 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:12,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-20 13:25:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2019-09-20 13:25:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-20 13:25:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2019-09-20 13:25:12,288 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2019-09-20 13:25:12,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:12,289 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2019-09-20 13:25:12,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:25:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2019-09-20 13:25:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:25:12,293 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:12,293 INFO L407 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] [2019-09-20 13:25:12,294 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:12,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:12,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1986020414, now seen corresponding path program 1 times [2019-09-20 13:25:12,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:12,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:12,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:12,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:12,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:12,491 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:12,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:12,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:12,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:12,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:12,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:12,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:12,494 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand 4 states. [2019-09-20 13:25:13,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:13,078 INFO L93 Difference]: Finished difference Result 513 states and 755 transitions. [2019-09-20 13:25:13,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:13,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:25:13,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:13,085 INFO L225 Difference]: With dead ends: 513 [2019-09-20 13:25:13,085 INFO L226 Difference]: Without dead ends: 513 [2019-09-20 13:25:13,085 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:13,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-20 13:25:13,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2019-09-20 13:25:13,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-20 13:25:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2019-09-20 13:25:13,110 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2019-09-20 13:25:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:13,111 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2019-09-20 13:25:13,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2019-09-20 13:25:13,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:25:13,114 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:13,115 INFO L407 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] [2019-09-20 13:25:13,115 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:13,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:13,115 INFO L82 PathProgramCache]: Analyzing trace with hash -2120033920, now seen corresponding path program 1 times [2019-09-20 13:25:13,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:13,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:13,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:13,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:13,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:13,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:13,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:13,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:13,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:13,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:13,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:13,241 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand 4 states. [2019-09-20 13:25:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:13,561 INFO L93 Difference]: Finished difference Result 459 states and 685 transitions. [2019-09-20 13:25:13,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:13,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:25:13,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:13,566 INFO L225 Difference]: With dead ends: 459 [2019-09-20 13:25:13,566 INFO L226 Difference]: Without dead ends: 459 [2019-09-20 13:25:13,566 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:13,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-20 13:25:13,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2019-09-20 13:25:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-20 13:25:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2019-09-20 13:25:13,579 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2019-09-20 13:25:13,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:13,579 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2019-09-20 13:25:13,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:13,580 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2019-09-20 13:25:13,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:25:13,583 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:13,583 INFO L407 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] [2019-09-20 13:25:13,583 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:13,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:13,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1441508551, now seen corresponding path program 1 times [2019-09-20 13:25:13,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:13,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:13,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:13,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:13,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:13,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:13,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:13,672 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:13,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:13,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:13,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:13,673 INFO L87 Difference]: Start difference. First operand 415 states and 630 transitions. Second operand 4 states. [2019-09-20 13:25:14,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:14,161 INFO L93 Difference]: Finished difference Result 547 states and 814 transitions. [2019-09-20 13:25:14,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:14,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:25:14,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:14,185 INFO L225 Difference]: With dead ends: 547 [2019-09-20 13:25:14,185 INFO L226 Difference]: Without dead ends: 547 [2019-09-20 13:25:14,186 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:14,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-20 13:25:14,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 417. [2019-09-20 13:25:14,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:25:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 632 transitions. [2019-09-20 13:25:14,197 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 632 transitions. Word has length 64 [2019-09-20 13:25:14,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:14,198 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 632 transitions. [2019-09-20 13:25:14,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:14,198 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 632 transitions. [2019-09-20 13:25:14,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:25:14,200 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:14,200 INFO L407 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] [2019-09-20 13:25:14,200 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:14,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:14,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1741349123, now seen corresponding path program 1 times [2019-09-20 13:25:14,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:14,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:14,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:14,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:14,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:14,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:14,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:14,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:14,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:14,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:14,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:14,295 INFO L87 Difference]: Start difference. First operand 417 states and 632 transitions. Second operand 4 states. [2019-09-20 13:25:14,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:14,777 INFO L93 Difference]: Finished difference Result 547 states and 812 transitions. [2019-09-20 13:25:14,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:14,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:25:14,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:14,786 INFO L225 Difference]: With dead ends: 547 [2019-09-20 13:25:14,786 INFO L226 Difference]: Without dead ends: 547 [2019-09-20 13:25:14,787 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:14,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-20 13:25:14,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 419. [2019-09-20 13:25:14,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-20 13:25:14,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2019-09-20 13:25:14,805 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 65 [2019-09-20 13:25:14,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:14,806 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2019-09-20 13:25:14,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:14,807 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2019-09-20 13:25:14,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:25:14,809 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:14,809 INFO L407 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] [2019-09-20 13:25:14,809 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:14,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:14,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1848274964, now seen corresponding path program 1 times [2019-09-20 13:25:14,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:14,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:14,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:14,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:14,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:14,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:14,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:14,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:14,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:14,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:14,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:14,912 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand 4 states. [2019-09-20 13:25:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:15,364 INFO L93 Difference]: Finished difference Result 537 states and 798 transitions. [2019-09-20 13:25:15,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:15,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:25:15,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:15,369 INFO L225 Difference]: With dead ends: 537 [2019-09-20 13:25:15,370 INFO L226 Difference]: Without dead ends: 537 [2019-09-20 13:25:15,370 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:15,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-20 13:25:15,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 421. [2019-09-20 13:25:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:25:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 636 transitions. [2019-09-20 13:25:15,408 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 636 transitions. Word has length 66 [2019-09-20 13:25:15,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:15,408 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 636 transitions. [2019-09-20 13:25:15,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:15,409 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 636 transitions. [2019-09-20 13:25:15,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:25:15,411 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:15,411 INFO L407 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] [2019-09-20 13:25:15,412 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:15,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:15,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2132058447, now seen corresponding path program 1 times [2019-09-20 13:25:15,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:15,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:15,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:15,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:15,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:15,510 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:15,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:15,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:15,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:15,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:15,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:15,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:15,513 INFO L87 Difference]: Start difference. First operand 421 states and 636 transitions. Second operand 4 states. [2019-09-20 13:25:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:15,970 INFO L93 Difference]: Finished difference Result 535 states and 794 transitions. [2019-09-20 13:25:15,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:15,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:25:15,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:15,976 INFO L225 Difference]: With dead ends: 535 [2019-09-20 13:25:15,976 INFO L226 Difference]: Without dead ends: 535 [2019-09-20 13:25:15,976 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-20 13:25:15,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-20 13:25:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:25:15,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 634 transitions. [2019-09-20 13:25:15,989 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 634 transitions. Word has length 78 [2019-09-20 13:25:15,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:15,990 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 634 transitions. [2019-09-20 13:25:15,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 634 transitions. [2019-09-20 13:25:15,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:25:15,992 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:15,992 INFO L407 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] [2019-09-20 13:25:15,993 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:15,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:15,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2113402989, now seen corresponding path program 1 times [2019-09-20 13:25:15,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:15,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:15,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:15,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:15,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:16,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:16,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:16,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:16,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:16,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:16,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:16,074 INFO L87 Difference]: Start difference. First operand 421 states and 634 transitions. Second operand 4 states. [2019-09-20 13:25:16,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:16,534 INFO L93 Difference]: Finished difference Result 535 states and 792 transitions. [2019-09-20 13:25:16,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:16,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:25:16,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:16,537 INFO L225 Difference]: With dead ends: 535 [2019-09-20 13:25:16,537 INFO L226 Difference]: Without dead ends: 535 [2019-09-20 13:25:16,538 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:16,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-20 13:25:16,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-20 13:25:16,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:25:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 632 transitions. [2019-09-20 13:25:16,552 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 632 transitions. Word has length 78 [2019-09-20 13:25:16,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:16,553 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 632 transitions. [2019-09-20 13:25:16,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:16,553 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 632 transitions. [2019-09-20 13:25:16,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:25:16,555 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:16,555 INFO L407 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] [2019-09-20 13:25:16,556 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:16,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:16,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1407902352, now seen corresponding path program 1 times [2019-09-20 13:25:16,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:16,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:16,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:16,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:16,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:16,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:16,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:16,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:16,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:16,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:16,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:16,635 INFO L87 Difference]: Start difference. First operand 421 states and 632 transitions. Second operand 4 states. [2019-09-20 13:25:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:17,113 INFO L93 Difference]: Finished difference Result 535 states and 790 transitions. [2019-09-20 13:25:17,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:17,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:25:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:17,117 INFO L225 Difference]: With dead ends: 535 [2019-09-20 13:25:17,117 INFO L226 Difference]: Without dead ends: 535 [2019-09-20 13:25:17,118 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:17,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-20 13:25:17,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-20 13:25:17,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:25:17,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 630 transitions. [2019-09-20 13:25:17,129 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 630 transitions. Word has length 78 [2019-09-20 13:25:17,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:17,129 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 630 transitions. [2019-09-20 13:25:17,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:17,130 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 630 transitions. [2019-09-20 13:25:17,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:25:17,131 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:17,131 INFO L407 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] [2019-09-20 13:25:17,132 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:17,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:17,132 INFO L82 PathProgramCache]: Analyzing trace with hash 286691281, now seen corresponding path program 1 times [2019-09-20 13:25:17,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:17,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:17,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:17,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:17,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:17,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:17,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:17,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:17,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:17,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:17,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:17,206 INFO L87 Difference]: Start difference. First operand 421 states and 630 transitions. Second operand 4 states. [2019-09-20 13:25:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:17,535 INFO L93 Difference]: Finished difference Result 463 states and 681 transitions. [2019-09-20 13:25:17,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:17,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:25:17,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:17,539 INFO L225 Difference]: With dead ends: 463 [2019-09-20 13:25:17,539 INFO L226 Difference]: Without dead ends: 463 [2019-09-20 13:25:17,540 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-20 13:25:17,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-20 13:25:17,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:25:17,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 628 transitions. [2019-09-20 13:25:17,552 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 628 transitions. Word has length 78 [2019-09-20 13:25:17,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:17,552 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 628 transitions. [2019-09-20 13:25:17,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:17,552 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 628 transitions. [2019-09-20 13:25:17,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:25:17,554 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:17,554 INFO L407 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] [2019-09-20 13:25:17,554 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:17,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:17,555 INFO L82 PathProgramCache]: Analyzing trace with hash 268035823, now seen corresponding path program 1 times [2019-09-20 13:25:17,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:17,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:17,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:17,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:17,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:17,623 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:17,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:17,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:17,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:17,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:17,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:17,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:17,626 INFO L87 Difference]: Start difference. First operand 421 states and 628 transitions. Second operand 4 states. [2019-09-20 13:25:17,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:17,926 INFO L93 Difference]: Finished difference Result 463 states and 679 transitions. [2019-09-20 13:25:17,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:17,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:25:17,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:17,931 INFO L225 Difference]: With dead ends: 463 [2019-09-20 13:25:17,931 INFO L226 Difference]: Without dead ends: 463 [2019-09-20 13:25:17,931 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:17,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-20 13:25:17,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-20 13:25:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:25:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 626 transitions. [2019-09-20 13:25:17,943 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 626 transitions. Word has length 78 [2019-09-20 13:25:17,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:17,943 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 626 transitions. [2019-09-20 13:25:17,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:17,943 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 626 transitions. [2019-09-20 13:25:17,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:25:17,945 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:17,945 INFO L407 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] [2019-09-20 13:25:17,946 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:17,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:17,946 INFO L82 PathProgramCache]: Analyzing trace with hash -437464814, now seen corresponding path program 1 times [2019-09-20 13:25:17,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:17,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:17,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:17,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:17,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:18,037 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:18,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:18,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:18,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:18,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:18,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:18,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:18,041 INFO L87 Difference]: Start difference. First operand 421 states and 626 transitions. Second operand 4 states. [2019-09-20 13:25:18,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:18,325 INFO L93 Difference]: Finished difference Result 463 states and 677 transitions. [2019-09-20 13:25:18,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:18,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:25:18,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:18,328 INFO L225 Difference]: With dead ends: 463 [2019-09-20 13:25:18,328 INFO L226 Difference]: Without dead ends: 463 [2019-09-20 13:25:18,329 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:18,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-20 13:25:18,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-20 13:25:18,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:25:18,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 624 transitions. [2019-09-20 13:25:18,339 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 624 transitions. Word has length 78 [2019-09-20 13:25:18,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:18,339 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 624 transitions. [2019-09-20 13:25:18,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 624 transitions. [2019-09-20 13:25:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:25:18,341 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:18,341 INFO L407 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] [2019-09-20 13:25:18,341 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:18,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:18,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1076828074, now seen corresponding path program 1 times [2019-09-20 13:25:18,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:18,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:18,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:18,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:18,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:18,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:18,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:18,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:18,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:18,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:18,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:18,434 INFO L87 Difference]: Start difference. First operand 421 states and 624 transitions. Second operand 4 states. [2019-09-20 13:25:18,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:18,831 INFO L93 Difference]: Finished difference Result 535 states and 782 transitions. [2019-09-20 13:25:18,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:18,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:25:18,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:18,834 INFO L225 Difference]: With dead ends: 535 [2019-09-20 13:25:18,835 INFO L226 Difference]: Without dead ends: 535 [2019-09-20 13:25:18,836 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:18,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-20 13:25:18,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-20 13:25:18,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:25:18,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2019-09-20 13:25:18,848 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 79 [2019-09-20 13:25:18,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:18,849 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2019-09-20 13:25:18,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2019-09-20 13:25:18,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:25:18,850 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:18,850 INFO L407 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] [2019-09-20 13:25:18,851 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:18,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:18,851 INFO L82 PathProgramCache]: Analyzing trace with hash 979180473, now seen corresponding path program 1 times [2019-09-20 13:25:18,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:18,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:18,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:18,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:18,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:18,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:18,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:18,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:18,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:18,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:18,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:18,932 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand 4 states. [2019-09-20 13:25:19,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:19,376 INFO L93 Difference]: Finished difference Result 529 states and 773 transitions. [2019-09-20 13:25:19,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:19,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:25:19,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:19,379 INFO L225 Difference]: With dead ends: 529 [2019-09-20 13:25:19,380 INFO L226 Difference]: Without dead ends: 529 [2019-09-20 13:25:19,380 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:19,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-20 13:25:19,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2019-09-20 13:25:19,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:25:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 620 transitions. [2019-09-20 13:25:19,391 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 620 transitions. Word has length 79 [2019-09-20 13:25:19,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:19,392 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 620 transitions. [2019-09-20 13:25:19,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 620 transitions. [2019-09-20 13:25:19,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:25:19,394 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:19,394 INFO L407 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] [2019-09-20 13:25:19,394 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:19,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:19,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1846331924, now seen corresponding path program 1 times [2019-09-20 13:25:19,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:19,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:19,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:19,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:19,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:19,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:19,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:19,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:19,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:19,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:19,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:19,461 INFO L87 Difference]: Start difference. First operand 421 states and 620 transitions. Second operand 4 states. [2019-09-20 13:25:19,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:19,782 INFO L93 Difference]: Finished difference Result 463 states and 671 transitions. [2019-09-20 13:25:19,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:19,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:25:19,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:19,786 INFO L225 Difference]: With dead ends: 463 [2019-09-20 13:25:19,787 INFO L226 Difference]: Without dead ends: 463 [2019-09-20 13:25:19,787 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:19,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-20 13:25:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-20 13:25:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:25:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 618 transitions. [2019-09-20 13:25:19,802 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 618 transitions. Word has length 79 [2019-09-20 13:25:19,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:19,803 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 618 transitions. [2019-09-20 13:25:19,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:19,804 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 618 transitions. [2019-09-20 13:25:19,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:25:19,806 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:19,806 INFO L407 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] [2019-09-20 13:25:19,807 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:19,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:19,807 INFO L82 PathProgramCache]: Analyzing trace with hash -392626825, now seen corresponding path program 1 times [2019-09-20 13:25:19,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:19,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:19,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:19,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:19,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:19,889 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:19,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:19,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:19,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:19,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:19,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:19,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:19,891 INFO L87 Difference]: Start difference. First operand 421 states and 618 transitions. Second operand 4 states. [2019-09-20 13:25:20,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:20,181 INFO L93 Difference]: Finished difference Result 457 states and 662 transitions. [2019-09-20 13:25:20,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:20,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:25:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:20,185 INFO L225 Difference]: With dead ends: 457 [2019-09-20 13:25:20,185 INFO L226 Difference]: Without dead ends: 457 [2019-09-20 13:25:20,186 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:20,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-20 13:25:20,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2019-09-20 13:25:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:25:20,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2019-09-20 13:25:20,203 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 79 [2019-09-20 13:25:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:20,203 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2019-09-20 13:25:20,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:20,204 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2019-09-20 13:25:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:25:20,207 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:20,207 INFO L407 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] [2019-09-20 13:25:20,207 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:20,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:20,208 INFO L82 PathProgramCache]: Analyzing trace with hash 564256466, now seen corresponding path program 1 times [2019-09-20 13:25:20,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:20,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:20,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:20,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:20,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:20,317 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:20,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:20,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:20,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:20,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:20,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:20,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:20,320 INFO L87 Difference]: Start difference. First operand 421 states and 616 transitions. Second operand 4 states. [2019-09-20 13:25:20,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:20,726 INFO L93 Difference]: Finished difference Result 529 states and 767 transitions. [2019-09-20 13:25:20,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:20,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:25:20,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:20,731 INFO L225 Difference]: With dead ends: 529 [2019-09-20 13:25:20,731 INFO L226 Difference]: Without dead ends: 529 [2019-09-20 13:25:20,731 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-20 13:25:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2019-09-20 13:25:20,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:25:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 614 transitions. [2019-09-20 13:25:20,745 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 614 transitions. Word has length 80 [2019-09-20 13:25:20,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:20,746 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 614 transitions. [2019-09-20 13:25:20,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:20,746 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 614 transitions. [2019-09-20 13:25:20,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:25:20,749 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:20,749 INFO L407 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] [2019-09-20 13:25:20,749 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:20,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:20,750 INFO L82 PathProgramCache]: Analyzing trace with hash 987903188, now seen corresponding path program 1 times [2019-09-20 13:25:20,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:20,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:20,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:20,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:20,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:20,831 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:20,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:20,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:20,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:20,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:20,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:20,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:20,835 INFO L87 Difference]: Start difference. First operand 421 states and 614 transitions. Second operand 4 states. [2019-09-20 13:25:21,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:21,121 INFO L93 Difference]: Finished difference Result 457 states and 658 transitions. [2019-09-20 13:25:21,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:21,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:25:21,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:21,125 INFO L225 Difference]: With dead ends: 457 [2019-09-20 13:25:21,125 INFO L226 Difference]: Without dead ends: 457 [2019-09-20 13:25:21,126 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:21,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-20 13:25:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2019-09-20 13:25:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:25:21,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 612 transitions. [2019-09-20 13:25:21,144 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 612 transitions. Word has length 80 [2019-09-20 13:25:21,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:21,145 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 612 transitions. [2019-09-20 13:25:21,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 612 transitions. [2019-09-20 13:25:21,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:25:21,146 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:21,147 INFO L407 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] [2019-09-20 13:25:21,147 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:21,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:21,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1652269339, now seen corresponding path program 1 times [2019-09-20 13:25:21,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:21,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:21,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:21,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:21,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:21,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:21,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:21,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:21,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:21,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:21,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:21,210 INFO L87 Difference]: Start difference. First operand 421 states and 612 transitions. Second operand 4 states. [2019-09-20 13:25:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:21,581 INFO L93 Difference]: Finished difference Result 511 states and 741 transitions. [2019-09-20 13:25:21,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:21,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:25:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:21,585 INFO L225 Difference]: With dead ends: 511 [2019-09-20 13:25:21,585 INFO L226 Difference]: Without dead ends: 511 [2019-09-20 13:25:21,585 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-20 13:25:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2019-09-20 13:25:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:25:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 610 transitions. [2019-09-20 13:25:21,596 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 610 transitions. Word has length 81 [2019-09-20 13:25:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:21,596 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 610 transitions. [2019-09-20 13:25:21,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 610 transitions. [2019-09-20 13:25:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:25:21,598 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:21,598 INFO L407 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] [2019-09-20 13:25:21,598 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:21,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:21,599 INFO L82 PathProgramCache]: Analyzing trace with hash -39157652, now seen corresponding path program 1 times [2019-09-20 13:25:21,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:21,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:21,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:21,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:21,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:21,660 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:21,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:21,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:21,660 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:21,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:21,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:21,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:21,662 INFO L87 Difference]: Start difference. First operand 421 states and 610 transitions. Second operand 4 states. [2019-09-20 13:25:22,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:22,058 INFO L93 Difference]: Finished difference Result 511 states and 739 transitions. [2019-09-20 13:25:22,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:22,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:25:22,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:22,063 INFO L225 Difference]: With dead ends: 511 [2019-09-20 13:25:22,063 INFO L226 Difference]: Without dead ends: 511 [2019-09-20 13:25:22,063 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:22,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-20 13:25:22,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2019-09-20 13:25:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:25:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 608 transitions. [2019-09-20 13:25:22,073 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 608 transitions. Word has length 81 [2019-09-20 13:25:22,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:22,074 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 608 transitions. [2019-09-20 13:25:22,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 608 transitions. [2019-09-20 13:25:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:25:22,075 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:22,076 INFO L407 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] [2019-09-20 13:25:22,076 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:22,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:22,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1900415833, now seen corresponding path program 1 times [2019-09-20 13:25:22,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:22,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:22,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:22,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:22,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:25:22,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:22,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:22,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:22,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:22,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:22,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:22,144 INFO L87 Difference]: Start difference. First operand 421 states and 608 transitions. Second operand 4 states. [2019-09-20 13:25:22,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:22,410 INFO L93 Difference]: Finished difference Result 439 states and 630 transitions. [2019-09-20 13:25:22,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:22,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:25:22,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:22,413 INFO L225 Difference]: With dead ends: 439 [2019-09-20 13:25:22,414 INFO L226 Difference]: Without dead ends: 439 [2019-09-20 13:25:22,414 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-09-20 13:25:22,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2019-09-20 13:25:22,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:25:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2019-09-20 13:25:22,423 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 81 [2019-09-20 13:25:22,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:22,423 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2019-09-20 13:25:22,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2019-09-20 13:25:22,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:25:22,425 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:22,425 INFO L407 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] [2019-09-20 13:25:22,425 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:22,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:22,426 INFO L82 PathProgramCache]: Analyzing trace with hash 208988842, now seen corresponding path program 1 times [2019-09-20 13:25:22,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:22,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:22,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:22,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:22,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-20 13:25:22,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:22,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:25:22,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:22,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:25:22,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:25:22,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:22,490 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand 3 states. [2019-09-20 13:25:22,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:22,521 INFO L93 Difference]: Finished difference Result 574 states and 827 transitions. [2019-09-20 13:25:22,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:25:22,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-20 13:25:22,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:22,525 INFO L225 Difference]: With dead ends: 574 [2019-09-20 13:25:22,525 INFO L226 Difference]: Without dead ends: 574 [2019-09-20 13:25:22,525 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-20 13:25:22,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-09-20 13:25:22,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-20 13:25:22,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 827 transitions. [2019-09-20 13:25:22,537 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 827 transitions. Word has length 81 [2019-09-20 13:25:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:22,537 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 827 transitions. [2019-09-20 13:25:22,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:25:22,537 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 827 transitions. [2019-09-20 13:25:22,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:25:22,539 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:22,539 INFO L407 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] [2019-09-20 13:25:22,539 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:22,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:22,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1641385280, now seen corresponding path program 1 times [2019-09-20 13:25:22,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:22,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:22,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:22,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:22,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-20 13:25:22,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:22,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:25:22,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:22,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:25:22,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:25:22,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:22,610 INFO L87 Difference]: Start difference. First operand 574 states and 827 transitions. Second operand 3 states. [2019-09-20 13:25:22,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:22,647 INFO L93 Difference]: Finished difference Result 727 states and 1049 transitions. [2019-09-20 13:25:22,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:25:22,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-20 13:25:22,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:22,653 INFO L225 Difference]: With dead ends: 727 [2019-09-20 13:25:22,653 INFO L226 Difference]: Without dead ends: 727 [2019-09-20 13:25:22,659 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:22,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-20 13:25:22,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-09-20 13:25:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-09-20 13:25:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1049 transitions. [2019-09-20 13:25:22,681 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1049 transitions. Word has length 83 [2019-09-20 13:25:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:22,681 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1049 transitions. [2019-09-20 13:25:22,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:25:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1049 transitions. [2019-09-20 13:25:22,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:25:22,685 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:22,686 INFO L407 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] [2019-09-20 13:25:22,686 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:22,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:22,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1283662913, now seen corresponding path program 1 times [2019-09-20 13:25:22,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:22,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:22,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:22,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:22,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-20 13:25:22,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:22,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:25:22,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:22,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:25:22,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:25:22,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:22,796 INFO L87 Difference]: Start difference. First operand 727 states and 1049 transitions. Second operand 3 states. [2019-09-20 13:25:22,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:22,841 INFO L93 Difference]: Finished difference Result 724 states and 1039 transitions. [2019-09-20 13:25:22,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:25:22,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-20 13:25:22,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:22,847 INFO L225 Difference]: With dead ends: 724 [2019-09-20 13:25:22,847 INFO L226 Difference]: Without dead ends: 724 [2019-09-20 13:25:22,848 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:22,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-09-20 13:25:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2019-09-20 13:25:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-09-20 13:25:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1039 transitions. [2019-09-20 13:25:22,863 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1039 transitions. Word has length 104 [2019-09-20 13:25:22,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:22,864 INFO L475 AbstractCegarLoop]: Abstraction has 724 states and 1039 transitions. [2019-09-20 13:25:22,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:25:22,864 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1039 transitions. [2019-09-20 13:25:22,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:25:22,867 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:22,868 INFO L407 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] [2019-09-20 13:25:22,868 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:22,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:22,868 INFO L82 PathProgramCache]: Analyzing trace with hash 803234748, now seen corresponding path program 1 times [2019-09-20 13:25:22,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:22,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:22,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:22,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:22,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:22,995 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-20 13:25:22,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:22,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:22,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:22,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:22,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:22,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:22,998 INFO L87 Difference]: Start difference. First operand 724 states and 1039 transitions. Second operand 4 states. [2019-09-20 13:25:23,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:23,404 INFO L93 Difference]: Finished difference Result 981 states and 1412 transitions. [2019-09-20 13:25:23,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:23,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:25:23,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:23,411 INFO L225 Difference]: With dead ends: 981 [2019-09-20 13:25:23,411 INFO L226 Difference]: Without dead ends: 981 [2019-09-20 13:25:23,411 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:23,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-09-20 13:25:23,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 844. [2019-09-20 13:25:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-20 13:25:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1249 transitions. [2019-09-20 13:25:23,430 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1249 transitions. Word has length 106 [2019-09-20 13:25:23,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:23,431 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1249 transitions. [2019-09-20 13:25:23,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1249 transitions. [2019-09-20 13:25:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-20 13:25:23,434 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:23,434 INFO L407 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] [2019-09-20 13:25:23,435 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:23,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:23,435 INFO L82 PathProgramCache]: Analyzing trace with hash -876635477, now seen corresponding path program 1 times [2019-09-20 13:25:23,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:23,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:23,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:23,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:23,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-20 13:25:23,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:23,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:23,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:23,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:23,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:23,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:23,573 INFO L87 Difference]: Start difference. First operand 844 states and 1249 transitions. Second operand 4 states. [2019-09-20 13:25:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:23,879 INFO L93 Difference]: Finished difference Result 976 states and 1402 transitions. [2019-09-20 13:25:23,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:23,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-20 13:25:23,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:23,886 INFO L225 Difference]: With dead ends: 976 [2019-09-20 13:25:23,886 INFO L226 Difference]: Without dead ends: 976 [2019-09-20 13:25:23,887 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:23,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-09-20 13:25:23,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2019-09-20 13:25:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-20 13:25:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1244 transitions. [2019-09-20 13:25:23,907 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1244 transitions. Word has length 121 [2019-09-20 13:25:23,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:23,908 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1244 transitions. [2019-09-20 13:25:23,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1244 transitions. [2019-09-20 13:25:23,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-20 13:25:23,911 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:23,911 INFO L407 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] [2019-09-20 13:25:23,911 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:23,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:23,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1624661431, now seen corresponding path program 1 times [2019-09-20 13:25:23,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:23,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:23,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:23,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:23,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:23,989 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-20 13:25:23,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:23,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:23,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:23,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:23,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:23,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:23,990 INFO L87 Difference]: Start difference. First operand 844 states and 1244 transitions. Second operand 4 states. [2019-09-20 13:25:24,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:24,262 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2019-09-20 13:25:24,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:24,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-20 13:25:24,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:24,267 INFO L225 Difference]: With dead ends: 976 [2019-09-20 13:25:24,268 INFO L226 Difference]: Without dead ends: 976 [2019-09-20 13:25:24,268 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:24,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-09-20 13:25:24,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2019-09-20 13:25:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-20 13:25:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1239 transitions. [2019-09-20 13:25:24,285 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1239 transitions. Word has length 121 [2019-09-20 13:25:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:24,285 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1239 transitions. [2019-09-20 13:25:24,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:24,286 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1239 transitions. [2019-09-20 13:25:24,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-20 13:25:24,288 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:24,288 INFO L407 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] [2019-09-20 13:25:24,289 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:24,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:24,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1005940820, now seen corresponding path program 1 times [2019-09-20 13:25:24,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:24,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:24,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:24,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:24,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-20 13:25:24,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:24,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:24,366 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:24,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:24,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:24,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:24,367 INFO L87 Difference]: Start difference. First operand 844 states and 1239 transitions. Second operand 4 states. [2019-09-20 13:25:24,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:24,633 INFO L93 Difference]: Finished difference Result 982 states and 1440 transitions. [2019-09-20 13:25:24,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:24,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-20 13:25:24,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:24,638 INFO L225 Difference]: With dead ends: 982 [2019-09-20 13:25:24,638 INFO L226 Difference]: Without dead ends: 982 [2019-09-20 13:25:24,638 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:24,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-09-20 13:25:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 916. [2019-09-20 13:25:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-20 13:25:24,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1359 transitions. [2019-09-20 13:25:24,655 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1359 transitions. Word has length 121 [2019-09-20 13:25:24,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:24,655 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1359 transitions. [2019-09-20 13:25:24,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:24,656 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1359 transitions. [2019-09-20 13:25:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-20 13:25:24,658 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:24,659 INFO L407 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] [2019-09-20 13:25:24,659 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:24,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:24,659 INFO L82 PathProgramCache]: Analyzing trace with hash 908942672, now seen corresponding path program 1 times [2019-09-20 13:25:24,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:24,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:24,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:24,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:24,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-20 13:25:24,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:24,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:24,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:24,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:24,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:24,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:24,736 INFO L87 Difference]: Start difference. First operand 916 states and 1359 transitions. Second operand 4 states. [2019-09-20 13:25:25,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:25,090 INFO L93 Difference]: Finished difference Result 1048 states and 1512 transitions. [2019-09-20 13:25:25,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:25,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-20 13:25:25,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:25,097 INFO L225 Difference]: With dead ends: 1048 [2019-09-20 13:25:25,098 INFO L226 Difference]: Without dead ends: 1048 [2019-09-20 13:25:25,099 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:25,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-09-20 13:25:25,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2019-09-20 13:25:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-20 13:25:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1354 transitions. [2019-09-20 13:25:25,147 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1354 transitions. Word has length 122 [2019-09-20 13:25:25,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:25,148 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1354 transitions. [2019-09-20 13:25:25,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1354 transitions. [2019-09-20 13:25:25,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-20 13:25:25,151 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:25,151 INFO L407 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] [2019-09-20 13:25:25,152 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:25,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:25,152 INFO L82 PathProgramCache]: Analyzing trace with hash -187191506, now seen corresponding path program 1 times [2019-09-20 13:25:25,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:25,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:25,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:25,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:25,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-20 13:25:25,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:25,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:25,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:25,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:25,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:25,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:25,228 INFO L87 Difference]: Start difference. First operand 916 states and 1354 transitions. Second operand 4 states. [2019-09-20 13:25:25,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:25,504 INFO L93 Difference]: Finished difference Result 1048 states and 1507 transitions. [2019-09-20 13:25:25,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:25,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-20 13:25:25,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:25,509 INFO L225 Difference]: With dead ends: 1048 [2019-09-20 13:25:25,510 INFO L226 Difference]: Without dead ends: 1048 [2019-09-20 13:25:25,510 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:25,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-09-20 13:25:25,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2019-09-20 13:25:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-20 13:25:25,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1349 transitions. [2019-09-20 13:25:25,526 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1349 transitions. Word has length 123 [2019-09-20 13:25:25,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:25,526 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1349 transitions. [2019-09-20 13:25:25,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:25,526 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1349 transitions. [2019-09-20 13:25:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-20 13:25:25,529 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:25,529 INFO L407 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] [2019-09-20 13:25:25,530 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:25,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:25,530 INFO L82 PathProgramCache]: Analyzing trace with hash -2136062699, now seen corresponding path program 1 times [2019-09-20 13:25:25,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:25,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:25,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:25,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:25,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-20 13:25:25,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:25,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:25,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:25,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:25,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:25,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:25,617 INFO L87 Difference]: Start difference. First operand 916 states and 1349 transitions. Second operand 4 states. [2019-09-20 13:25:25,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:25,881 INFO L93 Difference]: Finished difference Result 1003 states and 1447 transitions. [2019-09-20 13:25:25,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:25,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-20 13:25:25,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:25,887 INFO L225 Difference]: With dead ends: 1003 [2019-09-20 13:25:25,887 INFO L226 Difference]: Without dead ends: 1003 [2019-09-20 13:25:25,887 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:25,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-09-20 13:25:25,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 916. [2019-09-20 13:25:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-20 13:25:25,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1344 transitions. [2019-09-20 13:25:25,903 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1344 transitions. Word has length 124 [2019-09-20 13:25:25,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:25,903 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1344 transitions. [2019-09-20 13:25:25,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:25,903 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1344 transitions. [2019-09-20 13:25:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-20 13:25:25,906 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:25,906 INFO L407 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] [2019-09-20 13:25:25,907 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:25,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:25,907 INFO L82 PathProgramCache]: Analyzing trace with hash 195204134, now seen corresponding path program 1 times [2019-09-20 13:25:25,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:25,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:25,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:25,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:25,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-20 13:25:25,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:25,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:25,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:25,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:25,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:25,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:25,983 INFO L87 Difference]: Start difference. First operand 916 states and 1344 transitions. Second operand 4 states. [2019-09-20 13:25:26,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:26,277 INFO L93 Difference]: Finished difference Result 1148 states and 1682 transitions. [2019-09-20 13:25:26,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:26,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-20 13:25:26,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:26,284 INFO L225 Difference]: With dead ends: 1148 [2019-09-20 13:25:26,284 INFO L226 Difference]: Without dead ends: 1148 [2019-09-20 13:25:26,284 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:26,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-09-20 13:25:26,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1026. [2019-09-20 13:25:26,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2019-09-20 13:25:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1534 transitions. [2019-09-20 13:25:26,299 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1534 transitions. Word has length 124 [2019-09-20 13:25:26,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:26,300 INFO L475 AbstractCegarLoop]: Abstraction has 1026 states and 1534 transitions. [2019-09-20 13:25:26,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:26,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1534 transitions. [2019-09-20 13:25:26,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-20 13:25:26,303 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:26,303 INFO L407 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] [2019-09-20 13:25:26,303 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:26,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:26,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1476839352, now seen corresponding path program 1 times [2019-09-20 13:25:26,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:26,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:26,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:26,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:26,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-09-20 13:25:26,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:26,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:25:26,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:26,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:25:26,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:25:26,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:25:26,454 INFO L87 Difference]: Start difference. First operand 1026 states and 1534 transitions. Second operand 6 states. [2019-09-20 13:25:26,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:26,721 INFO L93 Difference]: Finished difference Result 1030 states and 1538 transitions. [2019-09-20 13:25:26,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:25:26,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-09-20 13:25:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:26,727 INFO L225 Difference]: With dead ends: 1030 [2019-09-20 13:25:26,727 INFO L226 Difference]: Without dead ends: 1030 [2019-09-20 13:25:26,727 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:25:26,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-09-20 13:25:26,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1029. [2019-09-20 13:25:26,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-09-20 13:25:26,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1537 transitions. [2019-09-20 13:25:26,748 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1537 transitions. Word has length 128 [2019-09-20 13:25:26,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:26,748 INFO L475 AbstractCegarLoop]: Abstraction has 1029 states and 1537 transitions. [2019-09-20 13:25:26,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:25:26,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1537 transitions. [2019-09-20 13:25:26,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-20 13:25:26,752 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:26,753 INFO L407 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] [2019-09-20 13:25:26,753 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:26,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:26,753 INFO L82 PathProgramCache]: Analyzing trace with hash -602359811, now seen corresponding path program 1 times [2019-09-20 13:25:26,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:26,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:26,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:26,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:26,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 13:25:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 13:25:27,391 INFO L474 BasicCegarLoop]: Counterexample might be feasible [2019-09-20 13:25:27,440 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967301 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2019-09-20 13:25:27,441 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967302 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2019-09-20 13:25:27,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:25:27 BoogieIcfgContainer [2019-09-20 13:25:27,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:25:27,563 INFO L168 Benchmark]: Toolchain (without parser) took 18922.28 ms. Allocated memory was 141.0 MB in the beginning and 439.9 MB in the end (delta: 298.8 MB). Free memory was 85.4 MB in the beginning and 240.2 MB in the end (delta: -154.8 MB). Peak memory consumption was 144.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:27,563 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory is still 106.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-20 13:25:27,564 INFO L168 Benchmark]: CACSL2BoogieTranslator took 943.52 ms. Allocated memory was 141.0 MB in the beginning and 201.9 MB in the end (delta: 60.8 MB). Free memory was 85.0 MB in the beginning and 160.5 MB in the end (delta: -75.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:27,566 INFO L168 Benchmark]: Boogie Preprocessor took 162.00 ms. Allocated memory is still 201.9 MB. Free memory was 160.5 MB in the beginning and 153.3 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:27,567 INFO L168 Benchmark]: RCFGBuilder took 1432.14 ms. Allocated memory was 201.9 MB in the beginning and 229.1 MB in the end (delta: 27.3 MB). Free memory was 153.3 MB in the beginning and 177.9 MB in the end (delta: -24.5 MB). Peak memory consumption was 81.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:27,568 INFO L168 Benchmark]: TraceAbstraction took 16379.55 ms. Allocated memory was 229.1 MB in the beginning and 439.9 MB in the end (delta: 210.8 MB). Free memory was 177.9 MB in the beginning and 240.2 MB in the end (delta: -62.3 MB). Peak memory consumption was 148.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:27,570 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory is still 106.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 943.52 ms. Allocated memory was 141.0 MB in the beginning and 201.9 MB in the end (delta: 60.8 MB). Free memory was 85.0 MB in the beginning and 160.5 MB in the end (delta: -75.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 162.00 ms. Allocated memory is still 201.9 MB. Free memory was 160.5 MB in the beginning and 153.3 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1432.14 ms. Allocated memory was 201.9 MB in the beginning and 229.1 MB in the end (delta: 27.3 MB). Free memory was 153.3 MB in the beginning and 177.9 MB in the end (delta: -24.5 MB). Peak memory consumption was 81.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16379.55 ms. Allocated memory was 229.1 MB in the beginning and 439.9 MB in the end (delta: 210.8 MB). Free memory was 177.9 MB in the beginning and 240.2 MB in the end (delta: -62.3 MB). Peak memory consumption was 148.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967301 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967302 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1645]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1330. Possible FailurePath: [L1039] static int init = 1; [L1040] 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={-6:0}] [L1062] SSL *s ; [L1066] s = malloc (sizeof (SSL)) [L1067] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1068] s->ctx = malloc(sizeof(SSL_CTX)) [L1069] s->state = 12292 [L1070] s->version = __VERIFIER_nondet_int() [L1071] CALL ssl3_connect(s) VAL [init=1, s={1:0}, SSLv3_client_data={-6:0}] [L1077] BUF_MEM *buf = __VERIFIER_nondet_pointer(); [L1078] unsigned long tmp ; [L1079] unsigned long l ; [L1080] long num1 ; [L1081] void (*cb)() ; [L1082] int ret ; [L1083] int new_state ; [L1084] int state ; [L1085] int skip ; [L1086] int *tmp___0 ; [L1087] int tmp___1 = __VERIFIER_nondet_int(); [L1088] int tmp___2 = __VERIFIER_nondet_int(); [L1089] int tmp___3 ; [L1090] int tmp___4 ; [L1091] int tmp___5 ; [L1092] int tmp___6 ; [L1093] int tmp___7 ; [L1094] int tmp___8 ; [L1095] long tmp___9 ; [L1097] int blastFlag ; [L1100] blastFlag = 0 [L1101] s->state = 12292 [L1102] s->hit = __VERIFIER_nondet_int() [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] tmp___0 = (int*)malloc(sizeof(int)) [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->info_callback={6:-4294967301}, skip=0, SSLv3_client_data={-6:0}, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0] [L1130] COND TRUE 1 VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->state=12292, skip=0, SSLv3_client_data={-6:0}, state=12292, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=12292, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=12292, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0] [L1249] EXPR s->version VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->version=3, skip=0, SSLv3_client_data={-6:0}, state=12292, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->init_buf={4294967297:0}, skip=0, SSLv3_client_data={-6:0}, state=12292, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1268] tmp___4 = __VERIFIER_nondet_int() [L1269] COND FALSE !(! tmp___4) [L1275] tmp___5 = __VERIFIER_nondet_int() [L1276] COND FALSE !(! tmp___5) [L1282] s->state = 4368 [L1283] EXPR s->ctx [L1283] EXPR (s->ctx)->stats.sess_connect [L1283] (s->ctx)->stats.sess_connect += 1 [L1284] s->init_num = 0 VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=12292, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-4294967301}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={-6:0}, state=12292, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=12292, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=12292, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->state=4368, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->state=4368, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->state=4368, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->state=4368, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->state=4368, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->state=4368, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND TRUE s->state == 4368 [L1288] s->shutdown = 0 [L1289] ret = __VERIFIER_nondet_int() [L1290] COND TRUE blastFlag == 0 [L1291] blastFlag = 1 VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1295] COND FALSE !(ret <= 0) [L1300] s->state = 4384 [L1301] s->init_num = 0 [L1302] EXPR s->bbio [L1302] EXPR s->wbio VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->bbio={2:-1}, s->wbio={2:1}, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1302] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-4294967301}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4384, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4384, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4384, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4384, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4384, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4384, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4384, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4384, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND TRUE s->state == 4384 [L1310] ret = __VERIFIER_nondet_int() [L1311] COND TRUE blastFlag == 1 [L1312] blastFlag = 2 VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1316] COND FALSE !(ret <= 0) [L1321] s->hit VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->hit=0, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1321] COND FALSE !(s->hit) [L1324] s->state = 4400 VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1326] s->init_num = 0 VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-4294967301}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND TRUE s->state == 4400 [L1330] EXPR s->s3 [L1330] EXPR (s->s3)->tmp.new_cipher [L1330] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={6:-4294967301}, ((s->s3)->tmp.new_cipher)->algorithms=4294967329, (s->s3)->tmp.new_cipher={4294967356:2}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1330] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 2 [L1335] blastFlag = 3 VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1339] COND FALSE !(ret <= 0) VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1345] s->state = 4416 [L1346] s->init_num = 0 VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-4294967301}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1166] COND TRUE s->state == 4416 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 3 [L1352] blastFlag = 4 VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1356] COND FALSE !(ret <= 0) [L1361] s->state = 4432 [L1362] s->init_num = 0 [L1363] tmp___6 = __VERIFIER_nondet_int() [L1364] COND FALSE !(! tmp___6) VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-4294967301}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND TRUE s->state == 4432 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND FALSE !(blastFlag == 5) VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4448 [L1385] s->init_num = 0 VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-4294967301}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1178] COND TRUE s->state == 4448 [L1389] ret = __VERIFIER_nondet_int() [L1390] COND TRUE blastFlag == 4 VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=2, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1645] __VERIFIER_error() VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=2, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 169 locations, 1 error locations. UNSAFE Result, 16.3s OverallTime, 35 OverallIterations, 7 TraceHistogramMax, 11.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7566 SDtfs, 2657 SDslu, 9982 SDs, 0 SdLazy, 5228 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 68 SyntacticMatches, 22 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1029occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 34 MinimizatonAttempts, 2607 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3084 NumberOfCodeBlocks, 3084 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2907 ConstructedInterpolants, 0 QuantifiedInterpolants, 612042 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2666/2666 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...