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/ssh/s3_clnt.blast.04.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:04:57,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:04:57,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:04:57,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:04:57,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:04:57,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:04:57,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:04:57,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:04:57,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:04:57,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:04:57,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:04:57,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:04:57,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:04:57,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:04:57,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:04:57,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:04:57,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:04:57,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:04:57,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:04:57,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:04:57,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:04:57,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:04:57,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:04:57,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:04:57,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:04:57,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:04:57,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:04:57,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:04:57,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:04:57,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:04:57,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:04:57,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:04:57,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:04:57,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:04:57,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:04:57,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:04:57,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:04:57,955 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:04:57,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:04:57,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:04:57,957 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:04:57,958 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-16 17:04:57,973 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:04:57,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:04:57,973 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:04:57,974 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:04:57,974 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:04:57,974 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:04:57,975 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:04:57,975 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:04:57,975 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:04:57,975 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:04:57,976 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:04:57,976 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:04:57,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:04:57,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:04:57,977 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:04:57,977 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:04:57,977 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:04:57,977 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:04:57,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:04:57,978 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:04:57,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:04:57,978 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:04:57,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:04:57,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:57,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:04:57,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:04:57,980 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:04:57,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:04:57,980 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:04:57,980 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:04:58,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:04:58,022 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:04:58,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:04:58,030 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:04:58,031 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:04:58,032 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_clnt.blast.04.i.cil-1.c [2019-09-16 17:04:58,110 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fbb73177/b9ef9e91358b4457afdd548b0431fbb9/FLAG36d1fbfee [2019-09-16 17:04:58,740 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:04:58,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_clnt.blast.04.i.cil-1.c [2019-09-16 17:04:58,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fbb73177/b9ef9e91358b4457afdd548b0431fbb9/FLAG36d1fbfee [2019-09-16 17:04:58,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fbb73177/b9ef9e91358b4457afdd548b0431fbb9 [2019-09-16 17:04:58,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:04:58,947 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:04:58,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:58,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:04:58,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:04:58,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:58" (1/1) ... [2019-09-16 17:04:58,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76030fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:58, skipping insertion in model container [2019-09-16 17:04:58,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:58" (1/1) ... [2019-09-16 17:04:58,964 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:04:59,041 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:04:59,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:59,666 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:04:59,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:59,830 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:04:59,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59 WrapperNode [2019-09-16 17:04:59,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:59,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:04:59,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:04:59,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:04:59,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59" (1/1) ... [2019-09-16 17:04:59,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59" (1/1) ... [2019-09-16 17:04:59,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59" (1/1) ... [2019-09-16 17:04:59,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59" (1/1) ... [2019-09-16 17:04:59,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59" (1/1) ... [2019-09-16 17:05:00,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59" (1/1) ... [2019-09-16 17:05:00,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59" (1/1) ... [2019-09-16 17:05:00,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:05:00,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:05:00,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:05:00,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:05:00,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59" (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-16 17:05:00,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:05:00,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:05:00,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-16 17:05:00,142 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-16 17:05:00,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:05:00,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-16 17:05:00,142 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-16 17:05:00,142 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-16 17:05:00,143 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-16 17:05:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:05:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 17:05:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 17:05:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:05:00,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:05:00,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:05:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-16 17:05:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-16 17:05:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-16 17:05:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-16 17:05:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-16 17:05:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-16 17:05:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:05:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:05:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 17:05:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:05:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:05:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:05:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 17:05:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-16 17:05:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:05:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:05:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:05:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:05:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:05:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-16 17:05:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-16 17:05:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-16 17:05:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-16 17:05:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:05:00,708 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:05:01,530 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-16 17:05:01,531 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-16 17:05:01,563 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:05:01,563 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:05:01,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:05:01 BoogieIcfgContainer [2019-09-16 17:05:01,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:05:01,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:05:01,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:05:01,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:05:01,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:04:58" (1/3) ... [2019-09-16 17:05:01,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3069faf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:05:01, skipping insertion in model container [2019-09-16 17:05:01,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59" (2/3) ... [2019-09-16 17:05:01,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3069faf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:05:01, skipping insertion in model container [2019-09-16 17:05:01,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:05:01" (3/3) ... [2019-09-16 17:05:01,576 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-1.c [2019-09-16 17:05:01,587 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:05:01,599 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:05:01,619 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:05:01,655 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:05:01,655 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:05:01,655 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:05:01,655 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:05:01,655 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:05:01,656 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:05:01,656 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:05:01,656 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:05:01,686 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2019-09-16 17:05:01,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 17:05:01,704 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:01,705 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-16 17:05:01,707 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:01,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:01,715 INFO L82 PathProgramCache]: Analyzing trace with hash 461476132, now seen corresponding path program 1 times [2019-09-16 17:05:01,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:01,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:01,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:02,113 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-16 17:05:02,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:02,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:02,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:02,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:02,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:02,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:02,143 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2019-09-16 17:05:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:02,297 INFO L93 Difference]: Finished difference Result 254 states and 414 transitions. [2019-09-16 17:05:02,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:02,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 17:05:02,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:02,322 INFO L225 Difference]: With dead ends: 254 [2019-09-16 17:05:02,322 INFO L226 Difference]: Without dead ends: 219 [2019-09-16 17:05:02,329 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-16 17:05:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-16 17:05:02,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2019-09-16 17:05:02,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-16 17:05:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2019-09-16 17:05:02,429 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 30 [2019-09-16 17:05:02,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:02,430 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2019-09-16 17:05:02,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:02,431 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2019-09-16 17:05:02,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-16 17:05:02,434 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:02,435 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-16 17:05:02,435 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:02,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:02,436 INFO L82 PathProgramCache]: Analyzing trace with hash -147745042, now seen corresponding path program 1 times [2019-09-16 17:05:02,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:02,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:02,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:02,597 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-16 17:05:02,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:02,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:02,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:02,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:02,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:02,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:02,601 INFO L87 Difference]: Start difference. First operand 219 states and 323 transitions. Second operand 3 states. [2019-09-16 17:05:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:02,677 INFO L93 Difference]: Finished difference Result 319 states and 470 transitions. [2019-09-16 17:05:02,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:02,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-16 17:05:02,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:02,681 INFO L225 Difference]: With dead ends: 319 [2019-09-16 17:05:02,681 INFO L226 Difference]: Without dead ends: 319 [2019-09-16 17:05:02,682 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-16 17:05:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-16 17:05:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2019-09-16 17:05:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-16 17:05:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 470 transitions. [2019-09-16 17:05:02,703 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 470 transitions. Word has length 45 [2019-09-16 17:05:02,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:02,703 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 470 transitions. [2019-09-16 17:05:02,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:02,704 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 470 transitions. [2019-09-16 17:05:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:05:02,708 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:02,708 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-16 17:05:02,708 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:02,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:02,709 INFO L82 PathProgramCache]: Analyzing trace with hash -389905176, now seen corresponding path program 1 times [2019-09-16 17:05:02,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:02,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:02,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:02,913 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-16 17:05:02,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:02,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:02,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:02,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:02,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:02,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:02,915 INFO L87 Difference]: Start difference. First operand 319 states and 470 transitions. Second operand 4 states. [2019-09-16 17:05:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:03,498 INFO L93 Difference]: Finished difference Result 505 states and 747 transitions. [2019-09-16 17:05:03,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:03,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:05:03,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:03,503 INFO L225 Difference]: With dead ends: 505 [2019-09-16 17:05:03,503 INFO L226 Difference]: Without dead ends: 505 [2019-09-16 17:05:03,504 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-16 17:05:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-16 17:05:03,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 369. [2019-09-16 17:05:03,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-09-16 17:05:03,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 556 transitions. [2019-09-16 17:05:03,541 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 556 transitions. Word has length 63 [2019-09-16 17:05:03,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:03,543 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 556 transitions. [2019-09-16 17:05:03,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:03,543 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 556 transitions. [2019-09-16 17:05:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:05:03,557 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:03,558 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-16 17:05:03,558 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:03,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:03,558 INFO L82 PathProgramCache]: Analyzing trace with hash -523918682, now seen corresponding path program 1 times [2019-09-16 17:05:03,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:03,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:03,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:03,691 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-16 17:05:03,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:03,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:03,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:03,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:03,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:03,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:03,693 INFO L87 Difference]: Start difference. First operand 369 states and 556 transitions. Second operand 4 states. [2019-09-16 17:05:04,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:04,037 INFO L93 Difference]: Finished difference Result 455 states and 682 transitions. [2019-09-16 17:05:04,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:04,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:05:04,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:04,041 INFO L225 Difference]: With dead ends: 455 [2019-09-16 17:05:04,041 INFO L226 Difference]: Without dead ends: 455 [2019-09-16 17:05:04,041 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-16 17:05:04,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-16 17:05:04,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 409. [2019-09-16 17:05:04,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-09-16 17:05:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 624 transitions. [2019-09-16 17:05:04,056 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 624 transitions. Word has length 63 [2019-09-16 17:05:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:04,056 INFO L475 AbstractCegarLoop]: Abstraction has 409 states and 624 transitions. [2019-09-16 17:05:04,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 624 transitions. [2019-09-16 17:05:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 17:05:04,058 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:04,059 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-16 17:05:04,059 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:04,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:04,060 INFO L82 PathProgramCache]: Analyzing trace with hash 793155671, now seen corresponding path program 1 times [2019-09-16 17:05:04,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:04,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:04,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:04,161 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-16 17:05:04,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:04,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:04,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:04,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:04,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:04,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:04,165 INFO L87 Difference]: Start difference. First operand 409 states and 624 transitions. Second operand 4 states. [2019-09-16 17:05:04,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:04,679 INFO L93 Difference]: Finished difference Result 537 states and 805 transitions. [2019-09-16 17:05:04,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:04,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-16 17:05:04,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:04,687 INFO L225 Difference]: With dead ends: 537 [2019-09-16 17:05:04,687 INFO L226 Difference]: Without dead ends: 537 [2019-09-16 17:05:04,687 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-16 17:05:04,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-16 17:05:04,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 411. [2019-09-16 17:05:04,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 626 transitions. [2019-09-16 17:05:04,703 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 626 transitions. Word has length 64 [2019-09-16 17:05:04,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:04,704 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 626 transitions. [2019-09-16 17:05:04,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:04,704 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 626 transitions. [2019-09-16 17:05:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:05:04,707 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:04,707 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] [2019-09-16 17:05:04,707 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:04,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:04,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1956758784, now seen corresponding path program 1 times [2019-09-16 17:05:04,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:04,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:04,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:04,866 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-16 17:05:04,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:04,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:04,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:04,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:04,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:04,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:04,869 INFO L87 Difference]: Start difference. First operand 411 states and 626 transitions. Second operand 4 states. [2019-09-16 17:05:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:05,350 INFO L93 Difference]: Finished difference Result 535 states and 801 transitions. [2019-09-16 17:05:05,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:05,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:05:05,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:05,356 INFO L225 Difference]: With dead ends: 535 [2019-09-16 17:05:05,356 INFO L226 Difference]: Without dead ends: 535 [2019-09-16 17:05:05,357 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-16 17:05:05,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-16 17:05:05,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-16 17:05:05,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:05,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 624 transitions. [2019-09-16 17:05:05,373 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 624 transitions. Word has length 77 [2019-09-16 17:05:05,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:05,374 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 624 transitions. [2019-09-16 17:05:05,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:05,374 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 624 transitions. [2019-09-16 17:05:05,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:05:05,376 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:05,376 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] [2019-09-16 17:05:05,377 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:05,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:05,377 INFO L82 PathProgramCache]: Analyzing trace with hash 847778338, now seen corresponding path program 1 times [2019-09-16 17:05:05,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:05,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:05,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:05,484 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-16 17:05:05,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:05,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:05,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:05,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:05,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:05,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:05,487 INFO L87 Difference]: Start difference. First operand 411 states and 624 transitions. Second operand 4 states. [2019-09-16 17:05:05,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:05,938 INFO L93 Difference]: Finished difference Result 535 states and 799 transitions. [2019-09-16 17:05:05,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:05,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:05:05,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:05,942 INFO L225 Difference]: With dead ends: 535 [2019-09-16 17:05:05,943 INFO L226 Difference]: Without dead ends: 535 [2019-09-16 17:05:05,943 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-16 17:05:05,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-16 17:05:05,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-16 17:05:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 622 transitions. [2019-09-16 17:05:05,958 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 622 transitions. Word has length 77 [2019-09-16 17:05:05,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:05,958 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 622 transitions. [2019-09-16 17:05:05,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 622 transitions. [2019-09-16 17:05:05,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:05:05,960 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:05,961 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] [2019-09-16 17:05:05,961 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:05,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:05,961 INFO L82 PathProgramCache]: Analyzing trace with hash 927399486, now seen corresponding path program 1 times [2019-09-16 17:05:05,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:05,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:05,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:06,033 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-16 17:05:06,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:06,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:06,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:06,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:06,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:06,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:06,035 INFO L87 Difference]: Start difference. First operand 411 states and 622 transitions. Second operand 4 states. [2019-09-16 17:05:06,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:06,359 INFO L93 Difference]: Finished difference Result 455 states and 676 transitions. [2019-09-16 17:05:06,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:06,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:05:06,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:06,363 INFO L225 Difference]: With dead ends: 455 [2019-09-16 17:05:06,363 INFO L226 Difference]: Without dead ends: 455 [2019-09-16 17:05:06,364 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-16 17:05:06,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-16 17:05:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-16 17:05:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 620 transitions. [2019-09-16 17:05:06,374 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 620 transitions. Word has length 77 [2019-09-16 17:05:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:06,374 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 620 transitions. [2019-09-16 17:05:06,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:06,375 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 620 transitions. [2019-09-16 17:05:06,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:05:06,376 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:06,376 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] [2019-09-16 17:05:06,377 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:06,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:06,377 INFO L82 PathProgramCache]: Analyzing trace with hash -181580960, now seen corresponding path program 1 times [2019-09-16 17:05:06,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:06,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:06,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:06,445 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-16 17:05:06,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:06,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:06,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:06,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:06,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:06,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:06,447 INFO L87 Difference]: Start difference. First operand 411 states and 620 transitions. Second operand 4 states. [2019-09-16 17:05:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:06,761 INFO L93 Difference]: Finished difference Result 455 states and 674 transitions. [2019-09-16 17:05:06,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:06,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:05:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:06,766 INFO L225 Difference]: With dead ends: 455 [2019-09-16 17:05:06,767 INFO L226 Difference]: Without dead ends: 455 [2019-09-16 17:05:06,767 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-16 17:05:06,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-16 17:05:06,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-16 17:05:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:06,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 618 transitions. [2019-09-16 17:05:06,784 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 618 transitions. Word has length 77 [2019-09-16 17:05:06,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:06,784 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 618 transitions. [2019-09-16 17:05:06,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:06,784 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 618 transitions. [2019-09-16 17:05:06,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:06,786 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:06,786 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] [2019-09-16 17:05:06,786 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:06,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:06,787 INFO L82 PathProgramCache]: Analyzing trace with hash 565717777, now seen corresponding path program 1 times [2019-09-16 17:05:06,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:06,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:06,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:06,879 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-16 17:05:06,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:06,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:06,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:06,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:06,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:06,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:06,882 INFO L87 Difference]: Start difference. First operand 411 states and 618 transitions. Second operand 4 states. [2019-09-16 17:05:07,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:07,465 INFO L93 Difference]: Finished difference Result 535 states and 793 transitions. [2019-09-16 17:05:07,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:07,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:07,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:07,470 INFO L225 Difference]: With dead ends: 535 [2019-09-16 17:05:07,470 INFO L226 Difference]: Without dead ends: 535 [2019-09-16 17:05:07,471 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-16 17:05:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-16 17:05:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-16 17:05:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 616 transitions. [2019-09-16 17:05:07,488 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 616 transitions. Word has length 78 [2019-09-16 17:05:07,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:07,489 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 616 transitions. [2019-09-16 17:05:07,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:07,489 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 616 transitions. [2019-09-16 17:05:07,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:07,491 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:07,492 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-16 17:05:07,492 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:07,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:07,493 INFO L82 PathProgramCache]: Analyzing trace with hash 865778860, now seen corresponding path program 1 times [2019-09-16 17:05:07,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:07,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:07,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:07,592 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-16 17:05:07,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:07,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:07,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:07,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:07,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:07,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:07,595 INFO L87 Difference]: Start difference. First operand 411 states and 616 transitions. Second operand 4 states. [2019-09-16 17:05:08,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:08,107 INFO L93 Difference]: Finished difference Result 535 states and 791 transitions. [2019-09-16 17:05:08,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:08,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:08,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:08,112 INFO L225 Difference]: With dead ends: 535 [2019-09-16 17:05:08,112 INFO L226 Difference]: Without dead ends: 535 [2019-09-16 17:05:08,113 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-16 17:05:08,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-16 17:05:08,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-16 17:05:08,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:08,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 614 transitions. [2019-09-16 17:05:08,124 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 614 transitions. Word has length 78 [2019-09-16 17:05:08,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:08,125 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 614 transitions. [2019-09-16 17:05:08,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:08,125 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 614 transitions. [2019-09-16 17:05:08,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:08,126 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:08,126 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] [2019-09-16 17:05:08,127 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:08,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:08,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1279649389, now seen corresponding path program 1 times [2019-09-16 17:05:08,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:08,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:08,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:08,213 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-16 17:05:08,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:08,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:08,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:08,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:08,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:08,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:08,215 INFO L87 Difference]: Start difference. First operand 411 states and 614 transitions. Second operand 4 states. [2019-09-16 17:05:08,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:08,511 INFO L93 Difference]: Finished difference Result 455 states and 668 transitions. [2019-09-16 17:05:08,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:08,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:08,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:08,515 INFO L225 Difference]: With dead ends: 455 [2019-09-16 17:05:08,515 INFO L226 Difference]: Without dead ends: 455 [2019-09-16 17:05:08,516 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-16 17:05:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-16 17:05:08,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-16 17:05:08,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:08,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 612 transitions. [2019-09-16 17:05:08,527 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 612 transitions. Word has length 78 [2019-09-16 17:05:08,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:08,528 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 612 transitions. [2019-09-16 17:05:08,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:08,528 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 612 transitions. [2019-09-16 17:05:08,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:08,529 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:08,530 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-16 17:05:08,530 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:08,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:08,531 INFO L82 PathProgramCache]: Analyzing trace with hash -979588306, now seen corresponding path program 1 times [2019-09-16 17:05:08,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:08,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:08,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:08,609 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-16 17:05:08,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:08,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:08,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:08,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:08,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:08,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:08,611 INFO L87 Difference]: Start difference. First operand 411 states and 612 transitions. Second operand 4 states. [2019-09-16 17:05:08,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:08,926 INFO L93 Difference]: Finished difference Result 455 states and 666 transitions. [2019-09-16 17:05:08,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:08,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:08,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:08,930 INFO L225 Difference]: With dead ends: 455 [2019-09-16 17:05:08,930 INFO L226 Difference]: Without dead ends: 455 [2019-09-16 17:05:08,930 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-16 17:05:08,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-16 17:05:08,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-16 17:05:08,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 610 transitions. [2019-09-16 17:05:08,942 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 610 transitions. Word has length 78 [2019-09-16 17:05:08,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:08,942 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 610 transitions. [2019-09-16 17:05:08,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 610 transitions. [2019-09-16 17:05:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:08,944 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:08,944 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] [2019-09-16 17:05:08,944 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:08,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:08,945 INFO L82 PathProgramCache]: Analyzing trace with hash 468355613, now seen corresponding path program 1 times [2019-09-16 17:05:08,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:08,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:08,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:09,014 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-16 17:05:09,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:09,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:09,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:09,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:09,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:09,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:09,016 INFO L87 Difference]: Start difference. First operand 411 states and 610 transitions. Second operand 4 states. [2019-09-16 17:05:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:09,442 INFO L93 Difference]: Finished difference Result 535 states and 785 transitions. [2019-09-16 17:05:09,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:09,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:09,446 INFO L225 Difference]: With dead ends: 535 [2019-09-16 17:05:09,447 INFO L226 Difference]: Without dead ends: 535 [2019-09-16 17:05:09,447 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-16 17:05:09,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-16 17:05:09,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-16 17:05:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:09,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 608 transitions. [2019-09-16 17:05:09,459 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 608 transitions. Word has length 79 [2019-09-16 17:05:09,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:09,459 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 608 transitions. [2019-09-16 17:05:09,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:09,460 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 608 transitions. [2019-09-16 17:05:09,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:09,462 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:09,462 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-16 17:05:09,462 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:09,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:09,463 INFO L82 PathProgramCache]: Analyzing trace with hash -821622051, now seen corresponding path program 1 times [2019-09-16 17:05:09,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:09,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:09,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:09,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:09,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:09,547 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-16 17:05:09,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:09,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:09,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:09,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:09,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:09,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:09,549 INFO L87 Difference]: Start difference. First operand 411 states and 608 transitions. Second operand 4 states. [2019-09-16 17:05:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:09,994 INFO L93 Difference]: Finished difference Result 529 states and 776 transitions. [2019-09-16 17:05:09,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:09,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:09,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:09,999 INFO L225 Difference]: With dead ends: 529 [2019-09-16 17:05:10,000 INFO L226 Difference]: Without dead ends: 529 [2019-09-16 17:05:10,000 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-16 17:05:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-16 17:05:10,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 411. [2019-09-16 17:05:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:10,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 606 transitions. [2019-09-16 17:05:10,011 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 606 transitions. Word has length 79 [2019-09-16 17:05:10,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:10,011 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 606 transitions. [2019-09-16 17:05:10,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 606 transitions. [2019-09-16 17:05:10,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:10,013 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:10,013 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] [2019-09-16 17:05:10,013 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:10,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:10,014 INFO L82 PathProgramCache]: Analyzing trace with hash -903451685, now seen corresponding path program 1 times [2019-09-16 17:05:10,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:10,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:10,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:10,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:10,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:10,081 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-16 17:05:10,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:10,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:10,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:10,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:10,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:10,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:10,083 INFO L87 Difference]: Start difference. First operand 411 states and 606 transitions. Second operand 4 states. [2019-09-16 17:05:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:10,373 INFO L93 Difference]: Finished difference Result 455 states and 660 transitions. [2019-09-16 17:05:10,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:10,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:10,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:10,377 INFO L225 Difference]: With dead ends: 455 [2019-09-16 17:05:10,378 INFO L226 Difference]: Without dead ends: 455 [2019-09-16 17:05:10,378 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-16 17:05:10,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-16 17:05:10,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-16 17:05:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:10,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 604 transitions. [2019-09-16 17:05:10,390 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 604 transitions. Word has length 79 [2019-09-16 17:05:10,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:10,390 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 604 transitions. [2019-09-16 17:05:10,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 604 transitions. [2019-09-16 17:05:10,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:10,392 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:10,392 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-16 17:05:10,393 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:10,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:10,393 INFO L82 PathProgramCache]: Analyzing trace with hash 2101537947, now seen corresponding path program 1 times [2019-09-16 17:05:10,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:10,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:10,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:10,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:10,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:10,458 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-16 17:05:10,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:10,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:10,458 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:10,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:10,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:10,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:10,460 INFO L87 Difference]: Start difference. First operand 411 states and 604 transitions. Second operand 4 states. [2019-09-16 17:05:10,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:10,713 INFO L93 Difference]: Finished difference Result 449 states and 651 transitions. [2019-09-16 17:05:10,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:10,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:10,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:10,718 INFO L225 Difference]: With dead ends: 449 [2019-09-16 17:05:10,719 INFO L226 Difference]: Without dead ends: 449 [2019-09-16 17:05:10,719 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-16 17:05:10,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-16 17:05:10,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 411. [2019-09-16 17:05:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 602 transitions. [2019-09-16 17:05:10,729 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 602 transitions. Word has length 79 [2019-09-16 17:05:10,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:10,729 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 602 transitions. [2019-09-16 17:05:10,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:10,730 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 602 transitions. [2019-09-16 17:05:10,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:05:10,731 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:10,731 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] [2019-09-16 17:05:10,731 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:10,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:10,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1801676460, now seen corresponding path program 1 times [2019-09-16 17:05:10,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:10,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:10,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:10,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:10,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:10,795 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-16 17:05:10,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:10,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:10,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:10,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:10,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:10,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:10,796 INFO L87 Difference]: Start difference. First operand 411 states and 602 transitions. Second operand 4 states. [2019-09-16 17:05:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:11,256 INFO L93 Difference]: Finished difference Result 511 states and 748 transitions. [2019-09-16 17:05:11,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:11,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:05:11,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:11,259 INFO L225 Difference]: With dead ends: 511 [2019-09-16 17:05:11,259 INFO L226 Difference]: Without dead ends: 511 [2019-09-16 17:05:11,260 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-16 17:05:11,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-16 17:05:11,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 411. [2019-09-16 17:05:11,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 600 transitions. [2019-09-16 17:05:11,271 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 600 transitions. Word has length 80 [2019-09-16 17:05:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:11,271 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 600 transitions. [2019-09-16 17:05:11,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 600 transitions. [2019-09-16 17:05:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:05:11,273 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:11,274 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] [2019-09-16 17:05:11,274 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:11,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:11,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2069644114, now seen corresponding path program 1 times [2019-09-16 17:05:11,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:11,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:11,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:11,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:11,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:11,347 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-16 17:05:11,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:11,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:11,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:11,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:11,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:11,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:11,349 INFO L87 Difference]: Start difference. First operand 411 states and 600 transitions. Second operand 4 states. [2019-09-16 17:05:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:11,614 INFO L93 Difference]: Finished difference Result 431 states and 625 transitions. [2019-09-16 17:05:11,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:11,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:05:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:11,617 INFO L225 Difference]: With dead ends: 431 [2019-09-16 17:05:11,618 INFO L226 Difference]: Without dead ends: 431 [2019-09-16 17:05:11,618 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-16 17:05:11,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-09-16 17:05:11,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 411. [2019-09-16 17:05:11,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2019-09-16 17:05:11,628 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 80 [2019-09-16 17:05:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:11,628 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2019-09-16 17:05:11,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2019-09-16 17:05:11,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:11,630 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:11,630 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-16 17:05:11,630 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:11,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:11,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1190699097, now seen corresponding path program 1 times [2019-09-16 17:05:11,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:11,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:11,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:11,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:11,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:11,694 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-16 17:05:11,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:11,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:11,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:11,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:11,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:11,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:11,696 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand 4 states. [2019-09-16 17:05:12,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:12,072 INFO L93 Difference]: Finished difference Result 511 states and 744 transitions. [2019-09-16 17:05:12,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:12,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:05:12,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:12,076 INFO L225 Difference]: With dead ends: 511 [2019-09-16 17:05:12,076 INFO L226 Difference]: Without dead ends: 511 [2019-09-16 17:05:12,077 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-16 17:05:12,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-16 17:05:12,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 411. [2019-09-16 17:05:12,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:12,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 596 transitions. [2019-09-16 17:05:12,088 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 596 transitions. Word has length 81 [2019-09-16 17:05:12,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:12,088 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 596 transitions. [2019-09-16 17:05:12,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:12,089 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 596 transitions. [2019-09-16 17:05:12,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:12,090 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:12,090 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-16 17:05:12,091 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:12,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:12,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1438845591, now seen corresponding path program 1 times [2019-09-16 17:05:12,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:12,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:12,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:12,158 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-16 17:05:12,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:12,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:12,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:12,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:12,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:12,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:12,160 INFO L87 Difference]: Start difference. First operand 411 states and 596 transitions. Second operand 3 states. [2019-09-16 17:05:12,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:12,190 INFO L93 Difference]: Finished difference Result 560 states and 813 transitions. [2019-09-16 17:05:12,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:12,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-16 17:05:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:12,195 INFO L225 Difference]: With dead ends: 560 [2019-09-16 17:05:12,195 INFO L226 Difference]: Without dead ends: 560 [2019-09-16 17:05:12,196 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-16 17:05:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-09-16 17:05:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2019-09-16 17:05:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-09-16 17:05:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 813 transitions. [2019-09-16 17:05:12,209 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 813 transitions. Word has length 81 [2019-09-16 17:05:12,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:12,209 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 813 transitions. [2019-09-16 17:05:12,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 813 transitions. [2019-09-16 17:05:12,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-16 17:05:12,211 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:12,211 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-16 17:05:12,212 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:12,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:12,212 INFO L82 PathProgramCache]: Analyzing trace with hash 181906312, now seen corresponding path program 1 times [2019-09-16 17:05:12,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:12,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:12,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:12,285 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-16 17:05:12,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:12,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:12,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:12,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:12,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:12,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:12,287 INFO L87 Difference]: Start difference. First operand 560 states and 813 transitions. Second operand 3 states. [2019-09-16 17:05:12,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:12,321 INFO L93 Difference]: Finished difference Result 709 states and 1031 transitions. [2019-09-16 17:05:12,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:12,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-16 17:05:12,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:12,327 INFO L225 Difference]: With dead ends: 709 [2019-09-16 17:05:12,328 INFO L226 Difference]: Without dead ends: 709 [2019-09-16 17:05:12,328 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-16 17:05:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-09-16 17:05:12,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2019-09-16 17:05:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-09-16 17:05:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1031 transitions. [2019-09-16 17:05:12,347 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1031 transitions. Word has length 83 [2019-09-16 17:05:12,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:12,347 INFO L475 AbstractCegarLoop]: Abstraction has 709 states and 1031 transitions. [2019-09-16 17:05:12,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:12,348 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1031 transitions. [2019-09-16 17:05:12,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:05:12,350 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:12,350 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-16 17:05:12,350 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:12,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:12,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1980699707, now seen corresponding path program 1 times [2019-09-16 17:05:12,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:12,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:12,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:05:12,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:12,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:05:12,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:12,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:05:12,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:05:12,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:05:12,476 INFO L87 Difference]: Start difference. First operand 709 states and 1031 transitions. Second operand 6 states. [2019-09-16 17:05:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:12,971 INFO L93 Difference]: Finished difference Result 792 states and 1152 transitions. [2019-09-16 17:05:12,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:05:12,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2019-09-16 17:05:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:12,976 INFO L225 Difference]: With dead ends: 792 [2019-09-16 17:05:12,976 INFO L226 Difference]: Without dead ends: 792 [2019-09-16 17:05:12,976 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:05:12,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-09-16 17:05:12,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 717. [2019-09-16 17:05:12,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-16 17:05:12,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1044 transitions. [2019-09-16 17:05:12,991 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1044 transitions. Word has length 104 [2019-09-16 17:05:12,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:12,991 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1044 transitions. [2019-09-16 17:05:12,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:05:12,992 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1044 transitions. [2019-09-16 17:05:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-16 17:05:12,994 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:12,994 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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-16 17:05:12,994 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:12,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:12,995 INFO L82 PathProgramCache]: Analyzing trace with hash 846329970, now seen corresponding path program 1 times [2019-09-16 17:05:12,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:12,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:12,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:05:13,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:13,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:05:13,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:13,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:05:13,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:05:13,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:05:13,147 INFO L87 Difference]: Start difference. First operand 717 states and 1044 transitions. Second operand 6 states. [2019-09-16 17:05:13,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:13,833 INFO L93 Difference]: Finished difference Result 789 states and 1148 transitions. [2019-09-16 17:05:13,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:05:13,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-16 17:05:13,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:13,838 INFO L225 Difference]: With dead ends: 789 [2019-09-16 17:05:13,838 INFO L226 Difference]: Without dead ends: 789 [2019-09-16 17:05:13,843 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:05:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-09-16 17:05:13,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 718. [2019-09-16 17:05:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-09-16 17:05:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1045 transitions. [2019-09-16 17:05:13,866 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1045 transitions. Word has length 105 [2019-09-16 17:05:13,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:13,867 INFO L475 AbstractCegarLoop]: Abstraction has 718 states and 1045 transitions. [2019-09-16 17:05:13,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:05:13,867 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1045 transitions. [2019-09-16 17:05:13,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-16 17:05:13,871 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:13,871 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] [2019-09-16 17:05:13,871 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:13,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:13,872 INFO L82 PathProgramCache]: Analyzing trace with hash 741178707, now seen corresponding path program 1 times [2019-09-16 17:05:13,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:13,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:13,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:13,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:13,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-16 17:05:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-16 17:05:14,434 INFO L474 BasicCegarLoop]: Counterexample might be feasible [2019-09-16 17:05:14,479 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967306 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-16 17:05:14,480 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967310 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-16 17:05:14,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:05:14 BoogieIcfgContainer [2019-09-16 17:05:14,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:05:14,574 INFO L168 Benchmark]: Toolchain (without parser) took 15626.53 ms. Allocated memory was 132.6 MB in the beginning and 427.8 MB in the end (delta: 295.2 MB). Free memory was 86.9 MB in the beginning and 190.7 MB in the end (delta: -103.8 MB). Peak memory consumption was 191.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:14,575 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:05:14,576 INFO L168 Benchmark]: CACSL2BoogieTranslator took 883.94 ms. Allocated memory was 132.6 MB in the beginning and 201.9 MB in the end (delta: 69.2 MB). Free memory was 86.7 MB in the beginning and 159.7 MB in the end (delta: -73.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:14,576 INFO L168 Benchmark]: Boogie Preprocessor took 191.86 ms. Allocated memory is still 201.9 MB. Free memory was 159.7 MB in the beginning and 151.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:14,577 INFO L168 Benchmark]: RCFGBuilder took 1540.61 ms. Allocated memory was 201.9 MB in the beginning and 224.9 MB in the end (delta: 23.1 MB). Free memory was 151.7 MB in the beginning and 174.6 MB in the end (delta: -22.8 MB). Peak memory consumption was 84.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:14,578 INFO L168 Benchmark]: TraceAbstraction took 13005.69 ms. Allocated memory was 224.9 MB in the beginning and 427.8 MB in the end (delta: 202.9 MB). Free memory was 174.6 MB in the beginning and 190.7 MB in the end (delta: -16.1 MB). Peak memory consumption was 186.8 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:14,581 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.18 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 883.94 ms. Allocated memory was 132.6 MB in the beginning and 201.9 MB in the end (delta: 69.2 MB). Free memory was 86.7 MB in the beginning and 159.7 MB in the end (delta: -73.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 191.86 ms. Allocated memory is still 201.9 MB. Free memory was 159.7 MB in the beginning and 151.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1540.61 ms. Allocated memory was 201.9 MB in the beginning and 224.9 MB in the end (delta: 23.1 MB). Free memory was 151.7 MB in the beginning and 174.6 MB in the end (delta: -22.8 MB). Peak memory consumption was 84.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13005.69 ms. Allocated memory was 224.9 MB in the beginning and 427.8 MB in the end (delta: 202.9 MB). Free memory was 174.6 MB in the beginning and 190.7 MB in the end (delta: -16.1 MB). Peak memory consumption was 186.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967306 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 4294967310 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: 1643]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1334. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=4294967334, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={-3:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1074] CALL ssl3_connect(s) VAL [init=1, s={2:0}, SSLv3_client_data={-3:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int *tmp___0 = __VERIFIER_nondet_pointer() ; [L1090] int tmp___1 = __VERIFIER_nondet_int() ; [L1091] int tmp___2 = __VERIFIER_nondet_int() ; [L1092] int tmp___3 = __VERIFIER_nondet_int() ; [L1093] int tmp___4 = __VERIFIER_nondet_int() ; [L1094] int tmp___5 = __VERIFIER_nondet_int() ; [L1095] int tmp___6 = __VERIFIER_nondet_int() ; [L1096] int tmp___7 = __VERIFIER_nondet_int() ; [L1097] int tmp___8 = __VERIFIER_nondet_int() ; [L1098] long tmp___9 = __VERIFIER_nondet_long() ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->hit=__VERIFIER_nondet_int () [L1104] s->state = 12292 [L1105] tmp = __VERIFIER_nondet_int() [L1106] cb = (void (*)())((void *)0) [L1107] ret = -1 [L1108] skip = 0 [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->info_callback={-4294967301:6}, skip=0, SSLv3_client_data={-3:0}, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=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 [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=12292, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=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 [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1249] EXPR s->version VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->version=1, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->init_buf={4294967297:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1274] COND FALSE !(! tmp___4) VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1280] COND FALSE !(! tmp___5) [L1286] s->state = 4368 [L1287] EXPR s->ctx [L1287] EXPR (s->ctx)->stats.sess_connect [L1287] (s->ctx)->stats.sess_connect += 1 [L1288] s->init_num = 0 VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4368, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->s3={2:-796}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND TRUE s->state == 4368 [L1292] s->shutdown = 0 [L1293] ret = __VERIFIER_nondet_int() [L1294] COND TRUE blastFlag == 0 [L1295] blastFlag = 1 VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1299] COND FALSE !(ret <= 0) [L1304] s->state = 4384 [L1305] s->init_num = 0 [L1306] EXPR s->bbio [L1306] EXPR s->wbio VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->bbio={2:1}, s->wbio={-1:2}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1306] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4384, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->s3={2:-796}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND TRUE s->state == 4384 [L1314] ret = __VERIFIER_nondet_int() [L1315] COND TRUE blastFlag == 1 [L1316] blastFlag = 2 VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1320] COND FALSE !(ret <= 0) [L1325] s->hit VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->hit=0, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1325] COND FALSE !(s->hit) [L1328] s->state = 4400 VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1330] s->init_num = 0 VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4400, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->s3={2:-796}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND TRUE s->state == 4400 [L1334] EXPR s->s3 [L1334] EXPR (s->s3)->tmp.new_cipher [L1334] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={-4294967301:6}, ((s->s3)->tmp.new_cipher)->algorithms=4294967330, (s->s3)->tmp.new_cipher={4294967317:2}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->s3={2:-796}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1334] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1337] ret = __VERIFIER_nondet_int() [L1338] COND TRUE blastFlag == 2 [L1339] blastFlag = 3 VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1347] COND FALSE !(ret <= 0) VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1353] s->state = 4416 [L1354] s->init_num = 0 VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4416, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->s3={2:-796}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1166] COND TRUE s->state == 4416 [L1358] ret = __VERIFIER_nondet_int() [L1359] COND TRUE blastFlag == 3 [L1360] blastFlag = 4 VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1364] COND FALSE !(ret <= 0) [L1369] s->state = 4432 [L1370] s->init_num = 0 VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1371] COND FALSE !(! tmp___6) VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4432, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->s3={2:-796}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1172] COND TRUE s->state == 4432 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 4 VAL [={-4294967301:6}, blastFlag=4, init=1, ret=2, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1643] __VERIFIER_error() VAL [={-4294967301:6}, blastFlag=4, init=1, ret=2, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 167 locations, 1 error locations. UNSAFE Result, 12.9s OverallTime, 25 OverallIterations, 6 TraceHistogramMax, 8.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5115 SDtfs, 2300 SDslu, 6859 SDs, 0 SdLazy, 4108 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 20 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=718occurred in iteration=24, 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.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 1670 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1933 NumberOfCodeBlocks, 1933 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1791 ConstructedInterpolants, 0 QuantifiedInterpolants, 397585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 1286/1286 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...