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.11.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:41,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:41,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:41,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:41,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:41,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:41,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:41,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:41,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:41,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:41,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:41,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:41,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:41,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:41,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:41,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:41,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:41,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:41,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:41,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:41,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:41,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:41,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:41,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:41,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:41,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:41,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:41,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:41,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:41,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:41,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:41,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:41,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:41,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:41,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:41,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:41,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:41,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:41,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:41,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:41,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:41,680 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:41,694 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:41,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:41,694 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:41,694 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:41,695 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:41,695 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:41,696 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:41,696 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:41,696 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:41,696 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:41,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:41,697 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:41,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:41,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:41,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:41,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:41,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:41,699 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:41,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:41,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:41,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:41,700 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:41,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:41,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:41,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:41,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:41,702 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:41,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:41,702 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:41,703 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:41,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:41,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:41,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:41,771 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:41,771 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:41,772 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.11.i.cil-1.c [2019-09-20 13:27:41,834 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83d2dd0b7/0a8f84a112af409584311aca8a5f2d08/FLAGf47d1daef [2019-09-20 13:27:42,484 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:42,485 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.11.i.cil-1.c [2019-09-20 13:27:42,505 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83d2dd0b7/0a8f84a112af409584311aca8a5f2d08/FLAGf47d1daef [2019-09-20 13:27:42,676 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83d2dd0b7/0a8f84a112af409584311aca8a5f2d08 [2019-09-20 13:27:42,690 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:42,692 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:42,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:42,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:42,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:42,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:42" (1/1) ... [2019-09-20 13:27:42,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52df33f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:42, skipping insertion in model container [2019-09-20 13:27:42,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:42" (1/1) ... [2019-09-20 13:27:42,709 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:42,797 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:43,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:43,417 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:43,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:43,592 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:43,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:43 WrapperNode [2019-09-20 13:27:43,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:43,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:43,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:43,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:43,610 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:43" (1/1) ... [2019-09-20 13:27:43,610 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:43" (1/1) ... [2019-09-20 13:27:43,654 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:43" (1/1) ... [2019-09-20 13:27:43,654 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:43" (1/1) ... [2019-09-20 13:27:43,748 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:43" (1/1) ... [2019-09-20 13:27:43,763 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:43" (1/1) ... [2019-09-20 13:27:43,768 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:43" (1/1) ... [2019-09-20 13:27:43,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:43,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:43,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:43,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:43,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:43" (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:43,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:43,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:43,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:27:43,863 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:27:43,863 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:43,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:27:43,864 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:43,864 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:43,864 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:43,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:43,865 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:43,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:43,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:43,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:43,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:43,866 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:43,866 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:27:43,867 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:43,867 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:27:43,867 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:27:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:43,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:43,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:43,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:43,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:43,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:43,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:44,525 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:45,334 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:27:45,334 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:27:45,358 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:45,358 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:45,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:45 BoogieIcfgContainer [2019-09-20 13:27:45,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:45,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:45,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:45,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:45,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:42" (1/3) ... [2019-09-20 13:27:45,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2208e1b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:45, skipping insertion in model container [2019-09-20 13:27:45,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:43" (2/3) ... [2019-09-20 13:27:45,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2208e1b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:45, skipping insertion in model container [2019-09-20 13:27:45,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:45" (3/3) ... [2019-09-20 13:27:45,372 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2019-09-20 13:27:45,379 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:45,387 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:45,399 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:45,422 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:45,422 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:45,422 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:45,423 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:45,423 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:45,423 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:45,423 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:45,423 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2019-09-20 13:27:45,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-20 13:27:45,454 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:45,455 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] [2019-09-20 13:27:45,458 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:45,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:45,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1489368308, now seen corresponding path program 1 times [2019-09-20 13:27:45,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:45,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:45,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:45,819 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:45,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:45,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:45,822 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:45,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:45,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:45,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:45,847 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2019-09-20 13:27:46,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:46,470 INFO L93 Difference]: Finished difference Result 190 states and 310 transitions. [2019-09-20 13:27:46,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:46,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-20 13:27:46,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:46,487 INFO L225 Difference]: With dead ends: 190 [2019-09-20 13:27:46,487 INFO L226 Difference]: Without dead ends: 169 [2019-09-20 13:27:46,489 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:46,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-20 13:27:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-20 13:27:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-20 13:27:46,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2019-09-20 13:27:46,544 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 41 [2019-09-20 13:27:46,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:46,545 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2019-09-20 13:27:46,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:46,545 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2019-09-20 13:27:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:27:46,548 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:46,548 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] [2019-09-20 13:27:46,549 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:46,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:46,549 INFO L82 PathProgramCache]: Analyzing trace with hash 380678987, now seen corresponding path program 1 times [2019-09-20 13:27:46,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:46,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:46,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:46,737 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:46,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:46,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:46,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:46,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:46,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:46,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:46,741 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2019-09-20 13:27:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:47,112 INFO L93 Difference]: Finished difference Result 169 states and 252 transitions. [2019-09-20 13:27:47,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:47,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-09-20 13:27:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:47,115 INFO L225 Difference]: With dead ends: 169 [2019-09-20 13:27:47,115 INFO L226 Difference]: Without dead ends: 169 [2019-09-20 13:27:47,116 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:47,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-20 13:27:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-20 13:27:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-20 13:27:47,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2019-09-20 13:27:47,133 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 54 [2019-09-20 13:27:47,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:47,134 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2019-09-20 13:27:47,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:47,134 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2019-09-20 13:27:47,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:27:47,140 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:47,140 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] [2019-09-20 13:27:47,140 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:47,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:47,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1401722649, now seen corresponding path program 1 times [2019-09-20 13:27:47,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:47,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:47,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:47,255 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:47,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:47,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:47,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:47,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:47,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:47,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:47,257 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 4 states. [2019-09-20 13:27:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:47,579 INFO L93 Difference]: Finished difference Result 168 states and 250 transitions. [2019-09-20 13:27:47,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:47,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-20 13:27:47,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:47,582 INFO L225 Difference]: With dead ends: 168 [2019-09-20 13:27:47,582 INFO L226 Difference]: Without dead ends: 168 [2019-09-20 13:27:47,583 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:47,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-20 13:27:47,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 152. [2019-09-20 13:27:47,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-20 13:27:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 230 transitions. [2019-09-20 13:27:47,592 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 230 transitions. Word has length 55 [2019-09-20 13:27:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:47,593 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 230 transitions. [2019-09-20 13:27:47,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:47,593 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 230 transitions. [2019-09-20 13:27:47,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:27:47,596 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:47,596 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] [2019-09-20 13:27:47,596 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:47,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:47,597 INFO L82 PathProgramCache]: Analyzing trace with hash -536143493, now seen corresponding path program 1 times [2019-09-20 13:27:47,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:47,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:47,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:47,757 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:47,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:47,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:27:47,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:47,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:27:47,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:27:47,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:47,759 INFO L87 Difference]: Start difference. First operand 152 states and 230 transitions. Second operand 5 states. [2019-09-20 13:27:48,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:48,250 INFO L93 Difference]: Finished difference Result 173 states and 258 transitions. [2019-09-20 13:27:48,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:48,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-20 13:27:48,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:48,253 INFO L225 Difference]: With dead ends: 173 [2019-09-20 13:27:48,253 INFO L226 Difference]: Without dead ends: 173 [2019-09-20 13:27:48,253 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:48,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-20 13:27:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-09-20 13:27:48,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:27:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2019-09-20 13:27:48,277 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 55 [2019-09-20 13:27:48,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:48,280 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2019-09-20 13:27:48,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:27:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2019-09-20 13:27:48,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:27:48,284 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:48,284 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] [2019-09-20 13:27:48,284 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:48,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:48,285 INFO L82 PathProgramCache]: Analyzing trace with hash -358032589, now seen corresponding path program 1 times [2019-09-20 13:27:48,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:48,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:48,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:48,420 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:48,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:48,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:48,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:48,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:48,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:48,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:48,423 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2019-09-20 13:27:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:48,727 INFO L93 Difference]: Finished difference Result 187 states and 274 transitions. [2019-09-20 13:27:48,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:48,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-20 13:27:48,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:48,730 INFO L225 Difference]: With dead ends: 187 [2019-09-20 13:27:48,730 INFO L226 Difference]: Without dead ends: 187 [2019-09-20 13:27:48,731 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-20 13:27:48,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2019-09-20 13:27:48,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:27:48,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2019-09-20 13:27:48,738 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 55 [2019-09-20 13:27:48,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:48,739 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2019-09-20 13:27:48,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2019-09-20 13:27:48,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:27:48,740 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:48,741 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] [2019-09-20 13:27:48,741 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:48,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:48,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1285498866, now seen corresponding path program 1 times [2019-09-20 13:27:48,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:48,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:48,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:48,819 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:48,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:48,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:48,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:48,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:48,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:48,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:48,829 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2019-09-20 13:27:49,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,110 INFO L93 Difference]: Finished difference Result 185 states and 271 transitions. [2019-09-20 13:27:49,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:49,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-20 13:27:49,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,112 INFO L225 Difference]: With dead ends: 185 [2019-09-20 13:27:49,113 INFO L226 Difference]: Without dead ends: 185 [2019-09-20 13:27:49,113 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:49,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-20 13:27:49,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-20 13:27:49,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:27:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2019-09-20 13:27:49,120 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 55 [2019-09-20 13:27:49,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:49,121 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2019-09-20 13:27:49,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2019-09-20 13:27:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-20 13:27:49,122 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:49,122 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] [2019-09-20 13:27:49,122 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:49,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:49,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1797335240, now seen corresponding path program 1 times [2019-09-20 13:27:49,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:49,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:49,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:49,207 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:49,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:49,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:49,208 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:49,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:49,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:49,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,210 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand 4 states. [2019-09-20 13:27:49,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,499 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2019-09-20 13:27:49,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:49,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-09-20 13:27:49,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,502 INFO L225 Difference]: With dead ends: 185 [2019-09-20 13:27:49,502 INFO L226 Difference]: Without dead ends: 185 [2019-09-20 13:27:49,502 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:49,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-20 13:27:49,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-20 13:27:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:27:49,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 254 transitions. [2019-09-20 13:27:49,509 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 254 transitions. Word has length 56 [2019-09-20 13:27:49,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:49,510 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 254 transitions. [2019-09-20 13:27:49,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:49,510 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 254 transitions. [2019-09-20 13:27:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-20 13:27:49,512 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:49,513 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] [2019-09-20 13:27:49,513 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:49,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:49,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1679814895, now seen corresponding path program 1 times [2019-09-20 13:27:49,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:49,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:49,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:49,623 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:49,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:49,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:49,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:49,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:49,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:49,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,625 INFO L87 Difference]: Start difference. First operand 172 states and 254 transitions. Second operand 4 states. [2019-09-20 13:27:49,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,886 INFO L93 Difference]: Finished difference Result 185 states and 269 transitions. [2019-09-20 13:27:49,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:49,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-09-20 13:27:49,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,889 INFO L225 Difference]: With dead ends: 185 [2019-09-20 13:27:49,889 INFO L226 Difference]: Without dead ends: 185 [2019-09-20 13:27:49,890 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:49,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-20 13:27:49,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-20 13:27:49,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:27:49,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2019-09-20 13:27:49,895 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 57 [2019-09-20 13:27:49,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:49,896 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2019-09-20 13:27:49,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2019-09-20 13:27:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-20 13:27:49,897 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:49,897 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] [2019-09-20 13:27:49,897 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:49,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:49,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1049616899, now seen corresponding path program 1 times [2019-09-20 13:27:49,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:49,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:49,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:49,969 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:49,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:49,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:49,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:49,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:49,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:49,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,971 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 4 states. [2019-09-20 13:27:50,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:50,235 INFO L93 Difference]: Finished difference Result 185 states and 268 transitions. [2019-09-20 13:27:50,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:50,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-20 13:27:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:50,237 INFO L225 Difference]: With dead ends: 185 [2019-09-20 13:27:50,237 INFO L226 Difference]: Without dead ends: 185 [2019-09-20 13:27:50,238 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:50,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-20 13:27:50,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-20 13:27:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:27:50,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 252 transitions. [2019-09-20 13:27:50,244 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 252 transitions. Word has length 58 [2019-09-20 13:27:50,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:50,244 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 252 transitions. [2019-09-20 13:27:50,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:50,245 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 252 transitions. [2019-09-20 13:27:50,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-20 13:27:50,246 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:50,246 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] [2019-09-20 13:27:50,246 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:50,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:50,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1277180062, now seen corresponding path program 1 times [2019-09-20 13:27:50,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:50,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:50,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:50,329 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:50,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:50,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:50,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:50,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:50,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:50,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:50,331 INFO L87 Difference]: Start difference. First operand 172 states and 252 transitions. Second operand 4 states. [2019-09-20 13:27:50,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:50,654 INFO L93 Difference]: Finished difference Result 214 states and 314 transitions. [2019-09-20 13:27:50,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:50,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-20 13:27:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:50,659 INFO L225 Difference]: With dead ends: 214 [2019-09-20 13:27:50,659 INFO L226 Difference]: Without dead ends: 214 [2019-09-20 13:27:50,659 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:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-20 13:27:50,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-20 13:27:50,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:27:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2019-09-20 13:27:50,669 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 58 [2019-09-20 13:27:50,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:50,670 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2019-09-20 13:27:50,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2019-09-20 13:27:50,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-20 13:27:50,671 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:50,671 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] [2019-09-20 13:27:50,671 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:50,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:50,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1706280906, now seen corresponding path program 1 times [2019-09-20 13:27:50,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:50,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:50,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:50,767 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:50,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:50,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:50,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:50,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:50,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:50,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:50,769 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 4 states. [2019-09-20 13:27:51,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:51,042 INFO L93 Difference]: Finished difference Result 197 states and 292 transitions. [2019-09-20 13:27:51,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:51,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-09-20 13:27:51,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:51,045 INFO L225 Difference]: With dead ends: 197 [2019-09-20 13:27:51,045 INFO L226 Difference]: Without dead ends: 197 [2019-09-20 13:27:51,045 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:51,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-20 13:27:51,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2019-09-20 13:27:51,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:27:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2019-09-20 13:27:51,052 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 59 [2019-09-20 13:27:51,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:51,053 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2019-09-20 13:27:51,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:51,053 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2019-09-20 13:27:51,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-20 13:27:51,054 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:51,054 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] [2019-09-20 13:27:51,055 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:51,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:51,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1052652213, now seen corresponding path program 1 times [2019-09-20 13:27:51,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:51,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:51,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:51,156 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:51,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:51,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:51,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:51,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:51,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:51,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:51,159 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand 4 states. [2019-09-20 13:27:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:51,587 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2019-09-20 13:27:51,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:51,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-09-20 13:27:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:51,589 INFO L225 Difference]: With dead ends: 214 [2019-09-20 13:27:51,590 INFO L226 Difference]: Without dead ends: 214 [2019-09-20 13:27:51,590 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:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-20 13:27:51,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-20 13:27:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:27:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2019-09-20 13:27:51,597 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 71 [2019-09-20 13:27:51,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:51,597 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2019-09-20 13:27:51,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2019-09-20 13:27:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-20 13:27:51,599 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:51,599 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] [2019-09-20 13:27:51,600 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:51,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:51,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1001699063, now seen corresponding path program 1 times [2019-09-20 13:27:51,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:51,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:51,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:51,666 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:51,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:51,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:51,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:51,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:51,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:51,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:51,671 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 4 states. [2019-09-20 13:27:51,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:51,952 INFO L93 Difference]: Finished difference Result 213 states and 310 transitions. [2019-09-20 13:27:51,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:51,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-20 13:27:51,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:51,954 INFO L225 Difference]: With dead ends: 213 [2019-09-20 13:27:51,954 INFO L226 Difference]: Without dead ends: 213 [2019-09-20 13:27:51,955 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:51,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-20 13:27:51,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2019-09-20 13:27:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:27:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2019-09-20 13:27:51,961 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 72 [2019-09-20 13:27:51,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:51,961 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2019-09-20 13:27:51,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:51,961 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2019-09-20 13:27:51,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-20 13:27:51,962 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:51,962 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] [2019-09-20 13:27:51,963 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:51,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:51,963 INFO L82 PathProgramCache]: Analyzing trace with hash 641832392, now seen corresponding path program 1 times [2019-09-20 13:27:51,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:51,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:51,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:52,021 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:52,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:52,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:52,022 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:52,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:52,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:52,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:52,023 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand 4 states. [2019-09-20 13:27:52,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:52,320 INFO L93 Difference]: Finished difference Result 211 states and 307 transitions. [2019-09-20 13:27:52,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:52,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-20 13:27:52,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:52,322 INFO L225 Difference]: With dead ends: 211 [2019-09-20 13:27:52,323 INFO L226 Difference]: Without dead ends: 211 [2019-09-20 13:27:52,323 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:52,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-20 13:27:52,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-20 13:27:52,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:27:52,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2019-09-20 13:27:52,328 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 72 [2019-09-20 13:27:52,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:52,329 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2019-09-20 13:27:52,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:52,329 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2019-09-20 13:27:52,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-20 13:27:52,330 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:52,330 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] [2019-09-20 13:27:52,331 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:52,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:52,331 INFO L82 PathProgramCache]: Analyzing trace with hash -976456270, now seen corresponding path program 1 times [2019-09-20 13:27:52,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:52,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:52,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:52,392 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:52,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:52,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:52,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:52,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:52,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:52,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:52,393 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand 4 states. [2019-09-20 13:27:52,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:52,687 INFO L93 Difference]: Finished difference Result 211 states and 306 transitions. [2019-09-20 13:27:52,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:52,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-20 13:27:52,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:52,689 INFO L225 Difference]: With dead ends: 211 [2019-09-20 13:27:52,689 INFO L226 Difference]: Without dead ends: 211 [2019-09-20 13:27:52,690 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:52,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-20 13:27:52,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-20 13:27:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:27:52,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2019-09-20 13:27:52,696 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 73 [2019-09-20 13:27:52,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:52,696 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2019-09-20 13:27:52,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2019-09-20 13:27:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-20 13:27:52,698 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:52,698 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] [2019-09-20 13:27:52,698 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:52,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:52,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1591624005, now seen corresponding path program 1 times [2019-09-20 13:27:52,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:52,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:52,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:52,759 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:52,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:52,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:52,760 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:52,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:52,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:52,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:52,761 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 4 states. [2019-09-20 13:27:53,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:53,051 INFO L93 Difference]: Finished difference Result 211 states and 305 transitions. [2019-09-20 13:27:53,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:53,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-09-20 13:27:53,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:53,053 INFO L225 Difference]: With dead ends: 211 [2019-09-20 13:27:53,054 INFO L226 Difference]: Without dead ends: 211 [2019-09-20 13:27:53,054 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:53,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-20 13:27:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-20 13:27:53,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:27:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2019-09-20 13:27:53,059 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 74 [2019-09-20 13:27:53,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:53,060 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2019-09-20 13:27:53,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:53,060 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2019-09-20 13:27:53,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-20 13:27:53,061 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:53,061 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] [2019-09-20 13:27:53,061 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:53,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:53,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1684300691, now seen corresponding path program 1 times [2019-09-20 13:27:53,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:53,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:53,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:53,108 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:53,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:53,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:53,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:53,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:53,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:53,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:53,110 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 4 states. [2019-09-20 13:27:53,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:53,390 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2019-09-20 13:27:53,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:53,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-20 13:27:53,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:53,392 INFO L225 Difference]: With dead ends: 211 [2019-09-20 13:27:53,392 INFO L226 Difference]: Without dead ends: 211 [2019-09-20 13:27:53,392 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:53,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-20 13:27:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-20 13:27:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:27:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2019-09-20 13:27:53,398 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 75 [2019-09-20 13:27:53,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:53,398 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2019-09-20 13:27:53,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:53,399 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2019-09-20 13:27:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-20 13:27:53,399 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:53,400 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] [2019-09-20 13:27:53,400 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:53,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1440785760, now seen corresponding path program 1 times [2019-09-20 13:27:53,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:53,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:53,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:53,459 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:53,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:53,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:53,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:53,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:53,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:53,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:53,461 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand 4 states. [2019-09-20 13:27:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:53,731 INFO L93 Difference]: Finished difference Result 201 states and 291 transitions. [2019-09-20 13:27:53,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:53,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-09-20 13:27:53,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:53,734 INFO L225 Difference]: With dead ends: 201 [2019-09-20 13:27:53,734 INFO L226 Difference]: Without dead ends: 201 [2019-09-20 13:27:53,735 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:53,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-20 13:27:53,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2019-09-20 13:27:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:27:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2019-09-20 13:27:53,743 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 76 [2019-09-20 13:27:53,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:53,743 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2019-09-20 13:27:53,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:53,744 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2019-09-20 13:27:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:53,745 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:53,746 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] [2019-09-20 13:27:53,746 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:53,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:53,747 INFO L82 PathProgramCache]: Analyzing trace with hash 164825720, now seen corresponding path program 1 times [2019-09-20 13:27:53,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:53,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:53,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:53,846 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:53,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:53,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:53,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:53,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:53,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:53,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:53,848 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 4 states. [2019-09-20 13:27:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:54,388 INFO L93 Difference]: Finished difference Result 300 states and 442 transitions. [2019-09-20 13:27:54,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:54,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:54,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:54,391 INFO L225 Difference]: With dead ends: 300 [2019-09-20 13:27:54,391 INFO L226 Difference]: Without dead ends: 300 [2019-09-20 13:27:54,391 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:54,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-20 13:27:54,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 224. [2019-09-20 13:27:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-20 13:27:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2019-09-20 13:27:54,399 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 80 [2019-09-20 13:27:54,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:54,399 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2019-09-20 13:27:54,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:54,400 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2019-09-20 13:27:54,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:54,401 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:54,401 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] [2019-09-20 13:27:54,401 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:54,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:54,402 INFO L82 PathProgramCache]: Analyzing trace with hash 92439162, now seen corresponding path program 1 times [2019-09-20 13:27:54,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:54,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:54,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:54,478 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:54,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:54,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:54,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:54,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:54,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:54,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:54,480 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand 4 states. [2019-09-20 13:27:54,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:54,820 INFO L93 Difference]: Finished difference Result 273 states and 405 transitions. [2019-09-20 13:27:54,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:54,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:54,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:54,822 INFO L225 Difference]: With dead ends: 273 [2019-09-20 13:27:54,823 INFO L226 Difference]: Without dead ends: 273 [2019-09-20 13:27:54,823 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:54,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-09-20 13:27:54,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 248. [2019-09-20 13:27:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-20 13:27:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2019-09-20 13:27:54,833 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 80 [2019-09-20 13:27:54,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:54,834 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2019-09-20 13:27:54,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:54,834 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2019-09-20 13:27:54,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:54,836 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:54,836 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] [2019-09-20 13:27:54,837 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:54,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:54,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1395813593, now seen corresponding path program 1 times [2019-09-20 13:27:54,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:54,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:54,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:54,936 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:54,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:54,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:54,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:54,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:54,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:54,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:54,938 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand 4 states. [2019-09-20 13:27:55,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:55,444 INFO L93 Difference]: Finished difference Result 316 states and 469 transitions. [2019-09-20 13:27:55,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:55,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:55,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:55,447 INFO L225 Difference]: With dead ends: 316 [2019-09-20 13:27:55,447 INFO L226 Difference]: Without dead ends: 316 [2019-09-20 13:27:55,447 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:55,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-20 13:27:55,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 249. [2019-09-20 13:27:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-20 13:27:55,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 374 transitions. [2019-09-20 13:27:55,455 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 374 transitions. Word has length 81 [2019-09-20 13:27:55,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:55,456 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 374 transitions. [2019-09-20 13:27:55,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:55,456 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 374 transitions. [2019-09-20 13:27:55,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-20 13:27:55,457 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:55,457 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] [2019-09-20 13:27:55,458 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:55,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:55,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1216785671, now seen corresponding path program 1 times [2019-09-20 13:27:55,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:55,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:55,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:55,526 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:55,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:55,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:55,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:55,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:55,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:55,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:55,528 INFO L87 Difference]: Start difference. First operand 249 states and 374 transitions. Second operand 4 states. [2019-09-20 13:27:55,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:55,911 INFO L93 Difference]: Finished difference Result 316 states and 468 transitions. [2019-09-20 13:27:55,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:55,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-20 13:27:55,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:55,914 INFO L225 Difference]: With dead ends: 316 [2019-09-20 13:27:55,914 INFO L226 Difference]: Without dead ends: 316 [2019-09-20 13:27:55,914 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:55,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-20 13:27:55,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 259. [2019-09-20 13:27:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-20 13:27:55,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2019-09-20 13:27:55,922 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 87 [2019-09-20 13:27:55,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:55,923 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2019-09-20 13:27:55,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2019-09-20 13:27:55,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 13:27:55,924 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:55,924 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] [2019-09-20 13:27:55,924 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:55,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:55,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1151532565, now seen corresponding path program 1 times [2019-09-20 13:27:55,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:55,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:55,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:56,039 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:56,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:56,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:56,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:56,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:56,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:56,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:56,041 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2019-09-20 13:27:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:56,487 INFO L93 Difference]: Finished difference Result 308 states and 456 transitions. [2019-09-20 13:27:56,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:56,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-20 13:27:56,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:56,489 INFO L225 Difference]: With dead ends: 308 [2019-09-20 13:27:56,490 INFO L226 Difference]: Without dead ends: 308 [2019-09-20 13:27:56,490 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:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-20 13:27:56,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2019-09-20 13:27:56,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:56,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2019-09-20 13:27:56,498 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 88 [2019-09-20 13:27:56,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:56,498 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2019-09-20 13:27:56,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:56,498 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2019-09-20 13:27:56,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-20 13:27:56,500 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:56,500 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] [2019-09-20 13:27:56,500 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:56,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:56,501 INFO L82 PathProgramCache]: Analyzing trace with hash -528538785, now seen corresponding path program 1 times [2019-09-20 13:27:56,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:56,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:56,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:56,565 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:56,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:56,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:56,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:56,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:56,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:56,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:56,568 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2019-09-20 13:27:56,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:56,944 INFO L93 Difference]: Finished difference Result 308 states and 455 transitions. [2019-09-20 13:27:56,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:56,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-20 13:27:56,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:56,947 INFO L225 Difference]: With dead ends: 308 [2019-09-20 13:27:56,947 INFO L226 Difference]: Without dead ends: 308 [2019-09-20 13:27:56,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:56,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-20 13:27:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2019-09-20 13:27:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2019-09-20 13:27:56,955 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 93 [2019-09-20 13:27:56,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:56,955 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2019-09-20 13:27:56,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2019-09-20 13:27:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-20 13:27:56,957 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:56,957 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] [2019-09-20 13:27:56,957 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:56,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:56,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1399733917, now seen corresponding path program 1 times [2019-09-20 13:27:56,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:56,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:56,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:57,021 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:57,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:57,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:57,022 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:57,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:57,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:57,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:57,023 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2019-09-20 13:27:57,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:57,400 INFO L93 Difference]: Finished difference Result 285 states and 424 transitions. [2019-09-20 13:27:57,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:57,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-20 13:27:57,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:57,404 INFO L225 Difference]: With dead ends: 285 [2019-09-20 13:27:57,404 INFO L226 Difference]: Without dead ends: 285 [2019-09-20 13:27:57,404 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:57,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-20 13:27:57,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2019-09-20 13:27:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2019-09-20 13:27:57,413 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 93 [2019-09-20 13:27:57,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:57,414 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2019-09-20 13:27:57,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2019-09-20 13:27:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-20 13:27:57,415 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:57,415 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] [2019-09-20 13:27:57,416 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:57,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:57,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1520987551, now seen corresponding path program 1 times [2019-09-20 13:27:57,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:57,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:57,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:57,486 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:57,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:57,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:57,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:57,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:57,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:57,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:57,488 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2019-09-20 13:27:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:57,911 INFO L93 Difference]: Finished difference Result 307 states and 452 transitions. [2019-09-20 13:27:57,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:57,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-20 13:27:57,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:57,915 INFO L225 Difference]: With dead ends: 307 [2019-09-20 13:27:57,915 INFO L226 Difference]: Without dead ends: 307 [2019-09-20 13:27:57,916 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:57,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-20 13:27:57,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-20 13:27:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2019-09-20 13:27:57,924 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 94 [2019-09-20 13:27:57,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:57,924 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2019-09-20 13:27:57,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:57,925 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2019-09-20 13:27:57,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-20 13:27:57,926 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:57,926 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] [2019-09-20 13:27:57,927 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:57,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:57,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1130448290, now seen corresponding path program 1 times [2019-09-20 13:27:57,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:57,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:57,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:58,012 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:58,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:58,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:58,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:58,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:58,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:58,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:58,014 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2019-09-20 13:27:58,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:58,394 INFO L93 Difference]: Finished difference Result 305 states and 449 transitions. [2019-09-20 13:27:58,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:58,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-20 13:27:58,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:58,396 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:27:58,396 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:27:58,396 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:58,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:27:58,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2019-09-20 13:27:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:58,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2019-09-20 13:27:58,403 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 94 [2019-09-20 13:27:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:58,403 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2019-09-20 13:27:58,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2019-09-20 13:27:58,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-20 13:27:58,405 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:58,405 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] [2019-09-20 13:27:58,405 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:58,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:58,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1167899169, now seen corresponding path program 1 times [2019-09-20 13:27:58,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:58,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:58,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:58,465 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:58,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:58,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:58,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:58,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:58,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:58,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:58,466 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2019-09-20 13:27:58,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:58,779 INFO L93 Difference]: Finished difference Result 284 states and 420 transitions. [2019-09-20 13:27:58,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:58,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-20 13:27:58,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:58,781 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:27:58,782 INFO L226 Difference]: Without dead ends: 284 [2019-09-20 13:27:58,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:58,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-20 13:27:58,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2019-09-20 13:27:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2019-09-20 13:27:58,788 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 94 [2019-09-20 13:27:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:58,789 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2019-09-20 13:27:58,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2019-09-20 13:27:58,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-20 13:27:58,790 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:58,790 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] [2019-09-20 13:27:58,790 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:58,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:58,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1483536672, now seen corresponding path program 1 times [2019-09-20 13:27:58,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:58,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:58,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:58,872 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:58,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:58,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:58,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:58,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:58,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:58,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:58,875 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2019-09-20 13:27:59,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:59,134 INFO L93 Difference]: Finished difference Result 282 states and 417 transitions. [2019-09-20 13:27:59,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:59,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-20 13:27:59,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:59,137 INFO L225 Difference]: With dead ends: 282 [2019-09-20 13:27:59,137 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:27:59,138 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:59,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:27:59,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-20 13:27:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2019-09-20 13:27:59,144 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 94 [2019-09-20 13:27:59,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:59,144 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2019-09-20 13:27:59,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2019-09-20 13:27:59,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-20 13:27:59,146 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:59,146 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] [2019-09-20 13:27:59,146 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:59,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:59,147 INFO L82 PathProgramCache]: Analyzing trace with hash -82582564, now seen corresponding path program 1 times [2019-09-20 13:27:59,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:59,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:59,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:59,197 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:59,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:59,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:59,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:59,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:59,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:59,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:59,199 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2019-09-20 13:27:59,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:59,552 INFO L93 Difference]: Finished difference Result 305 states and 446 transitions. [2019-09-20 13:27:59,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:59,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-20 13:27:59,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:59,554 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:27:59,554 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:27:59,555 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:59,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:27:59,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2019-09-20 13:27:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2019-09-20 13:27:59,561 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 95 [2019-09-20 13:27:59,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:59,561 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2019-09-20 13:27:59,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:59,561 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2019-09-20 13:27:59,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-20 13:27:59,563 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:59,563 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] [2019-09-20 13:27:59,563 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:59,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:59,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1856579482, now seen corresponding path program 1 times [2019-09-20 13:27:59,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:59,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:59,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:59,660 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:59,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:59,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:59,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:59,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:59,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:59,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:59,662 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 4 states. [2019-09-20 13:27:59,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:59,953 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2019-09-20 13:27:59,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:59,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-20 13:27:59,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:59,956 INFO L225 Difference]: With dead ends: 282 [2019-09-20 13:27:59,956 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:27:59,957 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:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:27:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-20 13:27:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 386 transitions. [2019-09-20 13:27:59,963 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 386 transitions. Word has length 95 [2019-09-20 13:27:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:59,963 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 386 transitions. [2019-09-20 13:27:59,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 386 transitions. [2019-09-20 13:27:59,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-20 13:27:59,964 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:59,965 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] [2019-09-20 13:27:59,965 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:59,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:59,965 INFO L82 PathProgramCache]: Analyzing trace with hash -763062181, now seen corresponding path program 1 times [2019-09-20 13:27:59,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:59,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:59,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:00,033 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:28:00,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:00,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:00,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:00,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:00,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:00,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:00,035 INFO L87 Difference]: Start difference. First operand 260 states and 386 transitions. Second operand 4 states. [2019-09-20 13:28:00,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:00,412 INFO L93 Difference]: Finished difference Result 305 states and 444 transitions. [2019-09-20 13:28:00,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:00,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-20 13:28:00,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:00,414 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:28:00,414 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:28:00,415 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:28:00,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:28:00,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2019-09-20 13:28:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 385 transitions. [2019-09-20 13:28:00,421 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 385 transitions. Word has length 96 [2019-09-20 13:28:00,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:00,422 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 385 transitions. [2019-09-20 13:28:00,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:00,422 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 385 transitions. [2019-09-20 13:28:00,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-20 13:28:00,423 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:00,423 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] [2019-09-20 13:28:00,424 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:00,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:00,424 INFO L82 PathProgramCache]: Analyzing trace with hash -778580899, now seen corresponding path program 1 times [2019-09-20 13:28:00,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:00,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:00,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:00,480 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:28:00,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:00,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:00,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:00,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:00,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:00,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:00,485 INFO L87 Difference]: Start difference. First operand 260 states and 385 transitions. Second operand 4 states. [2019-09-20 13:28:00,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:00,765 INFO L93 Difference]: Finished difference Result 282 states and 413 transitions. [2019-09-20 13:28:00,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:00,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-20 13:28:00,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:00,767 INFO L225 Difference]: With dead ends: 282 [2019-09-20 13:28:00,767 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:28:00,768 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:28:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:28:00,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-20 13:28:00,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:00,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2019-09-20 13:28:00,774 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 96 [2019-09-20 13:28:00,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:00,774 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2019-09-20 13:28:00,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:00,775 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2019-09-20 13:28:00,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-20 13:28:00,776 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:00,776 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] [2019-09-20 13:28:00,776 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:00,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:00,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1665128425, now seen corresponding path program 1 times [2019-09-20 13:28:00,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:00,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:00,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:00,834 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:28:00,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:00,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:00,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:00,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:00,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:00,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:00,836 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand 4 states. [2019-09-20 13:28:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:01,192 INFO L93 Difference]: Finished difference Result 305 states and 442 transitions. [2019-09-20 13:28:01,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:01,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-20 13:28:01,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:01,194 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:28:01,194 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:28:01,194 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:28:01,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:28:01,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2019-09-20 13:28:01,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:01,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2019-09-20 13:28:01,200 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 97 [2019-09-20 13:28:01,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:01,200 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2019-09-20 13:28:01,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:01,200 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2019-09-20 13:28:01,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-20 13:28:01,201 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:01,202 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] [2019-09-20 13:28:01,202 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:01,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:01,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2146208683, now seen corresponding path program 1 times [2019-09-20 13:28:01,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:01,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:01,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:01,268 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:28:01,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:01,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:01,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:01,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:01,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:01,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:01,270 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand 4 states. [2019-09-20 13:28:01,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:01,591 INFO L93 Difference]: Finished difference Result 282 states and 411 transitions. [2019-09-20 13:28:01,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:01,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-20 13:28:01,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:01,594 INFO L225 Difference]: With dead ends: 282 [2019-09-20 13:28:01,594 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:28:01,594 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:28:01,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:28:01,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-20 13:28:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:01,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2019-09-20 13:28:01,601 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 97 [2019-09-20 13:28:01,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:01,601 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2019-09-20 13:28:01,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:01,602 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2019-09-20 13:28:01,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-20 13:28:01,603 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:01,603 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] [2019-09-20 13:28:01,603 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:01,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:01,604 INFO L82 PathProgramCache]: Analyzing trace with hash -846445514, now seen corresponding path program 1 times [2019-09-20 13:28:01,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:01,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:01,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:01,696 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:28:01,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:01,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:01,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:01,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:01,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:01,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:01,698 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand 4 states. [2019-09-20 13:28:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:02,037 INFO L93 Difference]: Finished difference Result 295 states and 428 transitions. [2019-09-20 13:28:02,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:02,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-20 13:28:02,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:02,039 INFO L225 Difference]: With dead ends: 295 [2019-09-20 13:28:02,040 INFO L226 Difference]: Without dead ends: 295 [2019-09-20 13:28:02,040 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:28:02,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-20 13:28:02,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 260. [2019-09-20 13:28:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:02,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 381 transitions. [2019-09-20 13:28:02,046 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 381 transitions. Word has length 98 [2019-09-20 13:28:02,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:02,046 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 381 transitions. [2019-09-20 13:28:02,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:02,046 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 381 transitions. [2019-09-20 13:28:02,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-20 13:28:02,047 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:02,048 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] [2019-09-20 13:28:02,048 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:02,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:02,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1419935672, now seen corresponding path program 1 times [2019-09-20 13:28:02,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:02,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:02,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:02,123 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:28:02,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:02,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:02,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:02,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:02,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:02,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:02,126 INFO L87 Difference]: Start difference. First operand 260 states and 381 transitions. Second operand 4 states. [2019-09-20 13:28:02,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:02,390 INFO L93 Difference]: Finished difference Result 272 states and 397 transitions. [2019-09-20 13:28:02,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:02,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-20 13:28:02,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:02,393 INFO L225 Difference]: With dead ends: 272 [2019-09-20 13:28:02,393 INFO L226 Difference]: Without dead ends: 272 [2019-09-20 13:28:02,393 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:28:02,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-20 13:28:02,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2019-09-20 13:28:02,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:02,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 380 transitions. [2019-09-20 13:28:02,401 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 380 transitions. Word has length 98 [2019-09-20 13:28:02,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:02,401 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 380 transitions. [2019-09-20 13:28:02,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2019-09-20 13:28:02,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:02,402 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:02,403 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] [2019-09-20 13:28:02,403 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:02,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:02,403 INFO L82 PathProgramCache]: Analyzing trace with hash 228784092, now seen corresponding path program 1 times [2019-09-20 13:28:02,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:02,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:02,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:02,466 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:28:02,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:02,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:02,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:02,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:02,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:02,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:02,467 INFO L87 Difference]: Start difference. First operand 260 states and 380 transitions. Second operand 4 states. [2019-09-20 13:28:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:02,784 INFO L93 Difference]: Finished difference Result 295 states and 426 transitions. [2019-09-20 13:28:02,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:02,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:02,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:02,786 INFO L225 Difference]: With dead ends: 295 [2019-09-20 13:28:02,786 INFO L226 Difference]: Without dead ends: 295 [2019-09-20 13:28:02,786 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:28:02,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-20 13:28:02,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 260. [2019-09-20 13:28:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 379 transitions. [2019-09-20 13:28:02,794 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 379 transitions. Word has length 102 [2019-09-20 13:28:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:02,794 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 379 transitions. [2019-09-20 13:28:02,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 379 transitions. [2019-09-20 13:28:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:02,796 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:02,796 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] [2019-09-20 13:28:02,796 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:02,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:02,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1615569502, now seen corresponding path program 1 times [2019-09-20 13:28:02,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:02,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:02,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:02,866 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:28:02,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:02,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:02,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:02,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:02,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:02,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:02,868 INFO L87 Difference]: Start difference. First operand 260 states and 379 transitions. Second operand 3 states. [2019-09-20 13:28:02,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:02,916 INFO L93 Difference]: Finished difference Result 493 states and 723 transitions. [2019-09-20 13:28:02,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:02,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-20 13:28:02,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:02,919 INFO L225 Difference]: With dead ends: 493 [2019-09-20 13:28:02,919 INFO L226 Difference]: Without dead ends: 493 [2019-09-20 13:28:02,920 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:28:02,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-20 13:28:02,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-09-20 13:28:02,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-09-20 13:28:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 723 transitions. [2019-09-20 13:28:02,928 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 723 transitions. Word has length 102 [2019-09-20 13:28:02,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:02,929 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 723 transitions. [2019-09-20 13:28:02,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 723 transitions. [2019-09-20 13:28:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:28:02,930 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:02,930 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] [2019-09-20 13:28:02,931 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:02,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:02,931 INFO L82 PathProgramCache]: Analyzing trace with hash -929123768, now seen corresponding path program 1 times [2019-09-20 13:28:02,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:02,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:02,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:02,989 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:02,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:02,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:02,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:02,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:02,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:02,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:02,991 INFO L87 Difference]: Start difference. First operand 493 states and 723 transitions. Second operand 3 states. [2019-09-20 13:28:03,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:03,040 INFO L93 Difference]: Finished difference Result 728 states and 1072 transitions. [2019-09-20 13:28:03,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:03,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-20 13:28:03,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:03,044 INFO L225 Difference]: With dead ends: 728 [2019-09-20 13:28:03,045 INFO L226 Difference]: Without dead ends: 728 [2019-09-20 13:28:03,045 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:28:03,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-09-20 13:28:03,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2019-09-20 13:28:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-09-20 13:28:03,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1071 transitions. [2019-09-20 13:28:03,059 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1071 transitions. Word has length 104 [2019-09-20 13:28:03,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:03,059 INFO L475 AbstractCegarLoop]: Abstraction has 726 states and 1071 transitions. [2019-09-20 13:28:03,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:03,059 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1071 transitions. [2019-09-20 13:28:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-20 13:28:03,061 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:03,062 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] [2019-09-20 13:28:03,062 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:03,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:03,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1433035977, now seen corresponding path program 1 times [2019-09-20 13:28:03,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:03,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:03,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:03,129 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:03,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:03,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:03,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:03,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:03,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:03,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:03,131 INFO L87 Difference]: Start difference. First operand 726 states and 1071 transitions. Second operand 3 states. [2019-09-20 13:28:03,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:03,188 INFO L93 Difference]: Finished difference Result 961 states and 1406 transitions. [2019-09-20 13:28:03,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:03,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-20 13:28:03,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:03,193 INFO L225 Difference]: With dead ends: 961 [2019-09-20 13:28:03,193 INFO L226 Difference]: Without dead ends: 961 [2019-09-20 13:28:03,193 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:28:03,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-09-20 13:28:03,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2019-09-20 13:28:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-09-20 13:28:03,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1405 transitions. [2019-09-20 13:28:03,209 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1405 transitions. Word has length 111 [2019-09-20 13:28:03,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:03,209 INFO L475 AbstractCegarLoop]: Abstraction has 959 states and 1405 transitions. [2019-09-20 13:28:03,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:03,210 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1405 transitions. [2019-09-20 13:28:03,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-20 13:28:03,212 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:03,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:03,212 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:03,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:03,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1705492387, now seen corresponding path program 1 times [2019-09-20 13:28:03,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:03,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:03,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:03,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:03,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:03,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:03,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:03,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:03,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:03,329 INFO L87 Difference]: Start difference. First operand 959 states and 1405 transitions. Second operand 4 states. [2019-09-20 13:28:03,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:03,756 INFO L93 Difference]: Finished difference Result 1369 states and 2020 transitions. [2019-09-20 13:28:03,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:03,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-20 13:28:03,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:03,762 INFO L225 Difference]: With dead ends: 1369 [2019-09-20 13:28:03,763 INFO L226 Difference]: Without dead ends: 1369 [2019-09-20 13:28:03,763 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:28:03,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2019-09-20 13:28:03,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1115. [2019-09-20 13:28:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-09-20 13:28:03,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1689 transitions. [2019-09-20 13:28:03,784 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1689 transitions. Word has length 128 [2019-09-20 13:28:03,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:03,785 INFO L475 AbstractCegarLoop]: Abstraction has 1115 states and 1689 transitions. [2019-09-20 13:28:03,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:03,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1689 transitions. [2019-09-20 13:28:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-20 13:28:03,787 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:03,788 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:03,788 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:03,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:03,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1113473743, now seen corresponding path program 1 times [2019-09-20 13:28:03,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:03,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:03,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:03,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:03,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:03,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:03,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:03,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:03,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:03,864 INFO L87 Difference]: Start difference. First operand 1115 states and 1689 transitions. Second operand 4 states. [2019-09-20 13:28:04,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:04,310 INFO L93 Difference]: Finished difference Result 1343 states and 1984 transitions. [2019-09-20 13:28:04,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:04,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-20 13:28:04,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:04,316 INFO L225 Difference]: With dead ends: 1343 [2019-09-20 13:28:04,317 INFO L226 Difference]: Without dead ends: 1343 [2019-09-20 13:28:04,317 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:28:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2019-09-20 13:28:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1075. [2019-09-20 13:28:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-09-20 13:28:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1613 transitions. [2019-09-20 13:28:04,338 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1613 transitions. Word has length 129 [2019-09-20 13:28:04,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:04,338 INFO L475 AbstractCegarLoop]: Abstraction has 1075 states and 1613 transitions. [2019-09-20 13:28:04,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:04,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1613 transitions. [2019-09-20 13:28:04,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-20 13:28:04,341 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:04,341 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:04,342 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:04,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:04,342 INFO L82 PathProgramCache]: Analyzing trace with hash -502838968, now seen corresponding path program 1 times [2019-09-20 13:28:04,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:04,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:04,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 13:28:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 13:28:04,816 INFO L474 BasicCegarLoop]: Counterexample might be feasible [2019-09-20 13:28:04,888 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:28:04,890 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967312 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:28:05,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:28:05 BoogieIcfgContainer [2019-09-20 13:28:05,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:28:05,022 INFO L168 Benchmark]: Toolchain (without parser) took 22329.52 ms. Allocated memory was 141.0 MB in the beginning and 514.9 MB in the end (delta: 373.8 MB). Free memory was 85.3 MB in the beginning and 208.3 MB in the end (delta: -123.0 MB). Peak memory consumption was 250.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:28:05,023 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 105.9 MB in the beginning and 105.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:28:05,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 900.45 ms. Allocated memory was 141.0 MB in the beginning and 201.9 MB in the end (delta: 60.8 MB). Free memory was 84.8 MB in the beginning and 158.1 MB in the end (delta: -73.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:28:05,030 INFO L168 Benchmark]: Boogie Preprocessor took 181.43 ms. Allocated memory is still 201.9 MB. Free memory was 158.1 MB in the beginning and 149.9 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:28:05,030 INFO L168 Benchmark]: RCFGBuilder took 1583.92 ms. Allocated memory was 201.9 MB in the beginning and 228.1 MB in the end (delta: 26.2 MB). Free memory was 149.9 MB in the beginning and 165.6 MB in the end (delta: -15.7 MB). Peak memory consumption was 79.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:28:05,031 INFO L168 Benchmark]: TraceAbstraction took 19656.89 ms. Allocated memory was 228.1 MB in the beginning and 514.9 MB in the end (delta: 286.8 MB). Free memory was 165.6 MB in the beginning and 208.3 MB in the end (delta: -42.6 MB). Peak memory consumption was 244.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:28:05,039 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.22 ms. Allocated memory is still 141.0 MB. Free memory was 105.9 MB in the beginning and 105.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 900.45 ms. Allocated memory was 141.0 MB in the beginning and 201.9 MB in the end (delta: 60.8 MB). Free memory was 84.8 MB in the beginning and 158.1 MB in the end (delta: -73.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 181.43 ms. Allocated memory is still 201.9 MB. Free memory was 158.1 MB in the beginning and 149.9 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1583.92 ms. Allocated memory was 201.9 MB in the beginning and 228.1 MB in the end (delta: 26.2 MB). Free memory was 149.9 MB in the beginning and 165.6 MB in the end (delta: -15.7 MB). Peak memory consumption was 79.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19656.89 ms. Allocated memory was 228.1 MB in the beginning and 514.9 MB in the end (delta: 286.8 MB). Free memory was 165.6 MB in the beginning and 208.3 MB in the end (delta: -42.6 MB). Peak memory consumption was 244.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967312 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: 1726]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1444. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=4294967329, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={-3: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)) VAL [init=1, malloc(sizeof(SSL))={7:0}, malloc(sizeof(SSL_CTX))={5:0}, malloc(sizeof(SSL_SESSION))={-1:0}, malloc(sizeof(struct ssl3_state_st))={1:0}, s={7:0}, SSLv3_server_data={-3:0}] [L1074] CALL ssl3_accept(s) VAL [init=1, s={7:0}, SSLv3_server_data={-3:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [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={7:0}, s={7:0}, s->info_callback={3:4294967293}, skip=0, SSLv3_server_data={-3:0}, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1130] EXPR s->cert VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={7:0}, s={7:0}, s->cert={6:-5}, skip=0, SSLv3_server_data={-3:0}, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={-3:0}, state=8464, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={-3:0}, state=8464, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={-3:0}, state=8464, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={-3:0}, state=8464, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={-3:0}, state=8464, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={-3:0}, state=8464, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={-3:0}, state=8464, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={-3:0}, state=8464, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={-3:0}, state=8464, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8464, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8464, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={0:0}, (s->s3)->tmp.reuse_message=4294967320, blastFlag=1, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->s3={1:0}, skip=0, SSLv3_server_data={-3:0}, state=8464, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8464, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8464, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={-3:0}, state=8496, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={-3:0}, state=8496, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={-3:0}, state=8496, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={-3:0}, state=8496, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={-3:0}, state=8496, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={-3:0}, state=8496, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={-3:0}, state=8496, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={-3:0}, state=8496, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={-3:0}, state=8496, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={-3:0}, state=8496, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={-3:0}, state=8496, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={-3:0}, state=8496, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8496, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->hit=0, skip=0, SSLv3_server_data={-3:0}, state=8496, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8496, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1357] s->init_num = 0 VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8496, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={0:0}, (s->s3)->tmp.reuse_message=4294967320, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->s3={1:0}, skip=0, SSLv3_server_data={-3:0}, state=8496, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8496, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8496, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:0}, ((s->s3)->tmp.new_cipher)->algorithms=4294967300, (s->s3)->tmp.new_cipher={1:859}, blastFlag=2, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->s3={1:0}, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1361] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1364] ret = __VERIFIER_nondet_int() [L1365] COND TRUE blastFlag == 2 [L1366] blastFlag = 6 VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1370] COND FALSE !(ret <= 0) VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1376] s->state = 8528 [L1377] s->init_num = 0 VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={0:0}, (s->s3)->tmp.reuse_message=4294967320, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->s3={1:0}, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8512, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, ret=1, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND TRUE s->state == 8528 [L1381] EXPR s->s3 [L1381] EXPR (s->s3)->tmp.new_cipher [L1381] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1381] l = ((s->s3)->tmp.new_cipher)->algorithms [L1382] EXPR s->options VAL [={0:0}, blastFlag=6, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->options=4294967317, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1382] COND TRUE s->options & 2097152UL [L1383] EXPR s->s3 [L1383] (s->s3)->tmp.use_rsa_tmp = 1 [L1387] EXPR s->s3 [L1387] (s->s3)->tmp.use_rsa_tmp VAL [={0:0}, (s->s3)->tmp.use_rsa_tmp=1, blastFlag=6, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->s3={1:0}, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1387] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1405] ret = __VERIFIER_nondet_int() [L1406] COND TRUE blastFlag == 6 [L1407] blastFlag = 7 VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1411] COND FALSE !(ret <= 0) VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1428] s->state = 8544 [L1429] s->init_num = 0 VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={0:0}, (s->s3)->tmp.reuse_message=4294967320, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->s3={1:0}, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8528, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND TRUE s->state == 8544 [L1433] EXPR s->verify_mode VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->verify_mode=4294967298, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer VAL [={0:0}, (s->session)->peer={4294967294:2}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->session={-1:0}, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1434] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1444] EXPR s->s3 [L1444] EXPR (s->s3)->tmp.new_cipher [L1444] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:0}, ((s->s3)->tmp.new_cipher)->algorithms=1, (s->s3)->tmp.new_cipher={1:859}, blastFlag=7, got_new_session=1, init=1, l=4, ret=1, s={7:0}, s={7:0}, s->s3={1:0}, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1444] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.cert_request = 1 [L1455] ret = __VERIFIER_nondet_int() [L1456] COND TRUE blastFlag == 7 VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=0, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1726] __VERIFIER_error() VAL [={0:0}, blastFlag=7, got_new_session=1, init=1, l=4, ret=0, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={-3:0}, state=8544, Time=2, tmp=2, tmp___1=2, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 186 locations, 1 error locations. UNSAFE Result, 19.6s OverallTime, 44 OverallIterations, 5 TraceHistogramMax, 14.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9129 SDtfs, 2709 SDslu, 12855 SDs, 0 SdLazy, 7630 SolverSat, 392 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 92 SyntacticMatches, 34 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1115occurred in iteration=42, 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, 43 MinimizatonAttempts, 1548 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 3675 NumberOfCodeBlocks, 3675 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3499 ConstructedInterpolants, 0 QuantifiedInterpolants, 917589 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 PerfectInterpolantSequences, 1929/1929 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...