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_srvr.blast.03.i.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:17,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:17,810 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:17,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:17,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:17,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:17,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:17,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:17,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:17,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:17,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:17,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:17,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:17,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:17,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:17,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:17,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:17,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:17,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:17,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:17,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:17,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:17,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:17,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:17,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:17,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:17,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:17,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:17,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:17,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:17,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:17,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:17,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:17,859 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:17,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:17,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:17,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:17,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:17,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:17,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:17,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:17,864 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:27:17,879 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:17,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:17,880 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:17,880 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:17,881 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:17,881 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:17,881 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:17,881 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:17,882 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:17,882 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:17,882 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:17,883 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:17,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:17,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:17,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:17,883 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:17,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:17,884 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:17,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:17,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:17,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:17,885 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:17,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:17,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:17,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:17,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:17,886 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:17,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:17,886 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:17,886 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:17,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:17,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:17,932 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:17,934 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:17,934 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:17,935 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.03.i.cil.c [2019-09-20 13:27:18,000 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2789f19/73e7ddc6caf94c0d8ceb6cfc0d96dfea/FLAGdc8c48b77 [2019-09-20 13:27:18,603 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:18,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.03.i.cil.c [2019-09-20 13:27:18,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2789f19/73e7ddc6caf94c0d8ceb6cfc0d96dfea/FLAGdc8c48b77 [2019-09-20 13:27:18,801 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2789f19/73e7ddc6caf94c0d8ceb6cfc0d96dfea [2019-09-20 13:27:18,810 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:18,812 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:18,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:18,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:18,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:18,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:18" (1/1) ... [2019-09-20 13:27:18,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@573dfd90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:18, skipping insertion in model container [2019-09-20 13:27:18,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:18" (1/1) ... [2019-09-20 13:27:18,829 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:18,898 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:19,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:19,548 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:19,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:19,748 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:19,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:19 WrapperNode [2019-09-20 13:27:19,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:19,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:19,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:19,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:19,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:19" (1/1) ... [2019-09-20 13:27:19,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:19" (1/1) ... [2019-09-20 13:27:19,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:19" (1/1) ... [2019-09-20 13:27:19,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:19" (1/1) ... [2019-09-20 13:27:19,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:19" (1/1) ... [2019-09-20 13:27:19,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:19" (1/1) ... [2019-09-20 13:27:19,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:19" (1/1) ... [2019-09-20 13:27:19,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:19,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:19,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:19,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:19,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:20,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:20,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:20,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:27:20,064 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:27:20,064 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:20,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:27:20,065 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:20,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:20,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:20,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:20,067 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:20,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:20,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:20,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:20,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:20,071 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:20,072 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:27:20,072 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:20,072 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:27:20,072 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:27:20,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:20,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:20,073 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:20,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:20,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:20,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:20,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:20,076 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:20,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:20,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:20,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:20,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:20,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:20,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:20,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:20,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:20,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:20,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:20,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:20,852 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:21,751 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:27:21,752 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:27:21,784 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:21,784 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:21,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:21 BoogieIcfgContainer [2019-09-20 13:27:21,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:21,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:21,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:21,791 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:21,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:18" (1/3) ... [2019-09-20 13:27:21,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521d7e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:21, skipping insertion in model container [2019-09-20 13:27:21,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:19" (2/3) ... [2019-09-20 13:27:21,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521d7e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:21, skipping insertion in model container [2019-09-20 13:27:21,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:21" (3/3) ... [2019-09-20 13:27:21,795 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2019-09-20 13:27:21,805 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:21,817 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:21,833 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:21,862 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:21,862 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:21,862 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:21,863 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:21,863 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:21,863 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:21,863 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:21,863 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:21,883 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-09-20 13:27:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:27:21,898 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:21,899 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:21,901 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:21,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:21,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1166562444, now seen corresponding path program 1 times [2019-09-20 13:27:21,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:21,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:21,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:22,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:22,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:22,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:22,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:22,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:22,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:22,389 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 4 states. [2019-09-20 13:27:22,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:22,882 INFO L93 Difference]: Finished difference Result 185 states and 300 transitions. [2019-09-20 13:27:22,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:22,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-09-20 13:27:22,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:22,905 INFO L225 Difference]: With dead ends: 185 [2019-09-20 13:27:22,905 INFO L226 Difference]: Without dead ends: 164 [2019-09-20 13:27:22,909 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:22,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-20 13:27:22,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2019-09-20 13:27:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-20 13:27:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 222 transitions. [2019-09-20 13:27:22,988 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 222 transitions. Word has length 51 [2019-09-20 13:27:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:22,988 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 222 transitions. [2019-09-20 13:27:22,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2019-09-20 13:27:22,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:22,992 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:22,992 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:22,993 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:22,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:22,994 INFO L82 PathProgramCache]: Analyzing trace with hash -473766945, now seen corresponding path program 1 times [2019-09-20 13:27:22,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:22,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:23,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:23,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:23,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:23,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:23,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:23,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:23,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:23,208 INFO L87 Difference]: Start difference. First operand 147 states and 222 transitions. Second operand 4 states. [2019-09-20 13:27:23,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:23,616 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2019-09-20 13:27:23,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:23,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:23,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:23,619 INFO L225 Difference]: With dead ends: 164 [2019-09-20 13:27:23,619 INFO L226 Difference]: Without dead ends: 164 [2019-09-20 13:27:23,623 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:23,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-20 13:27:23,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2019-09-20 13:27:23,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-20 13:27:23,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 221 transitions. [2019-09-20 13:27:23,637 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 221 transitions. Word has length 64 [2019-09-20 13:27:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:23,638 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 221 transitions. [2019-09-20 13:27:23,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:23,638 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 221 transitions. [2019-09-20 13:27:23,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:23,641 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:23,641 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:23,641 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:23,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:23,642 INFO L82 PathProgramCache]: Analyzing trace with hash -632715509, now seen corresponding path program 1 times [2019-09-20 13:27:23,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:23,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:23,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:23,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:23,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:23,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:23,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:23,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:23,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:23,775 INFO L87 Difference]: Start difference. First operand 147 states and 221 transitions. Second operand 4 states. [2019-09-20 13:27:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:24,123 INFO L93 Difference]: Finished difference Result 163 states and 240 transitions. [2019-09-20 13:27:24,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:24,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:24,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:24,126 INFO L225 Difference]: With dead ends: 163 [2019-09-20 13:27:24,126 INFO L226 Difference]: Without dead ends: 163 [2019-09-20 13:27:24,127 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:24,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-20 13:27:24,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 147. [2019-09-20 13:27:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-20 13:27:24,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 220 transitions. [2019-09-20 13:27:24,138 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 220 transitions. Word has length 65 [2019-09-20 13:27:24,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:24,138 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 220 transitions. [2019-09-20 13:27:24,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:24,138 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 220 transitions. [2019-09-20 13:27:24,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:24,141 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:24,141 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:24,142 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:24,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:24,142 INFO L82 PathProgramCache]: Analyzing trace with hash 205295263, now seen corresponding path program 1 times [2019-09-20 13:27:24,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:24,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:24,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:24,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:24,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:24,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:27:24,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:24,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:27:24,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:27:24,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:24,303 INFO L87 Difference]: Start difference. First operand 147 states and 220 transitions. Second operand 5 states. [2019-09-20 13:27:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:24,820 INFO L93 Difference]: Finished difference Result 168 states and 248 transitions. [2019-09-20 13:27:24,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:24,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-09-20 13:27:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:24,824 INFO L225 Difference]: With dead ends: 168 [2019-09-20 13:27:24,825 INFO L226 Difference]: Without dead ends: 168 [2019-09-20 13:27:24,825 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:27:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-20 13:27:24,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-09-20 13:27:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:24,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 247 transitions. [2019-09-20 13:27:24,850 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 247 transitions. Word has length 65 [2019-09-20 13:27:24,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:24,851 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 247 transitions. [2019-09-20 13:27:24,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:27:24,851 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2019-09-20 13:27:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:24,853 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:24,854 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:24,854 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:24,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:24,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1514304937, now seen corresponding path program 1 times [2019-09-20 13:27:24,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:24,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:24,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:24,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:24,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:24,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:24,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:24,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:24,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:24,995 INFO L87 Difference]: Start difference. First operand 167 states and 247 transitions. Second operand 4 states. [2019-09-20 13:27:25,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:25,310 INFO L93 Difference]: Finished difference Result 182 states and 264 transitions. [2019-09-20 13:27:25,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:25,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:25,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:25,314 INFO L225 Difference]: With dead ends: 182 [2019-09-20 13:27:25,314 INFO L226 Difference]: Without dead ends: 182 [2019-09-20 13:27:25,315 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:25,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-20 13:27:25,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 167. [2019-09-20 13:27:25,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 246 transitions. [2019-09-20 13:27:25,322 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 246 transitions. Word has length 65 [2019-09-20 13:27:25,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:25,323 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 246 transitions. [2019-09-20 13:27:25,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 246 transitions. [2019-09-20 13:27:25,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:25,324 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:25,324 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:25,324 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:25,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:25,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2014956458, now seen corresponding path program 1 times [2019-09-20 13:27:25,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:25,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:25,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:25,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:25,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:25,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:25,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:25,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:25,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:25,414 INFO L87 Difference]: Start difference. First operand 167 states and 246 transitions. Second operand 4 states. [2019-09-20 13:27:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:25,718 INFO L93 Difference]: Finished difference Result 180 states and 261 transitions. [2019-09-20 13:27:25,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:25,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:25,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:25,721 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:27:25,721 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:27:25,722 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:27:25,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-20 13:27:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 245 transitions. [2019-09-20 13:27:25,729 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 245 transitions. Word has length 65 [2019-09-20 13:27:25,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:25,729 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 245 transitions. [2019-09-20 13:27:25,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:25,729 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2019-09-20 13:27:25,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:27:25,730 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:25,730 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:25,731 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:25,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:25,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1446540060, now seen corresponding path program 1 times [2019-09-20 13:27:25,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:25,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:25,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:25,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:25,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:25,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:25,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:25,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:25,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:25,828 INFO L87 Difference]: Start difference. First operand 167 states and 245 transitions. Second operand 4 states. [2019-09-20 13:27:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,096 INFO L93 Difference]: Finished difference Result 180 states and 260 transitions. [2019-09-20 13:27:26,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:26,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:27:26,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,098 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:27:26,098 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:27:26,099 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:26,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:27:26,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-20 13:27:26,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 244 transitions. [2019-09-20 13:27:26,105 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 244 transitions. Word has length 66 [2019-09-20 13:27:26,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,106 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 244 transitions. [2019-09-20 13:27:26,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:26,106 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 244 transitions. [2019-09-20 13:27:26,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:27:26,107 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:26,107 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:26,108 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:26,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1970000659, now seen corresponding path program 1 times [2019-09-20 13:27:26,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:26,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:26,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:26,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:26,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:26,165 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:26,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:26,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:26,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:26,166 INFO L87 Difference]: Start difference. First operand 167 states and 244 transitions. Second operand 4 states. [2019-09-20 13:27:26,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,490 INFO L93 Difference]: Finished difference Result 180 states and 259 transitions. [2019-09-20 13:27:26,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:26,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-20 13:27:26,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,492 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:27:26,492 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:27:26,493 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:26,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:27:26,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-20 13:27:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:26,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 243 transitions. [2019-09-20 13:27:26,500 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 243 transitions. Word has length 67 [2019-09-20 13:27:26,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,501 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 243 transitions. [2019-09-20 13:27:26,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:26,501 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 243 transitions. [2019-09-20 13:27:26,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-20 13:27:26,502 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:26,502 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:26,503 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:26,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,503 INFO L82 PathProgramCache]: Analyzing trace with hash -185290601, now seen corresponding path program 1 times [2019-09-20 13:27:26,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:26,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:26,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:26,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:26,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:26,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:26,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:26,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:26,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:26,569 INFO L87 Difference]: Start difference. First operand 167 states and 243 transitions. Second operand 4 states. [2019-09-20 13:27:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,841 INFO L93 Difference]: Finished difference Result 180 states and 258 transitions. [2019-09-20 13:27:26,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:26,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-20 13:27:26,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,843 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:27:26,843 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:27:26,844 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:27:26,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-20 13:27:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 242 transitions. [2019-09-20 13:27:26,849 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 242 transitions. Word has length 68 [2019-09-20 13:27:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,850 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 242 transitions. [2019-09-20 13:27:26,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 242 transitions. [2019-09-20 13:27:26,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-20 13:27:26,851 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:26,851 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:26,852 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:26,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,852 INFO L82 PathProgramCache]: Analyzing trace with hash 675851062, now seen corresponding path program 1 times [2019-09-20 13:27:26,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:26,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:26,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:26,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:26,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:26,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:26,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:26,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:26,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:26,917 INFO L87 Difference]: Start difference. First operand 167 states and 242 transitions. Second operand 4 states. [2019-09-20 13:27:27,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:27,215 INFO L93 Difference]: Finished difference Result 209 states and 304 transitions. [2019-09-20 13:27:27,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:27,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-20 13:27:27,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:27,218 INFO L225 Difference]: With dead ends: 209 [2019-09-20 13:27:27,218 INFO L226 Difference]: Without dead ends: 209 [2019-09-20 13:27:27,218 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-20 13:27:27,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 189. [2019-09-20 13:27:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:27,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 279 transitions. [2019-09-20 13:27:27,226 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 279 transitions. Word has length 68 [2019-09-20 13:27:27,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:27,226 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 279 transitions. [2019-09-20 13:27:27,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:27,227 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 279 transitions. [2019-09-20 13:27:27,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-20 13:27:27,228 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:27,228 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:27,228 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:27,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:27,229 INFO L82 PathProgramCache]: Analyzing trace with hash 517456430, now seen corresponding path program 1 times [2019-09-20 13:27:27,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:27,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:27,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:27,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:27,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:27,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:27,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:27,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:27,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,303 INFO L87 Difference]: Start difference. First operand 189 states and 279 transitions. Second operand 4 states. [2019-09-20 13:27:27,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:27,560 INFO L93 Difference]: Finished difference Result 192 states and 282 transitions. [2019-09-20 13:27:27,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:27,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-20 13:27:27,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:27,562 INFO L225 Difference]: With dead ends: 192 [2019-09-20 13:27:27,562 INFO L226 Difference]: Without dead ends: 192 [2019-09-20 13:27:27,563 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:27,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-20 13:27:27,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2019-09-20 13:27:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 278 transitions. [2019-09-20 13:27:27,569 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 278 transitions. Word has length 69 [2019-09-20 13:27:27,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:27,569 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 278 transitions. [2019-09-20 13:27:27,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:27,570 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 278 transitions. [2019-09-20 13:27:27,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:27,571 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:27,571 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:27,571 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:27,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:27,572 INFO L82 PathProgramCache]: Analyzing trace with hash -133811851, now seen corresponding path program 1 times [2019-09-20 13:27:27,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:27,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:27,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:27,648 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:27,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:27,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:27,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:27,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:27,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:27,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,651 INFO L87 Difference]: Start difference. First operand 189 states and 278 transitions. Second operand 4 states. [2019-09-20 13:27:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:27,963 INFO L93 Difference]: Finished difference Result 209 states and 302 transitions. [2019-09-20 13:27:27,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:27,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:27,966 INFO L225 Difference]: With dead ends: 209 [2019-09-20 13:27:27,966 INFO L226 Difference]: Without dead ends: 209 [2019-09-20 13:27:27,966 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:27,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-20 13:27:27,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 189. [2019-09-20 13:27:27,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 277 transitions. [2019-09-20 13:27:27,972 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 277 transitions. Word has length 81 [2019-09-20 13:27:27,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:27,972 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 277 transitions. [2019-09-20 13:27:27,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 277 transitions. [2019-09-20 13:27:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:27:27,974 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:27,974 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:27,974 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:27,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:27,975 INFO L82 PathProgramCache]: Analyzing trace with hash 434368385, now seen corresponding path program 1 times [2019-09-20 13:27:27,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:27,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:27,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:28,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:28,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:28,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:28,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:28,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:28,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:28,064 INFO L87 Difference]: Start difference. First operand 189 states and 277 transitions. Second operand 4 states. [2019-09-20 13:27:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:28,356 INFO L93 Difference]: Finished difference Result 208 states and 300 transitions. [2019-09-20 13:27:28,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:28,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:27:28,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:28,358 INFO L225 Difference]: With dead ends: 208 [2019-09-20 13:27:28,358 INFO L226 Difference]: Without dead ends: 208 [2019-09-20 13:27:28,359 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:28,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-20 13:27:28,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 189. [2019-09-20 13:27:28,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 276 transitions. [2019-09-20 13:27:28,365 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 276 transitions. Word has length 82 [2019-09-20 13:27:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:28,365 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 276 transitions. [2019-09-20 13:27:28,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 276 transitions. [2019-09-20 13:27:28,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:27:28,367 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:28,367 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:28,367 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:28,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:28,368 INFO L82 PathProgramCache]: Analyzing trace with hash -66283136, now seen corresponding path program 1 times [2019-09-20 13:27:28,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:28,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:28,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:28,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:28,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:28,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:28,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:28,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:28,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:28,428 INFO L87 Difference]: Start difference. First operand 189 states and 276 transitions. Second operand 4 states. [2019-09-20 13:27:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:28,717 INFO L93 Difference]: Finished difference Result 206 states and 297 transitions. [2019-09-20 13:27:28,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:28,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:27:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:28,719 INFO L225 Difference]: With dead ends: 206 [2019-09-20 13:27:28,719 INFO L226 Difference]: Without dead ends: 206 [2019-09-20 13:27:28,720 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:28,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-20 13:27:28,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2019-09-20 13:27:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 275 transitions. [2019-09-20 13:27:28,726 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 275 transitions. Word has length 82 [2019-09-20 13:27:28,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:28,726 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 275 transitions. [2019-09-20 13:27:28,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:28,726 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 275 transitions. [2019-09-20 13:27:28,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:27:28,727 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:28,728 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:28,728 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:28,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:28,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1725870898, now seen corresponding path program 1 times [2019-09-20 13:27:28,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:28,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:28,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:28,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:28,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:28,792 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:28,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:28,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:28,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:28,793 INFO L87 Difference]: Start difference. First operand 189 states and 275 transitions. Second operand 4 states. [2019-09-20 13:27:29,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:29,131 INFO L93 Difference]: Finished difference Result 206 states and 296 transitions. [2019-09-20 13:27:29,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:29,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-20 13:27:29,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:29,133 INFO L225 Difference]: With dead ends: 206 [2019-09-20 13:27:29,134 INFO L226 Difference]: Without dead ends: 206 [2019-09-20 13:27:29,134 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-20 13:27:29,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2019-09-20 13:27:29,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 274 transitions. [2019-09-20 13:27:29,141 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 274 transitions. Word has length 83 [2019-09-20 13:27:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:29,142 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 274 transitions. [2019-09-20 13:27:29,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 274 transitions. [2019-09-20 13:27:29,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-20 13:27:29,144 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:29,144 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:29,145 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:29,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:29,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2039322045, now seen corresponding path program 1 times [2019-09-20 13:27:29,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:29,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:29,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:29,238 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:29,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:29,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:29,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:29,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:29,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:29,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,244 INFO L87 Difference]: Start difference. First operand 189 states and 274 transitions. Second operand 4 states. [2019-09-20 13:27:29,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:29,577 INFO L93 Difference]: Finished difference Result 206 states and 295 transitions. [2019-09-20 13:27:29,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:29,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-20 13:27:29,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:29,580 INFO L225 Difference]: With dead ends: 206 [2019-09-20 13:27:29,580 INFO L226 Difference]: Without dead ends: 206 [2019-09-20 13:27:29,580 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-20 13:27:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2019-09-20 13:27:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 273 transitions. [2019-09-20 13:27:29,586 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 273 transitions. Word has length 84 [2019-09-20 13:27:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:29,587 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 273 transitions. [2019-09-20 13:27:29,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 273 transitions. [2019-09-20 13:27:29,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-20 13:27:29,588 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:29,588 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:29,589 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:29,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:29,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1963672365, now seen corresponding path program 1 times [2019-09-20 13:27:29,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:29,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:29,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:29,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:29,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:29,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:29,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:29,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:29,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,652 INFO L87 Difference]: Start difference. First operand 189 states and 273 transitions. Second operand 4 states. [2019-09-20 13:27:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:29,980 INFO L93 Difference]: Finished difference Result 206 states and 294 transitions. [2019-09-20 13:27:29,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:29,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-20 13:27:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:29,983 INFO L225 Difference]: With dead ends: 206 [2019-09-20 13:27:29,983 INFO L226 Difference]: Without dead ends: 206 [2019-09-20 13:27:29,984 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:29,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-20 13:27:29,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2019-09-20 13:27:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:29,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 272 transitions. [2019-09-20 13:27:29,992 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 272 transitions. Word has length 85 [2019-09-20 13:27:29,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:29,992 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 272 transitions. [2019-09-20 13:27:29,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 272 transitions. [2019-09-20 13:27:29,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-20 13:27:29,994 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:29,994 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:29,995 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:29,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:29,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1584168360, now seen corresponding path program 1 times [2019-09-20 13:27:29,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:29,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:29,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:30,079 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:30,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:30,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:30,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:30,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:30,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:30,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,081 INFO L87 Difference]: Start difference. First operand 189 states and 272 transitions. Second operand 4 states. [2019-09-20 13:27:30,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:30,337 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2019-09-20 13:27:30,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:30,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-20 13:27:30,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:30,339 INFO L225 Difference]: With dead ends: 196 [2019-09-20 13:27:30,339 INFO L226 Difference]: Without dead ends: 196 [2019-09-20 13:27:30,339 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-20 13:27:30,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 189. [2019-09-20 13:27:30,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 271 transitions. [2019-09-20 13:27:30,345 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 271 transitions. Word has length 86 [2019-09-20 13:27:30,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:30,346 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 271 transitions. [2019-09-20 13:27:30,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:30,346 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 271 transitions. [2019-09-20 13:27:30,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-20 13:27:30,347 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:30,347 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:30,347 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:30,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:30,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1395812816, now seen corresponding path program 1 times [2019-09-20 13:27:30,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:30,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:30,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:30,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:30,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:30,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:30,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:30,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:30,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,445 INFO L87 Difference]: Start difference. First operand 189 states and 271 transitions. Second operand 4 states. [2019-09-20 13:27:30,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:30,994 INFO L93 Difference]: Finished difference Result 284 states and 416 transitions. [2019-09-20 13:27:30,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:30,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-20 13:27:30,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:30,998 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:27:30,998 INFO L226 Difference]: Without dead ends: 284 [2019-09-20 13:27:31,001 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:31,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-20 13:27:31,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 232. [2019-09-20 13:27:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-20 13:27:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 348 transitions. [2019-09-20 13:27:31,011 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 348 transitions. Word has length 90 [2019-09-20 13:27:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:31,012 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 348 transitions. [2019-09-20 13:27:31,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 348 transitions. [2019-09-20 13:27:31,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-20 13:27:31,014 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:31,014 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:31,015 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:31,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:31,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2001761202, now seen corresponding path program 1 times [2019-09-20 13:27:31,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:31,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:31,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:31,110 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:31,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:31,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:31,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:31,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:31,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:31,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:31,112 INFO L87 Difference]: Start difference. First operand 232 states and 348 transitions. Second operand 4 states. [2019-09-20 13:27:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:31,423 INFO L93 Difference]: Finished difference Result 280 states and 419 transitions. [2019-09-20 13:27:31,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:31,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-20 13:27:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:31,425 INFO L225 Difference]: With dead ends: 280 [2019-09-20 13:27:31,426 INFO L226 Difference]: Without dead ends: 280 [2019-09-20 13:27:31,426 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:31,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-20 13:27:31,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2019-09-20 13:27:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 389 transitions. [2019-09-20 13:27:31,433 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 389 transitions. Word has length 90 [2019-09-20 13:27:31,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:31,433 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 389 transitions. [2019-09-20 13:27:31,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 389 transitions. [2019-09-20 13:27:31,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:31,435 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:31,435 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:31,435 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:31,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:31,436 INFO L82 PathProgramCache]: Analyzing trace with hash 920939707, now seen corresponding path program 1 times [2019-09-20 13:27:31,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:31,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:31,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:31,540 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:31,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:31,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:31,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:31,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:31,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:31,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:31,543 INFO L87 Difference]: Start difference. First operand 256 states and 389 transitions. Second operand 4 states. [2019-09-20 13:27:32,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:32,010 INFO L93 Difference]: Finished difference Result 308 states and 456 transitions. [2019-09-20 13:27:32,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:32,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:32,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:32,013 INFO L225 Difference]: With dead ends: 308 [2019-09-20 13:27:32,013 INFO L226 Difference]: Without dead ends: 308 [2019-09-20 13:27:32,014 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:32,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-20 13:27:32,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 256. [2019-09-20 13:27:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 388 transitions. [2019-09-20 13:27:32,023 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 388 transitions. Word has length 103 [2019-09-20 13:27:32,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:32,023 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 388 transitions. [2019-09-20 13:27:32,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 388 transitions. [2019-09-20 13:27:32,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:32,025 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:32,025 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:32,025 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:32,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:32,026 INFO L82 PathProgramCache]: Analyzing trace with hash 961614457, now seen corresponding path program 1 times [2019-09-20 13:27:32,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:32,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:32,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:32,107 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:32,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:32,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:32,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:32,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:32,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:32,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:32,109 INFO L87 Difference]: Start difference. First operand 256 states and 388 transitions. Second operand 4 states. [2019-09-20 13:27:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:32,472 INFO L93 Difference]: Finished difference Result 280 states and 417 transitions. [2019-09-20 13:27:32,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:32,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:32,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:32,477 INFO L225 Difference]: With dead ends: 280 [2019-09-20 13:27:32,477 INFO L226 Difference]: Without dead ends: 280 [2019-09-20 13:27:32,478 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:32,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-20 13:27:32,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2019-09-20 13:27:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 387 transitions. [2019-09-20 13:27:32,486 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 387 transitions. Word has length 103 [2019-09-20 13:27:32,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:32,487 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 387 transitions. [2019-09-20 13:27:32,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 387 transitions. [2019-09-20 13:27:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:32,489 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:32,489 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:32,489 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:32,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:32,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1228071685, now seen corresponding path program 1 times [2019-09-20 13:27:32,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:32,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:32,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:32,570 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:32,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:32,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:32,570 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:32,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:32,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:32,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:32,571 INFO L87 Difference]: Start difference. First operand 256 states and 387 transitions. Second operand 4 states. [2019-09-20 13:27:33,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:33,012 INFO L93 Difference]: Finished difference Result 307 states and 453 transitions. [2019-09-20 13:27:33,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:33,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:33,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:33,014 INFO L225 Difference]: With dead ends: 307 [2019-09-20 13:27:33,014 INFO L226 Difference]: Without dead ends: 307 [2019-09-20 13:27:33,015 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:33,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-20 13:27:33,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 256. [2019-09-20 13:27:33,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 386 transitions. [2019-09-20 13:27:33,022 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 386 transitions. Word has length 104 [2019-09-20 13:27:33,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:33,023 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 386 transitions. [2019-09-20 13:27:33,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:33,023 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 386 transitions. [2019-09-20 13:27:33,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:33,024 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:33,025 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:33,025 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:33,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:33,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1728723206, now seen corresponding path program 1 times [2019-09-20 13:27:33,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:33,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:33,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:33,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:33,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:33,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:33,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:33,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:33,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:33,133 INFO L87 Difference]: Start difference. First operand 256 states and 386 transitions. Second operand 4 states. [2019-09-20 13:27:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:33,561 INFO L93 Difference]: Finished difference Result 305 states and 450 transitions. [2019-09-20 13:27:33,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:33,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:33,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:33,564 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:27:33,564 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:27:33,564 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:27:33,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2019-09-20 13:27:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 385 transitions. [2019-09-20 13:27:33,571 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 385 transitions. Word has length 104 [2019-09-20 13:27:33,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:33,572 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 385 transitions. [2019-09-20 13:27:33,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:33,572 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 385 transitions. [2019-09-20 13:27:33,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:33,573 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:33,573 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:33,574 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:33,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:33,576 INFO L82 PathProgramCache]: Analyzing trace with hash 32845565, now seen corresponding path program 1 times [2019-09-20 13:27:33,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:33,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:33,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:33,660 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:33,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:33,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:33,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:33,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:33,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:33,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:33,662 INFO L87 Difference]: Start difference. First operand 256 states and 385 transitions. Second operand 4 states. [2019-09-20 13:27:34,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,010 INFO L93 Difference]: Finished difference Result 279 states and 413 transitions. [2019-09-20 13:27:34,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:34,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:34,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,012 INFO L225 Difference]: With dead ends: 279 [2019-09-20 13:27:34,012 INFO L226 Difference]: Without dead ends: 279 [2019-09-20 13:27:34,013 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:34,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-20 13:27:34,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 256. [2019-09-20 13:27:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:34,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 384 transitions. [2019-09-20 13:27:34,019 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 384 transitions. Word has length 104 [2019-09-20 13:27:34,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,020 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 384 transitions. [2019-09-20 13:27:34,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,020 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 384 transitions. [2019-09-20 13:27:34,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:34,021 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,021 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:34,022 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,022 INFO L82 PathProgramCache]: Analyzing trace with hash -467805956, now seen corresponding path program 1 times [2019-09-20 13:27:34,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:34,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:34,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:34,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:34,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:34,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:34,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:34,120 INFO L87 Difference]: Start difference. First operand 256 states and 384 transitions. Second operand 4 states. [2019-09-20 13:27:34,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,458 INFO L93 Difference]: Finished difference Result 277 states and 410 transitions. [2019-09-20 13:27:34,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:34,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:34,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,460 INFO L225 Difference]: With dead ends: 277 [2019-09-20 13:27:34,461 INFO L226 Difference]: Without dead ends: 277 [2019-09-20 13:27:34,461 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:34,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-20 13:27:34,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2019-09-20 13:27:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:34,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 383 transitions. [2019-09-20 13:27:34,468 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 383 transitions. Word has length 104 [2019-09-20 13:27:34,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,468 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 383 transitions. [2019-09-20 13:27:34,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 383 transitions. [2019-09-20 13:27:34,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:34,470 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,470 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:34,470 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1729836280, now seen corresponding path program 1 times [2019-09-20 13:27:34,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:34,538 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:34,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:34,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:34,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:34,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:34,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:34,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:34,540 INFO L87 Difference]: Start difference. First operand 256 states and 383 transitions. Second operand 4 states. [2019-09-20 13:27:34,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,942 INFO L93 Difference]: Finished difference Result 305 states and 447 transitions. [2019-09-20 13:27:34,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:34,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:34,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,946 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:27:34,946 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:27:34,947 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:34,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:27:34,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2019-09-20 13:27:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:34,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 382 transitions. [2019-09-20 13:27:34,954 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 382 transitions. Word has length 105 [2019-09-20 13:27:34,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,954 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 382 transitions. [2019-09-20 13:27:34,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,955 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 382 transitions. [2019-09-20 13:27:34,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:34,956 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,956 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:34,957 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,957 INFO L82 PathProgramCache]: Analyzing trace with hash -2131401930, now seen corresponding path program 1 times [2019-09-20 13:27:34,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:35,017 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:35,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:35,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:35,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:35,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:35,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:35,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:35,019 INFO L87 Difference]: Start difference. First operand 256 states and 382 transitions. Second operand 4 states. [2019-09-20 13:27:35,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:35,298 INFO L93 Difference]: Finished difference Result 277 states and 408 transitions. [2019-09-20 13:27:35,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:35,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:35,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:35,300 INFO L225 Difference]: With dead ends: 277 [2019-09-20 13:27:35,300 INFO L226 Difference]: Without dead ends: 277 [2019-09-20 13:27:35,300 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:35,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-20 13:27:35,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2019-09-20 13:27:35,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 381 transitions. [2019-09-20 13:27:35,307 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 381 transitions. Word has length 105 [2019-09-20 13:27:35,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:35,307 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 381 transitions. [2019-09-20 13:27:35,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 381 transitions. [2019-09-20 13:27:35,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:27:35,308 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:35,309 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:35,309 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:35,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:35,309 INFO L82 PathProgramCache]: Analyzing trace with hash -2132718409, now seen corresponding path program 1 times [2019-09-20 13:27:35,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:35,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:35,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:35,374 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:35,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:35,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:35,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:35,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:35,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:35,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:35,376 INFO L87 Difference]: Start difference. First operand 256 states and 381 transitions. Second operand 4 states. [2019-09-20 13:27:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:35,779 INFO L93 Difference]: Finished difference Result 305 states and 445 transitions. [2019-09-20 13:27:35,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:35,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:27:35,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:35,781 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:27:35,781 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:27:35,782 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:35,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:27:35,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2019-09-20 13:27:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 380 transitions. [2019-09-20 13:27:35,789 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 380 transitions. Word has length 106 [2019-09-20 13:27:35,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:35,790 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 380 transitions. [2019-09-20 13:27:35,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 380 transitions. [2019-09-20 13:27:35,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:27:35,791 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:35,791 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:35,792 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:35,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:35,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1572018631, now seen corresponding path program 1 times [2019-09-20 13:27:35,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:35,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:35,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:35,919 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:35,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:35,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:35,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:35,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:35,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:35,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:35,921 INFO L87 Difference]: Start difference. First operand 256 states and 380 transitions. Second operand 4 states. [2019-09-20 13:27:36,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:36,287 INFO L93 Difference]: Finished difference Result 277 states and 406 transitions. [2019-09-20 13:27:36,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:36,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:27:36,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:36,289 INFO L225 Difference]: With dead ends: 277 [2019-09-20 13:27:36,290 INFO L226 Difference]: Without dead ends: 277 [2019-09-20 13:27:36,292 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:36,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-20 13:27:36,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2019-09-20 13:27:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2019-09-20 13:27:36,298 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 106 [2019-09-20 13:27:36,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:36,299 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2019-09-20 13:27:36,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:36,299 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2019-09-20 13:27:36,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-20 13:27:36,300 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:36,300 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:36,301 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:36,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:36,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1479437171, now seen corresponding path program 1 times [2019-09-20 13:27:36,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:36,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:36,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:36,370 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:36,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:36,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:36,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:36,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:36,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:36,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:36,372 INFO L87 Difference]: Start difference. First operand 256 states and 379 transitions. Second operand 4 states. [2019-09-20 13:27:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:36,799 INFO L93 Difference]: Finished difference Result 305 states and 443 transitions. [2019-09-20 13:27:36,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:36,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-20 13:27:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:36,801 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:27:36,801 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:27:36,802 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:27:36,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2019-09-20 13:27:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:36,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 378 transitions. [2019-09-20 13:27:36,808 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 378 transitions. Word has length 107 [2019-09-20 13:27:36,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:36,809 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 378 transitions. [2019-09-20 13:27:36,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:36,809 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 378 transitions. [2019-09-20 13:27:36,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-20 13:27:36,810 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:36,810 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:36,811 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:36,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:36,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1681261105, now seen corresponding path program 1 times [2019-09-20 13:27:36,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:36,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:36,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:36,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:36,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:36,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:36,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:36,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:36,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:36,877 INFO L87 Difference]: Start difference. First operand 256 states and 378 transitions. Second operand 4 states. [2019-09-20 13:27:37,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:37,190 INFO L93 Difference]: Finished difference Result 277 states and 404 transitions. [2019-09-20 13:27:37,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:37,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-20 13:27:37,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:37,192 INFO L225 Difference]: With dead ends: 277 [2019-09-20 13:27:37,192 INFO L226 Difference]: Without dead ends: 277 [2019-09-20 13:27:37,193 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:37,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-20 13:27:37,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2019-09-20 13:27:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 377 transitions. [2019-09-20 13:27:37,199 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 377 transitions. Word has length 107 [2019-09-20 13:27:37,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:37,199 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 377 transitions. [2019-09-20 13:27:37,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:37,199 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 377 transitions. [2019-09-20 13:27:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:27:37,201 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:37,201 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:37,201 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:37,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:37,201 INFO L82 PathProgramCache]: Analyzing trace with hash 584409810, now seen corresponding path program 1 times [2019-09-20 13:27:37,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:37,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:37,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:37,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:37,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:37,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:37,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:37,271 INFO L87 Difference]: Start difference. First operand 256 states and 377 transitions. Second operand 4 states. [2019-09-20 13:27:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:37,663 INFO L93 Difference]: Finished difference Result 295 states and 429 transitions. [2019-09-20 13:27:37,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:37,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-20 13:27:37,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:37,666 INFO L225 Difference]: With dead ends: 295 [2019-09-20 13:27:37,666 INFO L226 Difference]: Without dead ends: 295 [2019-09-20 13:27:37,667 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:37,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-20 13:27:37,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 256. [2019-09-20 13:27:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 376 transitions. [2019-09-20 13:27:37,675 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 376 transitions. Word has length 108 [2019-09-20 13:27:37,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:37,676 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 376 transitions. [2019-09-20 13:27:37,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 376 transitions. [2019-09-20 13:27:37,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:27:37,677 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:37,677 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:37,678 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:37,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:37,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1748982828, now seen corresponding path program 1 times [2019-09-20 13:27:37,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:37,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:37,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:37,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:37,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:37,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:37,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:37,751 INFO L87 Difference]: Start difference. First operand 256 states and 376 transitions. Second operand 4 states. [2019-09-20 13:27:38,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:38,035 INFO L93 Difference]: Finished difference Result 267 states and 390 transitions. [2019-09-20 13:27:38,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:38,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-20 13:27:38,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:38,038 INFO L225 Difference]: With dead ends: 267 [2019-09-20 13:27:38,038 INFO L226 Difference]: Without dead ends: 267 [2019-09-20 13:27:38,038 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-20 13:27:38,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 256. [2019-09-20 13:27:38,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 375 transitions. [2019-09-20 13:27:38,046 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 375 transitions. Word has length 108 [2019-09-20 13:27:38,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:38,046 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 375 transitions. [2019-09-20 13:27:38,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 375 transitions. [2019-09-20 13:27:38,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-20 13:27:38,048 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:38,048 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:38,048 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:38,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:38,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1940357182, now seen corresponding path program 1 times [2019-09-20 13:27:38,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:38,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:38,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:38,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:38,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:38,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:38,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:38,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:38,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:38,147 INFO L87 Difference]: Start difference. First operand 256 states and 375 transitions. Second operand 4 states. [2019-09-20 13:27:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:38,536 INFO L93 Difference]: Finished difference Result 295 states and 427 transitions. [2019-09-20 13:27:38,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:38,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-20 13:27:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:38,539 INFO L225 Difference]: With dead ends: 295 [2019-09-20 13:27:38,540 INFO L226 Difference]: Without dead ends: 295 [2019-09-20 13:27:38,540 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:38,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-20 13:27:38,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 256. [2019-09-20 13:27:38,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:38,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 374 transitions. [2019-09-20 13:27:38,546 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 374 transitions. Word has length 112 [2019-09-20 13:27:38,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:38,546 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 374 transitions. [2019-09-20 13:27:38,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:38,546 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 374 transitions. [2019-09-20 13:27:38,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-20 13:27:38,547 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:38,548 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:38,548 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:38,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:38,548 INFO L82 PathProgramCache]: Analyzing trace with hash 254177344, now seen corresponding path program 1 times [2019-09-20 13:27:38,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:38,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:38,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:38,616 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-20 13:27:38,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:38,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:38,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:38,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:38,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:38,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:38,618 INFO L87 Difference]: Start difference. First operand 256 states and 374 transitions. Second operand 3 states. [2019-09-20 13:27:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:38,642 INFO L93 Difference]: Finished difference Result 485 states and 717 transitions. [2019-09-20 13:27:38,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:38,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-20 13:27:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:38,645 INFO L225 Difference]: With dead ends: 485 [2019-09-20 13:27:38,645 INFO L226 Difference]: Without dead ends: 485 [2019-09-20 13:27:38,645 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-09-20 13:27:38,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2019-09-20 13:27:38,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-09-20 13:27:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 717 transitions. [2019-09-20 13:27:38,655 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 717 transitions. Word has length 112 [2019-09-20 13:27:38,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:38,655 INFO L475 AbstractCegarLoop]: Abstraction has 485 states and 717 transitions. [2019-09-20 13:27:38,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:38,655 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 717 transitions. [2019-09-20 13:27:38,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-20 13:27:38,657 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:38,657 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:38,657 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:38,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:38,658 INFO L82 PathProgramCache]: Analyzing trace with hash -792115341, now seen corresponding path program 1 times [2019-09-20 13:27:38,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:38,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:38,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 13:27:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 13:27:38,994 INFO L474 BasicCegarLoop]: Counterexample might be feasible [2019-09-20 13:27:39,039 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967307 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2019-09-20 13:27:39,042 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967308 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2019-09-20 13:27:39,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:27:39 BoogieIcfgContainer [2019-09-20 13:27:39,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:27:39,158 INFO L168 Benchmark]: Toolchain (without parser) took 20345.48 ms. Allocated memory was 131.1 MB in the beginning and 503.3 MB in the end (delta: 372.2 MB). Free memory was 82.9 MB in the beginning and 300.2 MB in the end (delta: -217.2 MB). Peak memory consumption was 155.0 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:39,159 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 131.1 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:27:39,160 INFO L168 Benchmark]: CACSL2BoogieTranslator took 936.10 ms. Allocated memory was 131.1 MB in the beginning and 200.8 MB in the end (delta: 69.7 MB). Free memory was 82.7 MB in the beginning and 157.4 MB in the end (delta: -74.7 MB). Peak memory consumption was 32.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:39,160 INFO L168 Benchmark]: Boogie Preprocessor took 198.41 ms. Allocated memory is still 200.8 MB. Free memory was 157.4 MB in the beginning and 150.0 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:39,163 INFO L168 Benchmark]: RCFGBuilder took 1838.55 ms. Allocated memory was 200.8 MB in the beginning and 220.7 MB in the end (delta: 19.9 MB). Free memory was 149.3 MB in the beginning and 167.8 MB in the end (delta: -18.5 MB). Peak memory consumption was 86.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:39,163 INFO L168 Benchmark]: TraceAbstraction took 17367.98 ms. Allocated memory was 220.7 MB in the beginning and 503.3 MB in the end (delta: 282.6 MB). Free memory was 167.8 MB in the beginning and 300.2 MB in the end (delta: -132.3 MB). Peak memory consumption was 150.3 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:39,171 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.27 ms. Allocated memory is still 131.1 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 936.10 ms. Allocated memory was 131.1 MB in the beginning and 200.8 MB in the end (delta: 69.7 MB). Free memory was 82.7 MB in the beginning and 157.4 MB in the end (delta: -74.7 MB). Peak memory consumption was 32.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 198.41 ms. Allocated memory is still 200.8 MB. Free memory was 157.4 MB in the beginning and 150.0 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1838.55 ms. Allocated memory was 200.8 MB in the beginning and 220.7 MB in the end (delta: 19.9 MB). Free memory was 149.3 MB in the beginning and 167.8 MB in the end (delta: -18.5 MB). Peak memory consumption was 86.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17367.98 ms. Allocated memory was 220.7 MB in the beginning and 503.3 MB in the end (delta: 282.6 MB). Free memory was 167.8 MB in the beginning and 300.2 MB in the end (delta: -132.3 MB). Peak memory consumption was 150.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967307 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 4294967308 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: 1703]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=4294967321, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={-2:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 VAL [init=1, malloc(sizeof(SSL))={2:0}, malloc(sizeof(SSL_CTX))={3:0}, malloc(sizeof(SSL_SESSION))={6:0}, malloc(sizeof(struct ssl3_state_st))={1:0}, s={2:0}, SSLv3_server_data={-2:0}] [L1075] CALL ssl3_accept(s) VAL [init=1, s={2:0}, SSLv3_server_data={-2:0}] [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->info_callback={1:4294967295}, skip=0, SSLv3_server_data={-2:0}, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1115] COND FALSE !((unsigned long )s->info_callback != (unsigned long )((void *)0)) [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1130] EXPR s->cert VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->cert={5:-4}, skip=0, SSLv3_server_data={-2:0}, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=8464, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=8464, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=8464, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=8464, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=8464, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=8464, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=8464, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=8464, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=8464, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [={0:0}, blastFlag=1, got_new_session=0, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [={0:0}, (s->s3)->tmp.reuse_message=4294967311, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->s3={1:0}, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1136] COND TRUE 1 VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->hit=1, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1357] s->init_num = 0 VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [={0:0}, (s->s3)->tmp.reuse_message=4294967311, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->s3={1:0}, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1136] COND TRUE 1 VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1229] COND TRUE s->state == 8656 [L1555] EXPR s->session [L1555] EXPR s->s3 [L1555] EXPR (s->s3)->tmp.new_cipher [L1555] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1556] COND FALSE !(! tmp___9) [L1562] ret = __VERIFIER_nondet_int() [L1563] COND TRUE blastFlag == 2 [L1564] blastFlag = 3 VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1568] COND FALSE !(ret <= 0) [L1573] s->state = 8672 [L1574] s->init_num = 0 VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1575] COND FALSE !(! tmp___10) VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [={0:0}, (s->s3)->tmp.reuse_message=4294967311, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->s3={1:0}, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1136] COND TRUE 1 VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1235] COND TRUE s->state == 8672 [L1584] ret = __VERIFIER_nondet_int() [L1585] COND TRUE blastFlag == 3 VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1703] __VERIFIER_error() VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 181 locations, 1 error locations. UNSAFE Result, 17.3s OverallTime, 37 OverallIterations, 4 TraceHistogramMax, 12.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6980 SDtfs, 1948 SDslu, 10037 SDs, 0 SdLazy, 6391 SolverSat, 316 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 78 SyntacticMatches, 31 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=485occurred in iteration=36, 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, 36 MinimizatonAttempts, 850 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 3305 NumberOfCodeBlocks, 3305 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3138 ConstructedInterpolants, 0 QuantifiedInterpolants, 785784 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 1437/1437 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...