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-112bae1 [2019-09-09 05:52:56,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:52:56,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:52:56,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:52:56,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:52:56,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:52:56,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:52:56,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:52:56,943 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:52:56,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:52:56,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:52:56,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:52:56,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:52:56,947 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:52:56,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:52:56,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:52:56,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:52:56,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:52:56,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:52:56,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:52:56,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:52:56,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:52:56,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:52:56,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:52:56,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:52:56,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:52:56,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:52:56,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:52:56,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:52:56,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:52:56,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:52:56,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:52:56,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:52:56,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:52:56,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:52:56,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:52:56,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:52:56,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:52:56,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:52:56,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:52:56,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:52:56,970 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-09 05:52:56,985 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:52:56,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:52:56,985 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:52:56,985 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:52:56,986 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:52:56,986 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:52:56,986 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:52:56,987 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:52:56,987 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:52:56,987 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:52:56,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:52:56,988 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:52:56,988 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:52:56,988 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:52:56,988 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:52:56,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:52:56,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:52:56,989 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:52:56,989 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:52:56,989 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:52:56,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:52:56,990 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:52:56,990 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:52:56,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:52:56,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:52:56,991 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:52:56,991 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:52:56,991 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:52:56,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:52:56,991 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:52:57,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:52:57,031 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:52:57,034 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:52:57,036 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:52:57,036 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:52:57,037 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-09 05:52:57,094 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15dbbac19/d88321919c724ce9903ad5695351734c/FLAGf36c2be37 [2019-09-09 05:52:57,632 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:52:57,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_clnt.blast.04.i.cil-1.c [2019-09-09 05:52:57,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15dbbac19/d88321919c724ce9903ad5695351734c/FLAGf36c2be37 [2019-09-09 05:52:57,856 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15dbbac19/d88321919c724ce9903ad5695351734c [2019-09-09 05:52:57,865 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:52:57,866 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:52:57,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:52:57,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:52:57,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:52:57,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:52:57" (1/1) ... [2019-09-09 05:52:57,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788c9ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:57, skipping insertion in model container [2019-09-09 05:52:57,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:52:57" (1/1) ... [2019-09-09 05:52:57,881 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:52:57,947 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:52:58,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:52:58,527 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:52:58,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:52:58,715 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:52:58,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:58 WrapperNode [2019-09-09 05:52:58,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:52:58,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:52:58,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:52:58,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:52:58,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:58" (1/1) ... [2019-09-09 05:52:58,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:58" (1/1) ... [2019-09-09 05:52:58,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:58" (1/1) ... [2019-09-09 05:52:58,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:58" (1/1) ... [2019-09-09 05:52:58,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:58" (1/1) ... [2019-09-09 05:52:58,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:58" (1/1) ... [2019-09-09 05:52:58,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:58" (1/1) ... [2019-09-09 05:52:58,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:52:58,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:52:58,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:52:58,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:52:58,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:58" (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-09 05:52:58,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:52:58,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:52:58,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-09 05:52:58,951 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-09 05:52:58,952 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:52:58,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-09 05:52:58,952 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-09 05:52:58,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-09 05:52:58,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-09 05:52:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:52:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-09 05:52:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:52:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:52:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:52:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:52:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-09 05:52:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-09 05:52:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-09 05:52:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-09 05:52:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-09 05:52:58,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-09 05:52:58,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-09 05:52:58,957 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:52:58,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-09 05:52:58,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-09 05:52:58,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-09 05:52:58,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-09 05:52:58,958 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-09 05:52:58,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-09 05:52:58,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:52:58,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-09 05:52:58,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-09 05:52:58,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-09 05:52:58,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:52:58,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-09 05:52:58,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-09 05:52:58,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-09 05:52:58,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-09 05:52:58,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-09 05:52:59,467 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:53:00,223 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-09 05:53:00,223 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-09 05:53:00,249 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:53:00,250 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:53:00,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:53:00 BoogieIcfgContainer [2019-09-09 05:53:00,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:53:00,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:53:00,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:53:00,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:53:00,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:52:57" (1/3) ... [2019-09-09 05:53:00,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b870281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:53:00, skipping insertion in model container [2019-09-09 05:53:00,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:58" (2/3) ... [2019-09-09 05:53:00,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b870281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:53:00, skipping insertion in model container [2019-09-09 05:53:00,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:53:00" (3/3) ... [2019-09-09 05:53:00,262 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-1.c [2019-09-09 05:53:00,272 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:53:00,282 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:53:00,299 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:53:00,340 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:53:00,340 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:53:00,340 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:53:00,341 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:53:00,342 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:53:00,342 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:53:00,343 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:53:00,343 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:53:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2019-09-09 05:53:00,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-09 05:53:00,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:00,385 INFO L399 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-09 05:53:00,389 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:00,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:00,395 INFO L82 PathProgramCache]: Analyzing trace with hash 461476132, now seen corresponding path program 1 times [2019-09-09 05:53:00,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:00,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:00,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:00,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:00,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:00,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:00,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:00,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:00,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:00,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:00,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:00,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:00,779 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2019-09-09 05:53:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:00,887 INFO L93 Difference]: Finished difference Result 254 states and 414 transitions. [2019-09-09 05:53:00,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:00,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-09 05:53:00,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:00,903 INFO L225 Difference]: With dead ends: 254 [2019-09-09 05:53:00,903 INFO L226 Difference]: Without dead ends: 219 [2019-09-09 05:53:00,905 INFO L628 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-09 05:53:00,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-09 05:53:00,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2019-09-09 05:53:00,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-09 05:53:00,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2019-09-09 05:53:00,982 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 30 [2019-09-09 05:53:00,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:00,982 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2019-09-09 05:53:00,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:00,983 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2019-09-09 05:53:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-09 05:53:00,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:00,988 INFO L399 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-09 05:53:00,988 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:00,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:00,989 INFO L82 PathProgramCache]: Analyzing trace with hash -147745042, now seen corresponding path program 1 times [2019-09-09 05:53:00,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:00,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:00,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:00,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:00,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:01,157 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-09 05:53:01,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:01,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:01,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:01,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:01,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:01,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:01,164 INFO L87 Difference]: Start difference. First operand 219 states and 323 transitions. Second operand 3 states. [2019-09-09 05:53:01,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:01,226 INFO L93 Difference]: Finished difference Result 319 states and 470 transitions. [2019-09-09 05:53:01,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:01,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-09 05:53:01,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:01,229 INFO L225 Difference]: With dead ends: 319 [2019-09-09 05:53:01,230 INFO L226 Difference]: Without dead ends: 319 [2019-09-09 05:53:01,230 INFO L628 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-09 05:53:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-09 05:53:01,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2019-09-09 05:53:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-09 05:53:01,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 470 transitions. [2019-09-09 05:53:01,264 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 470 transitions. Word has length 45 [2019-09-09 05:53:01,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:01,265 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 470 transitions. [2019-09-09 05:53:01,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:01,265 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 470 transitions. [2019-09-09 05:53:01,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:53:01,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:01,269 INFO L399 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-09 05:53:01,269 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:01,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:01,270 INFO L82 PathProgramCache]: Analyzing trace with hash -389905176, now seen corresponding path program 1 times [2019-09-09 05:53:01,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:01,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:01,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:01,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:01,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:01,395 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-09 05:53:01,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:01,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:01,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:01,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:01,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:01,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:01,398 INFO L87 Difference]: Start difference. First operand 319 states and 470 transitions. Second operand 4 states. [2019-09-09 05:53:01,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:01,909 INFO L93 Difference]: Finished difference Result 505 states and 747 transitions. [2019-09-09 05:53:01,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:01,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:53:01,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:01,914 INFO L225 Difference]: With dead ends: 505 [2019-09-09 05:53:01,914 INFO L226 Difference]: Without dead ends: 505 [2019-09-09 05:53:01,915 INFO L628 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-09 05:53:01,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-09 05:53:01,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 369. [2019-09-09 05:53:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-09-09 05:53:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 556 transitions. [2019-09-09 05:53:01,947 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 556 transitions. Word has length 63 [2019-09-09 05:53:01,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:01,948 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 556 transitions. [2019-09-09 05:53:01,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:01,948 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 556 transitions. [2019-09-09 05:53:01,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:53:01,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:01,960 INFO L399 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-09 05:53:01,960 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:01,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:01,960 INFO L82 PathProgramCache]: Analyzing trace with hash -523918682, now seen corresponding path program 1 times [2019-09-09 05:53:01,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:01,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:01,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:01,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:01,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:02,110 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-09 05:53:02,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:02,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:02,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:02,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:02,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:02,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:02,112 INFO L87 Difference]: Start difference. First operand 369 states and 556 transitions. Second operand 4 states. [2019-09-09 05:53:02,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:02,419 INFO L93 Difference]: Finished difference Result 455 states and 682 transitions. [2019-09-09 05:53:02,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:02,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:53:02,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:02,422 INFO L225 Difference]: With dead ends: 455 [2019-09-09 05:53:02,423 INFO L226 Difference]: Without dead ends: 455 [2019-09-09 05:53:02,423 INFO L628 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-09 05:53:02,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-09 05:53:02,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 409. [2019-09-09 05:53:02,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-09-09 05:53:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 624 transitions. [2019-09-09 05:53:02,436 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 624 transitions. Word has length 63 [2019-09-09 05:53:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:02,436 INFO L475 AbstractCegarLoop]: Abstraction has 409 states and 624 transitions. [2019-09-09 05:53:02,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 624 transitions. [2019-09-09 05:53:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:53:02,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:02,438 INFO L399 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-09 05:53:02,439 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:02,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:02,439 INFO L82 PathProgramCache]: Analyzing trace with hash 793155671, now seen corresponding path program 1 times [2019-09-09 05:53:02,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:02,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:02,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:02,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:02,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:02,526 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-09 05:53:02,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:02,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:02,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:02,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:02,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:02,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:02,529 INFO L87 Difference]: Start difference. First operand 409 states and 624 transitions. Second operand 4 states. [2019-09-09 05:53:02,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:02,980 INFO L93 Difference]: Finished difference Result 537 states and 805 transitions. [2019-09-09 05:53:02,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:02,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-09 05:53:02,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:02,985 INFO L225 Difference]: With dead ends: 537 [2019-09-09 05:53:02,986 INFO L226 Difference]: Without dead ends: 537 [2019-09-09 05:53:02,986 INFO L628 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-09 05:53:02,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-09 05:53:02,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 411. [2019-09-09 05:53:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-09 05:53:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 626 transitions. [2019-09-09 05:53:02,999 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 626 transitions. Word has length 64 [2019-09-09 05:53:03,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:03,000 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 626 transitions. [2019-09-09 05:53:03,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:03,001 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 626 transitions. [2019-09-09 05:53:03,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-09 05:53:03,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:03,003 INFO L399 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-09 05:53:03,003 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:03,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:03,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1956758784, now seen corresponding path program 1 times [2019-09-09 05:53:03,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:03,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:03,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:03,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:03,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:03,108 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-09 05:53:03,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:03,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:03,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:03,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:03,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:03,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:03,115 INFO L87 Difference]: Start difference. First operand 411 states and 626 transitions. Second operand 4 states. [2019-09-09 05:53:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:03,549 INFO L93 Difference]: Finished difference Result 535 states and 801 transitions. [2019-09-09 05:53:03,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:03,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-09 05:53:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:03,553 INFO L225 Difference]: With dead ends: 535 [2019-09-09 05:53:03,553 INFO L226 Difference]: Without dead ends: 535 [2019-09-09 05:53:03,553 INFO L628 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-09 05:53:03,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-09 05:53:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-09 05:53:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-09 05:53:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 624 transitions. [2019-09-09 05:53:03,565 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 624 transitions. Word has length 77 [2019-09-09 05:53:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:03,565 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 624 transitions. [2019-09-09 05:53:03,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 624 transitions. [2019-09-09 05:53:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-09 05:53:03,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:03,567 INFO L399 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-09 05:53:03,567 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:03,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:03,568 INFO L82 PathProgramCache]: Analyzing trace with hash 847778338, now seen corresponding path program 1 times [2019-09-09 05:53:03,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:03,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:03,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:03,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:03,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:03,637 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-09 05:53:03,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:03,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:03,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:03,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:03,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:03,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:03,639 INFO L87 Difference]: Start difference. First operand 411 states and 624 transitions. Second operand 4 states. [2019-09-09 05:53:04,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:04,057 INFO L93 Difference]: Finished difference Result 535 states and 799 transitions. [2019-09-09 05:53:04,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:04,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-09 05:53:04,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:04,061 INFO L225 Difference]: With dead ends: 535 [2019-09-09 05:53:04,061 INFO L226 Difference]: Without dead ends: 535 [2019-09-09 05:53:04,062 INFO L628 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-09 05:53:04,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-09 05:53:04,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-09 05:53:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-09 05:53:04,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 622 transitions. [2019-09-09 05:53:04,072 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 622 transitions. Word has length 77 [2019-09-09 05:53:04,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:04,073 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 622 transitions. [2019-09-09 05:53:04,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:04,073 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 622 transitions. [2019-09-09 05:53:04,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-09 05:53:04,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:04,075 INFO L399 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-09 05:53:04,075 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:04,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:04,075 INFO L82 PathProgramCache]: Analyzing trace with hash 927399486, now seen corresponding path program 1 times [2019-09-09 05:53:04,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:04,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:04,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:04,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:04,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:04,154 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-09 05:53:04,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:04,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:04,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:04,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:04,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:04,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:04,157 INFO L87 Difference]: Start difference. First operand 411 states and 622 transitions. Second operand 4 states. [2019-09-09 05:53:04,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:04,431 INFO L93 Difference]: Finished difference Result 455 states and 676 transitions. [2019-09-09 05:53:04,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:04,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-09 05:53:04,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:04,438 INFO L225 Difference]: With dead ends: 455 [2019-09-09 05:53:04,438 INFO L226 Difference]: Without dead ends: 455 [2019-09-09 05:53:04,439 INFO L628 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-09 05:53:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-09 05:53:04,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-09 05:53:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-09 05:53:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 620 transitions. [2019-09-09 05:53:04,448 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 620 transitions. Word has length 77 [2019-09-09 05:53:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:04,449 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 620 transitions. [2019-09-09 05:53:04,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:04,449 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 620 transitions. [2019-09-09 05:53:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-09 05:53:04,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:04,450 INFO L399 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-09 05:53:04,451 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:04,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:04,451 INFO L82 PathProgramCache]: Analyzing trace with hash -181580960, now seen corresponding path program 1 times [2019-09-09 05:53:04,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:04,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:04,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:04,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:04,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:04,518 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-09 05:53:04,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:04,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:04,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:04,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:04,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:04,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:04,519 INFO L87 Difference]: Start difference. First operand 411 states and 620 transitions. Second operand 4 states. [2019-09-09 05:53:04,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:04,806 INFO L93 Difference]: Finished difference Result 455 states and 674 transitions. [2019-09-09 05:53:04,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:04,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-09 05:53:04,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:04,809 INFO L225 Difference]: With dead ends: 455 [2019-09-09 05:53:04,809 INFO L226 Difference]: Without dead ends: 455 [2019-09-09 05:53:04,809 INFO L628 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-09 05:53:04,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-09 05:53:04,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-09 05:53:04,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-09 05:53:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 618 transitions. [2019-09-09 05:53:04,822 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 618 transitions. Word has length 77 [2019-09-09 05:53:04,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:04,822 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 618 transitions. [2019-09-09 05:53:04,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 618 transitions. [2019-09-09 05:53:04,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-09 05:53:04,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:04,828 INFO L399 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-09 05:53:04,828 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:04,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:04,828 INFO L82 PathProgramCache]: Analyzing trace with hash 565717777, now seen corresponding path program 1 times [2019-09-09 05:53:04,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:04,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:04,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:04,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:04,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:04,912 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-09 05:53:04,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:04,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:04,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:04,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:04,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:04,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:04,914 INFO L87 Difference]: Start difference. First operand 411 states and 618 transitions. Second operand 4 states. [2019-09-09 05:53:05,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:05,436 INFO L93 Difference]: Finished difference Result 535 states and 793 transitions. [2019-09-09 05:53:05,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:05,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-09 05:53:05,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:05,440 INFO L225 Difference]: With dead ends: 535 [2019-09-09 05:53:05,440 INFO L226 Difference]: Without dead ends: 535 [2019-09-09 05:53:05,441 INFO L628 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-09 05:53:05,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-09 05:53:05,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-09 05:53:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-09 05:53:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 616 transitions. [2019-09-09 05:53:05,455 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 616 transitions. Word has length 78 [2019-09-09 05:53:05,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:05,456 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 616 transitions. [2019-09-09 05:53:05,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 616 transitions. [2019-09-09 05:53:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-09 05:53:05,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:05,458 INFO L399 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-09 05:53:05,459 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:05,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:05,459 INFO L82 PathProgramCache]: Analyzing trace with hash 865778860, now seen corresponding path program 1 times [2019-09-09 05:53:05,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:05,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:05,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:05,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:05,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:05,560 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-09 05:53:05,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:05,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:05,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:05,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:05,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:05,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:05,562 INFO L87 Difference]: Start difference. First operand 411 states and 616 transitions. Second operand 4 states. [2019-09-09 05:53:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:05,949 INFO L93 Difference]: Finished difference Result 535 states and 791 transitions. [2019-09-09 05:53:05,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:05,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-09 05:53:05,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:05,954 INFO L225 Difference]: With dead ends: 535 [2019-09-09 05:53:05,954 INFO L226 Difference]: Without dead ends: 535 [2019-09-09 05:53:05,954 INFO L628 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-09 05:53:05,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-09 05:53:05,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-09 05:53:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-09 05:53:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 614 transitions. [2019-09-09 05:53:05,964 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 614 transitions. Word has length 78 [2019-09-09 05:53:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:05,965 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 614 transitions. [2019-09-09 05:53:05,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 614 transitions. [2019-09-09 05:53:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-09 05:53:05,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:05,966 INFO L399 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-09 05:53:05,967 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:05,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:05,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1279649389, now seen corresponding path program 1 times [2019-09-09 05:53:05,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:05,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:05,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:05,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:05,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:06,037 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-09 05:53:06,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:06,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:06,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:06,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:06,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:06,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:06,040 INFO L87 Difference]: Start difference. First operand 411 states and 614 transitions. Second operand 4 states. [2019-09-09 05:53:06,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:06,326 INFO L93 Difference]: Finished difference Result 455 states and 668 transitions. [2019-09-09 05:53:06,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:06,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-09 05:53:06,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:06,328 INFO L225 Difference]: With dead ends: 455 [2019-09-09 05:53:06,329 INFO L226 Difference]: Without dead ends: 455 [2019-09-09 05:53:06,329 INFO L628 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-09 05:53:06,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-09 05:53:06,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-09 05:53:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-09 05:53:06,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 612 transitions. [2019-09-09 05:53:06,338 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 612 transitions. Word has length 78 [2019-09-09 05:53:06,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:06,338 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 612 transitions. [2019-09-09 05:53:06,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:06,339 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 612 transitions. [2019-09-09 05:53:06,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-09 05:53:06,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:06,340 INFO L399 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-09 05:53:06,340 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:06,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:06,341 INFO L82 PathProgramCache]: Analyzing trace with hash -979588306, now seen corresponding path program 1 times [2019-09-09 05:53:06,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:06,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:06,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:06,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:06,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:06,410 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-09 05:53:06,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:06,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:06,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:06,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:06,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:06,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:06,412 INFO L87 Difference]: Start difference. First operand 411 states and 612 transitions. Second operand 4 states. [2019-09-09 05:53:06,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:06,665 INFO L93 Difference]: Finished difference Result 455 states and 666 transitions. [2019-09-09 05:53:06,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:06,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-09 05:53:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:06,667 INFO L225 Difference]: With dead ends: 455 [2019-09-09 05:53:06,668 INFO L226 Difference]: Without dead ends: 455 [2019-09-09 05:53:06,668 INFO L628 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-09 05:53:06,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-09 05:53:06,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-09 05:53:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-09 05:53:06,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 610 transitions. [2019-09-09 05:53:06,677 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 610 transitions. Word has length 78 [2019-09-09 05:53:06,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:06,677 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 610 transitions. [2019-09-09 05:53:06,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:06,677 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 610 transitions. [2019-09-09 05:53:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:53:06,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:06,679 INFO L399 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-09 05:53:06,679 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:06,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:06,679 INFO L82 PathProgramCache]: Analyzing trace with hash 468355613, now seen corresponding path program 1 times [2019-09-09 05:53:06,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:06,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:06,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:06,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:06,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:06,769 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-09 05:53:06,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:06,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:06,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:06,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:06,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:06,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:06,770 INFO L87 Difference]: Start difference. First operand 411 states and 610 transitions. Second operand 4 states. [2019-09-09 05:53:07,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:07,180 INFO L93 Difference]: Finished difference Result 535 states and 785 transitions. [2019-09-09 05:53:07,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:07,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-09 05:53:07,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:07,184 INFO L225 Difference]: With dead ends: 535 [2019-09-09 05:53:07,184 INFO L226 Difference]: Without dead ends: 535 [2019-09-09 05:53:07,184 INFO L628 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-09 05:53:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-09 05:53:07,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-09 05:53:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-09 05:53:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 608 transitions. [2019-09-09 05:53:07,195 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 608 transitions. Word has length 79 [2019-09-09 05:53:07,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:07,195 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 608 transitions. [2019-09-09 05:53:07,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:07,196 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 608 transitions. [2019-09-09 05:53:07,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:53:07,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:07,197 INFO L399 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-09 05:53:07,197 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:07,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:07,198 INFO L82 PathProgramCache]: Analyzing trace with hash -821622051, now seen corresponding path program 1 times [2019-09-09 05:53:07,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:07,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:07,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:07,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:07,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:07,281 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-09 05:53:07,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:07,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:07,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:07,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:07,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:07,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:07,282 INFO L87 Difference]: Start difference. First operand 411 states and 608 transitions. Second operand 4 states. [2019-09-09 05:53:07,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:07,693 INFO L93 Difference]: Finished difference Result 529 states and 776 transitions. [2019-09-09 05:53:07,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:07,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-09 05:53:07,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:07,702 INFO L225 Difference]: With dead ends: 529 [2019-09-09 05:53:07,702 INFO L226 Difference]: Without dead ends: 529 [2019-09-09 05:53:07,702 INFO L628 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-09 05:53:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-09 05:53:07,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 411. [2019-09-09 05:53:07,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-09 05:53:07,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 606 transitions. [2019-09-09 05:53:07,711 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 606 transitions. Word has length 79 [2019-09-09 05:53:07,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:07,712 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 606 transitions. [2019-09-09 05:53:07,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:07,712 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 606 transitions. [2019-09-09 05:53:07,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:53:07,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:07,713 INFO L399 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-09 05:53:07,714 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:07,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:07,714 INFO L82 PathProgramCache]: Analyzing trace with hash -903451685, now seen corresponding path program 1 times [2019-09-09 05:53:07,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:07,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:07,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:07,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:07,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:07,791 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-09 05:53:07,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:07,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:07,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:07,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:07,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:07,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:07,795 INFO L87 Difference]: Start difference. First operand 411 states and 606 transitions. Second operand 4 states. [2019-09-09 05:53:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:08,088 INFO L93 Difference]: Finished difference Result 455 states and 660 transitions. [2019-09-09 05:53:08,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:08,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-09 05:53:08,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:08,092 INFO L225 Difference]: With dead ends: 455 [2019-09-09 05:53:08,092 INFO L226 Difference]: Without dead ends: 455 [2019-09-09 05:53:08,092 INFO L628 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-09 05:53:08,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-09 05:53:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-09 05:53:08,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-09 05:53:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 604 transitions. [2019-09-09 05:53:08,102 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 604 transitions. Word has length 79 [2019-09-09 05:53:08,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:08,103 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 604 transitions. [2019-09-09 05:53:08,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:08,103 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 604 transitions. [2019-09-09 05:53:08,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:53:08,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:08,105 INFO L399 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-09 05:53:08,105 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:08,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:08,105 INFO L82 PathProgramCache]: Analyzing trace with hash 2101537947, now seen corresponding path program 1 times [2019-09-09 05:53:08,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:08,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:08,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:08,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:08,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:08,186 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-09 05:53:08,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:08,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:08,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:08,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:08,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:08,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:08,188 INFO L87 Difference]: Start difference. First operand 411 states and 604 transitions. Second operand 4 states. [2019-09-09 05:53:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:08,493 INFO L93 Difference]: Finished difference Result 449 states and 651 transitions. [2019-09-09 05:53:08,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:08,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-09 05:53:08,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:08,495 INFO L225 Difference]: With dead ends: 449 [2019-09-09 05:53:08,495 INFO L226 Difference]: Without dead ends: 449 [2019-09-09 05:53:08,495 INFO L628 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-09 05:53:08,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-09 05:53:08,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 411. [2019-09-09 05:53:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-09 05:53:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 602 transitions. [2019-09-09 05:53:08,502 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 602 transitions. Word has length 79 [2019-09-09 05:53:08,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:08,503 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 602 transitions. [2019-09-09 05:53:08,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:08,503 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 602 transitions. [2019-09-09 05:53:08,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:53:08,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:08,505 INFO L399 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-09 05:53:08,505 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:08,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:08,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1801676460, now seen corresponding path program 1 times [2019-09-09 05:53:08,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:08,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:08,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:08,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:08,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:08,563 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-09 05:53:08,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:08,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:08,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:08,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:08,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:08,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:08,565 INFO L87 Difference]: Start difference. First operand 411 states and 602 transitions. Second operand 4 states. [2019-09-09 05:53:08,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:08,904 INFO L93 Difference]: Finished difference Result 511 states and 748 transitions. [2019-09-09 05:53:08,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:08,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:53:08,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:08,908 INFO L225 Difference]: With dead ends: 511 [2019-09-09 05:53:08,908 INFO L226 Difference]: Without dead ends: 511 [2019-09-09 05:53:08,908 INFO L628 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-09 05:53:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-09 05:53:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 411. [2019-09-09 05:53:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-09 05:53:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 600 transitions. [2019-09-09 05:53:08,917 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 600 transitions. Word has length 80 [2019-09-09 05:53:08,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:08,917 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 600 transitions. [2019-09-09 05:53:08,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 600 transitions. [2019-09-09 05:53:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:53:08,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:08,919 INFO L399 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-09 05:53:08,919 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:08,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:08,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2069644114, now seen corresponding path program 1 times [2019-09-09 05:53:08,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:08,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:08,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:08,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:08,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:08,986 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-09 05:53:08,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:08,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:08,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:08,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:08,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:08,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:08,989 INFO L87 Difference]: Start difference. First operand 411 states and 600 transitions. Second operand 4 states. [2019-09-09 05:53:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:09,201 INFO L93 Difference]: Finished difference Result 431 states and 625 transitions. [2019-09-09 05:53:09,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:09,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:53:09,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:09,205 INFO L225 Difference]: With dead ends: 431 [2019-09-09 05:53:09,205 INFO L226 Difference]: Without dead ends: 431 [2019-09-09 05:53:09,205 INFO L628 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-09 05:53:09,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-09-09 05:53:09,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 411. [2019-09-09 05:53:09,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-09 05:53:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2019-09-09 05:53:09,213 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 80 [2019-09-09 05:53:09,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:09,214 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2019-09-09 05:53:09,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:09,214 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2019-09-09 05:53:09,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 05:53:09,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:09,215 INFO L399 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-09 05:53:09,216 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:09,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:09,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1190699097, now seen corresponding path program 1 times [2019-09-09 05:53:09,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:09,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:09,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:09,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:09,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:09,272 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-09 05:53:09,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:09,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:09,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:09,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:09,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:09,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:09,274 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand 4 states. [2019-09-09 05:53:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:09,615 INFO L93 Difference]: Finished difference Result 511 states and 744 transitions. [2019-09-09 05:53:09,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:09,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-09 05:53:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:09,619 INFO L225 Difference]: With dead ends: 511 [2019-09-09 05:53:09,619 INFO L226 Difference]: Without dead ends: 511 [2019-09-09 05:53:09,619 INFO L628 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-09 05:53:09,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-09 05:53:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 411. [2019-09-09 05:53:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-09 05:53:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 596 transitions. [2019-09-09 05:53:09,627 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 596 transitions. Word has length 81 [2019-09-09 05:53:09,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:09,628 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 596 transitions. [2019-09-09 05:53:09,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:09,628 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 596 transitions. [2019-09-09 05:53:09,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 05:53:09,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:09,629 INFO L399 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-09 05:53:09,630 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:09,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:09,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1438845591, now seen corresponding path program 1 times [2019-09-09 05:53:09,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:09,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:09,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:09,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:09,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:09,686 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-09 05:53:09,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:09,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:09,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:09,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:09,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:09,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:09,687 INFO L87 Difference]: Start difference. First operand 411 states and 596 transitions. Second operand 3 states. [2019-09-09 05:53:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:09,716 INFO L93 Difference]: Finished difference Result 560 states and 813 transitions. [2019-09-09 05:53:09,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:09,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-09 05:53:09,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:09,719 INFO L225 Difference]: With dead ends: 560 [2019-09-09 05:53:09,719 INFO L226 Difference]: Without dead ends: 560 [2019-09-09 05:53:09,720 INFO L628 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-09 05:53:09,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-09-09 05:53:09,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2019-09-09 05:53:09,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-09-09 05:53:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 813 transitions. [2019-09-09 05:53:09,752 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 813 transitions. Word has length 81 [2019-09-09 05:53:09,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:09,752 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 813 transitions. [2019-09-09 05:53:09,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:09,753 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 813 transitions. [2019-09-09 05:53:09,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-09 05:53:09,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:09,754 INFO L399 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-09 05:53:09,755 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:09,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:09,755 INFO L82 PathProgramCache]: Analyzing trace with hash 181906312, now seen corresponding path program 1 times [2019-09-09 05:53:09,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:09,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:09,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:09,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:09,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:09,805 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-09 05:53:09,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:09,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:09,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:09,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:09,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:09,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:09,807 INFO L87 Difference]: Start difference. First operand 560 states and 813 transitions. Second operand 3 states. [2019-09-09 05:53:09,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:09,837 INFO L93 Difference]: Finished difference Result 709 states and 1031 transitions. [2019-09-09 05:53:09,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:09,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-09 05:53:09,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:09,841 INFO L225 Difference]: With dead ends: 709 [2019-09-09 05:53:09,841 INFO L226 Difference]: Without dead ends: 709 [2019-09-09 05:53:09,842 INFO L628 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-09 05:53:09,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-09-09 05:53:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2019-09-09 05:53:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-09-09 05:53:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1031 transitions. [2019-09-09 05:53:09,857 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1031 transitions. Word has length 83 [2019-09-09 05:53:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:09,857 INFO L475 AbstractCegarLoop]: Abstraction has 709 states and 1031 transitions. [2019-09-09 05:53:09,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1031 transitions. [2019-09-09 05:53:09,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:53:09,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:09,859 INFO L399 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-09 05:53:09,859 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:09,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:09,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1980699707, now seen corresponding path program 1 times [2019-09-09 05:53:09,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:09,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:09,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:09,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:09,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:09,973 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-09 05:53:09,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:09,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:53:09,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:09,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:53:09,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:53:09,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:53:09,974 INFO L87 Difference]: Start difference. First operand 709 states and 1031 transitions. Second operand 6 states. [2019-09-09 05:53:10,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:10,443 INFO L93 Difference]: Finished difference Result 792 states and 1152 transitions. [2019-09-09 05:53:10,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:53:10,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2019-09-09 05:53:10,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:10,450 INFO L225 Difference]: With dead ends: 792 [2019-09-09 05:53:10,450 INFO L226 Difference]: Without dead ends: 792 [2019-09-09 05:53:10,451 INFO L628 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-09 05:53:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-09-09 05:53:10,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 717. [2019-09-09 05:53:10,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-09 05:53:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1044 transitions. [2019-09-09 05:53:10,464 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1044 transitions. Word has length 104 [2019-09-09 05:53:10,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:10,465 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1044 transitions. [2019-09-09 05:53:10,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:53:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1044 transitions. [2019-09-09 05:53:10,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:53:10,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:10,467 INFO L399 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-09 05:53:10,467 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:10,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:10,468 INFO L82 PathProgramCache]: Analyzing trace with hash 846329970, now seen corresponding path program 1 times [2019-09-09 05:53:10,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:10,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:10,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:10,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:10,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:10,583 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-09 05:53:10,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:10,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:53:10,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:10,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:53:10,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:53:10,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:53:10,588 INFO L87 Difference]: Start difference. First operand 717 states and 1044 transitions. Second operand 6 states. [2019-09-09 05:53:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:11,051 INFO L93 Difference]: Finished difference Result 789 states and 1148 transitions. [2019-09-09 05:53:11,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:53:11,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-09 05:53:11,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:11,058 INFO L225 Difference]: With dead ends: 789 [2019-09-09 05:53:11,058 INFO L226 Difference]: Without dead ends: 789 [2019-09-09 05:53:11,058 INFO L628 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-09 05:53:11,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-09-09 05:53:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 718. [2019-09-09 05:53:11,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-09-09 05:53:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1045 transitions. [2019-09-09 05:53:11,071 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1045 transitions. Word has length 105 [2019-09-09 05:53:11,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:11,071 INFO L475 AbstractCegarLoop]: Abstraction has 718 states and 1045 transitions. [2019-09-09 05:53:11,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:53:11,071 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1045 transitions. [2019-09-09 05:53:11,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-09 05:53:11,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:11,073 INFO L399 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-09 05:53:11,073 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:11,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:11,074 INFO L82 PathProgramCache]: Analyzing trace with hash 741178707, now seen corresponding path program 1 times [2019-09-09 05:53:11,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:11,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:11,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:11,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:11,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-09 05:53:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-09 05:53:11,800 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-09 05:53:11,863 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967296 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-09 05:53:11,864 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967294 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-09 05:53:11,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:53:11 BoogieIcfgContainer [2019-09-09 05:53:11,956 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:53:11,959 INFO L168 Benchmark]: Toolchain (without parser) took 14092.13 ms. Allocated memory was 141.6 MB in the beginning and 379.6 MB in the end (delta: 238.0 MB). Free memory was 86.9 MB in the beginning and 195.5 MB in the end (delta: -108.6 MB). Peak memory consumption was 129.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:53:11,960 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory was 107.7 MB in the beginning and 107.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:53:11,960 INFO L168 Benchmark]: CACSL2BoogieTranslator took 849.52 ms. Allocated memory was 141.6 MB in the beginning and 201.9 MB in the end (delta: 60.3 MB). Free memory was 86.7 MB in the beginning and 159.2 MB in the end (delta: -72.5 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:53:11,961 INFO L168 Benchmark]: Boogie Preprocessor took 164.17 ms. Allocated memory is still 201.9 MB. Free memory was 159.2 MB in the beginning and 151.8 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:53:11,967 INFO L168 Benchmark]: RCFGBuilder took 1368.31 ms. Allocated memory was 201.9 MB in the beginning and 230.2 MB in the end (delta: 28.3 MB). Free memory was 151.8 MB in the beginning and 175.3 MB in the end (delta: -23.5 MB). Peak memory consumption was 78.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:53:11,967 INFO L168 Benchmark]: TraceAbstraction took 11702.86 ms. Allocated memory was 230.2 MB in the beginning and 379.6 MB in the end (delta: 149.4 MB). Free memory was 175.3 MB in the beginning and 195.5 MB in the end (delta: -20.2 MB). Peak memory consumption was 129.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:53:11,977 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.21 ms. Allocated memory is still 141.6 MB. Free memory was 107.7 MB in the beginning and 107.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 849.52 ms. Allocated memory was 141.6 MB in the beginning and 201.9 MB in the end (delta: 60.3 MB). Free memory was 86.7 MB in the beginning and 159.2 MB in the end (delta: -72.5 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 164.17 ms. Allocated memory is still 201.9 MB. Free memory was 159.2 MB in the beginning and 151.8 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1368.31 ms. Allocated memory was 201.9 MB in the beginning and 230.2 MB in the end (delta: 28.3 MB). Free memory was 151.8 MB in the beginning and 175.3 MB in the end (delta: -23.5 MB). Peak memory consumption was 78.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11702.86 ms. Allocated memory was 230.2 MB in the beginning and 379.6 MB in the end (delta: 149.4 MB). Free memory was 175.3 MB in the beginning and 195.5 MB in the end (delta: -20.2 MB). Peak memory consumption was 129.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967296 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 4294967294 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)=4294967337, \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={-1: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={-1:0}, s={-1:0}, s->info_callback={4294967290:7}, skip=0, SSLv3_client_data={-3:0}, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, 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 [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=12292, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, 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 [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1249] EXPR s->version VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->version=2, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, 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 [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->init_buf={-4294967295:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, 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 [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, 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 [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={4294967290:7}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->s3={-1:-801}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, 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 [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, 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 [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->bbio={3:1}, s->wbio={-1:3}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, 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 [={4294967290:7}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->s3={-1:-801}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, 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 [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1320] COND FALSE !(ret <= 0) [L1325] s->hit VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->hit=0, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1325] COND FALSE !(s->hit) [L1328] s->state = 4400 VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1330] s->init_num = 0 VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={4294967290:7}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->s3={-1:-801}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, 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 [={4294967290:7}, ((s->s3)->tmp.new_cipher)->algorithms=4294967333, (s->s3)->tmp.new_cipher={4294967313:3}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->s3={-1:-801}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, 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 [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1347] COND FALSE !(ret <= 0) VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1353] s->state = 4416 [L1354] s->init_num = 0 VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={4294967290:7}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->s3={-1:-801}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, 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 [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1364] COND FALSE !(ret <= 0) [L1369] s->state = 4432 [L1370] s->init_num = 0 VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1371] COND FALSE !(! tmp___6) VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={4294967290:7}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->s3={-1:-801}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, 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 [={4294967290:7}, blastFlag=4, init=1, ret=3, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1643] __VERIFIER_error() VAL [={4294967290:7}, blastFlag=4, init=1, ret=3, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, 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, 11.6s OverallTime, 25 OverallIterations, 6 TraceHistogramMax, 7.7s 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.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 20 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s 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.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 1670 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s 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...