java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_clnt.blast.01.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:04:50,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:04:50,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:04:50,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:04:50,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:04:50,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:04:50,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:04:50,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:04:50,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:04:50,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:04:50,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:04:50,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:04:50,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:04:50,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:04:50,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:04:50,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:04:50,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:04:50,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:04:50,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:04:50,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:04:50,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:04:50,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:04:50,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:04:50,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:04:50,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:04:50,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:04:50,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:04:50,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:04:50,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:04:50,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:04:50,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:04:50,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:04:50,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:04:50,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:04:50,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:04:50,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:04:50,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:04:50,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:04:50,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:04:50,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:04:50,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:04:50,729 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-16 17:04:50,744 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:04:50,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:04:50,745 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:04:50,745 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:04:50,746 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:04:50,746 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:04:50,746 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:04:50,746 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:04:50,746 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:04:50,747 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:04:50,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:04:50,747 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:04:50,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:04:50,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:04:50,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:04:50,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:04:50,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:04:50,749 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:04:50,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:04:50,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:04:50,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:04:50,749 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:04:50,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:04:50,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:50,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:04:50,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:04:50,752 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:04:50,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:04:50,752 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:04:50,752 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:04:50,781 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:04:50,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:04:50,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:04:50,797 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:04:50,798 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:04:50,798 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_clnt.blast.01.i.cil-1.c [2019-09-16 17:04:50,862 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a4838f09/193b3d2167a74842b6f4cf32121d4153/FLAG1f2316ee7 [2019-09-16 17:04:51,435 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:04:51,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_clnt.blast.01.i.cil-1.c [2019-09-16 17:04:51,462 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a4838f09/193b3d2167a74842b6f4cf32121d4153/FLAG1f2316ee7 [2019-09-16 17:04:51,716 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a4838f09/193b3d2167a74842b6f4cf32121d4153 [2019-09-16 17:04:51,727 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:04:51,728 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:04:51,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:51,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:04:51,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:04:51,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:51" (1/1) ... [2019-09-16 17:04:51,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f7b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:51, skipping insertion in model container [2019-09-16 17:04:51,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:51" (1/1) ... [2019-09-16 17:04:51,745 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:04:51,818 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:04:52,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:52,503 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:04:52,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:52,785 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:04:52,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:52 WrapperNode [2019-09-16 17:04:52,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:52,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:04:52,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:04:52,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:04:52,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:52" (1/1) ... [2019-09-16 17:04:52,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:52" (1/1) ... [2019-09-16 17:04:52,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:52" (1/1) ... [2019-09-16 17:04:52,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:52" (1/1) ... [2019-09-16 17:04:52,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:52" (1/1) ... [2019-09-16 17:04:52,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:52" (1/1) ... [2019-09-16 17:04:52,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:52" (1/1) ... [2019-09-16 17:04:52,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:04:52,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:04:52,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:04:52,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:04:52,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:53,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:04:53,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:04:53,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-16 17:04:53,055 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-16 17:04:53,055 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:04:53,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-16 17:04:53,055 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-16 17:04:53,056 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-16 17:04:53,056 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-16 17:04:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:04:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 17:04:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 17:04:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:04:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:04:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:04:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-16 17:04:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-16 17:04:53,060 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-16 17:04:53,060 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-16 17:04:53,060 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-16 17:04:53,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-16 17:04:53,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:04:53,061 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:04:53,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 17:04:53,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:04:53,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:04:53,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:04:53,062 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 17:04:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-16 17:04:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:04:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:04:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:04:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:04:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:04:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-16 17:04:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-16 17:04:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-16 17:04:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-16 17:04:53,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:04:53,560 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:04:54,124 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-16 17:04:54,124 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-16 17:04:54,142 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:04:54,142 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:04:54,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:54 BoogieIcfgContainer [2019-09-16 17:04:54,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:04:54,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:04:54,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:04:54,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:04:54,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:04:51" (1/3) ... [2019-09-16 17:04:54,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbd9cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:54, skipping insertion in model container [2019-09-16 17:04:54,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:52" (2/3) ... [2019-09-16 17:04:54,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbd9cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:54, skipping insertion in model container [2019-09-16 17:04:54,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:54" (3/3) ... [2019-09-16 17:04:54,151 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-1.c [2019-09-16 17:04:54,160 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:04:54,168 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:04:54,185 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:04:54,211 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:04:54,211 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:04:54,211 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:04:54,212 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:04:54,212 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:04:54,212 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:04:54,212 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:04:54,212 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:04:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-09-16 17:04:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 17:04:54,241 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:54,242 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:54,244 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:54,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:54,250 INFO L82 PathProgramCache]: Analyzing trace with hash -475475995, now seen corresponding path program 1 times [2019-09-16 17:04:54,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:54,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:54,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:54,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:54,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:54,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:54,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:54,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:54,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:54,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:54,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:54,652 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-09-16 17:04:54,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:54,764 INFO L93 Difference]: Finished difference Result 258 states and 416 transitions. [2019-09-16 17:04:54,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:54,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 17:04:54,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:54,792 INFO L225 Difference]: With dead ends: 258 [2019-09-16 17:04:54,792 INFO L226 Difference]: Without dead ends: 223 [2019-09-16 17:04:54,797 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:54,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-16 17:04:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-09-16 17:04:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-16 17:04:54,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2019-09-16 17:04:54,907 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2019-09-16 17:04:54,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:54,908 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2019-09-16 17:04:54,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2019-09-16 17:04:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-16 17:04:54,919 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:54,919 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:54,919 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:54,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:54,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1406579372, now seen corresponding path program 1 times [2019-09-16 17:04:54,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:54,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:54,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:54,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:54,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:55,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:55,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:55,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:55,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:55,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:55,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:55,110 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand 3 states. [2019-09-16 17:04:55,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:55,183 INFO L93 Difference]: Finished difference Result 325 states and 476 transitions. [2019-09-16 17:04:55,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:55,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-16 17:04:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:55,187 INFO L225 Difference]: With dead ends: 325 [2019-09-16 17:04:55,187 INFO L226 Difference]: Without dead ends: 325 [2019-09-16 17:04:55,188 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:55,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-16 17:04:55,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2019-09-16 17:04:55,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-16 17:04:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2019-09-16 17:04:55,219 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2019-09-16 17:04:55,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:55,221 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2019-09-16 17:04:55,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2019-09-16 17:04:55,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:04:55,229 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:55,229 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:55,230 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:55,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:55,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1246827421, now seen corresponding path program 1 times [2019-09-16 17:04:55,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:55,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:55,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:55,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:55,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:55,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:55,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:55,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:55,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:55,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:55,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:55,395 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand 4 states. [2019-09-16 17:04:55,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:55,917 INFO L93 Difference]: Finished difference Result 513 states and 755 transitions. [2019-09-16 17:04:55,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:55,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:04:55,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:55,921 INFO L225 Difference]: With dead ends: 513 [2019-09-16 17:04:55,921 INFO L226 Difference]: Without dead ends: 513 [2019-09-16 17:04:55,921 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:55,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-16 17:04:55,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2019-09-16 17:04:55,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-16 17:04:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2019-09-16 17:04:55,935 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2019-09-16 17:04:55,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:55,936 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2019-09-16 17:04:55,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:55,936 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2019-09-16 17:04:55,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:04:55,938 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:55,938 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:55,938 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:55,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:55,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1380840927, now seen corresponding path program 1 times [2019-09-16 17:04:55,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:55,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:55,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:55,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:55,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:56,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:56,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:56,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:56,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:56,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:56,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:56,032 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand 4 states. [2019-09-16 17:04:56,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:56,381 INFO L93 Difference]: Finished difference Result 459 states and 685 transitions. [2019-09-16 17:04:56,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:56,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:04:56,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:56,385 INFO L225 Difference]: With dead ends: 459 [2019-09-16 17:04:56,385 INFO L226 Difference]: Without dead ends: 459 [2019-09-16 17:04:56,385 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-16 17:04:56,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2019-09-16 17:04:56,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-16 17:04:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2019-09-16 17:04:56,396 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2019-09-16 17:04:56,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:56,396 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2019-09-16 17:04:56,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2019-09-16 17:04:56,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 17:04:56,398 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:56,398 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:56,399 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:56,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:56,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1362278, now seen corresponding path program 1 times [2019-09-16 17:04:56,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:56,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:56,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:56,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:56,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:56,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:56,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:56,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:56,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:56,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:56,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:56,529 INFO L87 Difference]: Start difference. First operand 415 states and 630 transitions. Second operand 4 states. [2019-09-16 17:04:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:56,981 INFO L93 Difference]: Finished difference Result 545 states and 813 transitions. [2019-09-16 17:04:56,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:56,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-16 17:04:56,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:56,986 INFO L225 Difference]: With dead ends: 545 [2019-09-16 17:04:56,986 INFO L226 Difference]: Without dead ends: 545 [2019-09-16 17:04:56,987 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:56,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-09-16 17:04:56,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 417. [2019-09-16 17:04:56,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:04:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 632 transitions. [2019-09-16 17:04:56,999 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 632 transitions. Word has length 64 [2019-09-16 17:04:56,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:56,999 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 632 transitions. [2019-09-16 17:04:57,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 632 transitions. [2019-09-16 17:04:57,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:04:57,002 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:57,002 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:57,002 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:57,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:57,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1565875409, now seen corresponding path program 1 times [2019-09-16 17:04:57,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:57,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:57,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:57,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:57,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:57,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:57,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:57,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:57,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:57,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:57,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:57,114 INFO L87 Difference]: Start difference. First operand 417 states and 632 transitions. Second operand 4 states. [2019-09-16 17:04:57,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:57,593 INFO L93 Difference]: Finished difference Result 543 states and 809 transitions. [2019-09-16 17:04:57,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:57,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:04:57,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:57,598 INFO L225 Difference]: With dead ends: 543 [2019-09-16 17:04:57,599 INFO L226 Difference]: Without dead ends: 543 [2019-09-16 17:04:57,599 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:57,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-16 17:04:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 417. [2019-09-16 17:04:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:04:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 630 transitions. [2019-09-16 17:04:57,611 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 630 transitions. Word has length 78 [2019-09-16 17:04:57,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:57,611 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 630 transitions. [2019-09-16 17:04:57,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 630 transitions. [2019-09-16 17:04:57,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:04:57,613 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:57,613 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:57,613 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:57,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:57,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1584530867, now seen corresponding path program 1 times [2019-09-16 17:04:57,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:57,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:57,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:57,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:57,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:57,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:57,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:57,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:57,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:57,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:57,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:57,693 INFO L87 Difference]: Start difference. First operand 417 states and 630 transitions. Second operand 4 states. [2019-09-16 17:04:58,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:58,123 INFO L93 Difference]: Finished difference Result 543 states and 807 transitions. [2019-09-16 17:04:58,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:58,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:04:58,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:58,129 INFO L225 Difference]: With dead ends: 543 [2019-09-16 17:04:58,129 INFO L226 Difference]: Without dead ends: 543 [2019-09-16 17:04:58,130 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-16 17:04:58,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 417. [2019-09-16 17:04:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:04:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 628 transitions. [2019-09-16 17:04:58,145 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 628 transitions. Word has length 78 [2019-09-16 17:04:58,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:58,146 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 628 transitions. [2019-09-16 17:04:58,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:58,146 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 628 transitions. [2019-09-16 17:04:58,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:04:58,153 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:58,153 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:58,153 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:58,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:58,154 INFO L82 PathProgramCache]: Analyzing trace with hash 2004935792, now seen corresponding path program 1 times [2019-09-16 17:04:58,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:58,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:58,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:58,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:58,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:58,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:58,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:58,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:58,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:58,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:58,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:58,243 INFO L87 Difference]: Start difference. First operand 417 states and 628 transitions. Second operand 4 states. [2019-09-16 17:04:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:58,664 INFO L93 Difference]: Finished difference Result 543 states and 805 transitions. [2019-09-16 17:04:58,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:58,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:04:58,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:58,667 INFO L225 Difference]: With dead ends: 543 [2019-09-16 17:04:58,668 INFO L226 Difference]: Without dead ends: 543 [2019-09-16 17:04:58,668 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:58,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-16 17:04:58,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 417. [2019-09-16 17:04:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:04:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 626 transitions. [2019-09-16 17:04:58,679 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 626 transitions. Word has length 78 [2019-09-16 17:04:58,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:58,680 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 626 transitions. [2019-09-16 17:04:58,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:58,680 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 626 transitions. [2019-09-16 17:04:58,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:04:58,681 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:58,681 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:58,682 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:58,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:58,682 INFO L82 PathProgramCache]: Analyzing trace with hash 883724721, now seen corresponding path program 1 times [2019-09-16 17:04:58,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:58,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:58,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:58,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:58,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:58,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:58,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:58,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:58,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:58,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:58,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:58,763 INFO L87 Difference]: Start difference. First operand 417 states and 626 transitions. Second operand 4 states. [2019-09-16 17:04:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:59,045 INFO L93 Difference]: Finished difference Result 459 states and 677 transitions. [2019-09-16 17:04:59,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:59,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:04:59,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:59,055 INFO L225 Difference]: With dead ends: 459 [2019-09-16 17:04:59,056 INFO L226 Difference]: Without dead ends: 459 [2019-09-16 17:04:59,056 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:59,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-16 17:04:59,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2019-09-16 17:04:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:04:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 624 transitions. [2019-09-16 17:04:59,068 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 624 transitions. Word has length 78 [2019-09-16 17:04:59,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:59,069 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 624 transitions. [2019-09-16 17:04:59,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 624 transitions. [2019-09-16 17:04:59,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:04:59,071 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:59,071 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:59,071 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:59,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:59,072 INFO L82 PathProgramCache]: Analyzing trace with hash 865069263, now seen corresponding path program 1 times [2019-09-16 17:04:59,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:59,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:59,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:59,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:59,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:59,165 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:59,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:59,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:59,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:59,167 INFO L87 Difference]: Start difference. First operand 417 states and 624 transitions. Second operand 4 states. [2019-09-16 17:04:59,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:59,492 INFO L93 Difference]: Finished difference Result 459 states and 675 transitions. [2019-09-16 17:04:59,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:59,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:04:59,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:59,495 INFO L225 Difference]: With dead ends: 459 [2019-09-16 17:04:59,495 INFO L226 Difference]: Without dead ends: 459 [2019-09-16 17:04:59,496 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:59,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-16 17:04:59,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2019-09-16 17:04:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:04:59,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 622 transitions. [2019-09-16 17:04:59,509 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 622 transitions. Word has length 78 [2019-09-16 17:04:59,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:59,510 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 622 transitions. [2019-09-16 17:04:59,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 622 transitions. [2019-09-16 17:04:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:04:59,511 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:59,512 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:59,512 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:59,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:59,512 INFO L82 PathProgramCache]: Analyzing trace with hash 159568626, now seen corresponding path program 1 times [2019-09-16 17:04:59,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:59,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:59,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:59,577 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:59,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:59,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:59,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:59,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:59,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:59,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:59,580 INFO L87 Difference]: Start difference. First operand 417 states and 622 transitions. Second operand 4 states. [2019-09-16 17:04:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:59,879 INFO L93 Difference]: Finished difference Result 459 states and 673 transitions. [2019-09-16 17:04:59,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:59,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:04:59,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:59,883 INFO L225 Difference]: With dead ends: 459 [2019-09-16 17:04:59,883 INFO L226 Difference]: Without dead ends: 459 [2019-09-16 17:04:59,884 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-16 17:04:59,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2019-09-16 17:04:59,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:04:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 620 transitions. [2019-09-16 17:04:59,896 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 620 transitions. Word has length 78 [2019-09-16 17:04:59,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:59,897 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 620 transitions. [2019-09-16 17:04:59,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:59,897 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 620 transitions. [2019-09-16 17:04:59,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:04:59,899 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:59,899 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:59,900 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:59,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:59,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1402249354, now seen corresponding path program 1 times [2019-09-16 17:04:59,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:59,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:59,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:59,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:59,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:59,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:59,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:59,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:59,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:00,000 INFO L87 Difference]: Start difference. First operand 417 states and 620 transitions. Second operand 4 states. [2019-09-16 17:05:00,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:00,458 INFO L93 Difference]: Finished difference Result 543 states and 797 transitions. [2019-09-16 17:05:00,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:00,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:00,462 INFO L225 Difference]: With dead ends: 543 [2019-09-16 17:05:00,462 INFO L226 Difference]: Without dead ends: 543 [2019-09-16 17:05:00,462 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:00,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-16 17:05:00,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 417. [2019-09-16 17:05:00,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:05:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 618 transitions. [2019-09-16 17:05:00,474 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 618 transitions. Word has length 79 [2019-09-16 17:05:00,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:00,474 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 618 transitions. [2019-09-16 17:05:00,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:00,475 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 618 transitions. [2019-09-16 17:05:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:00,476 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:00,476 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:00,477 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:00,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:00,477 INFO L82 PathProgramCache]: Analyzing trace with hash 653759193, now seen corresponding path program 1 times [2019-09-16 17:05:00,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:00,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:00,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:00,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:00,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:00,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:00,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:00,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:00,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:00,577 INFO L87 Difference]: Start difference. First operand 417 states and 618 transitions. Second operand 4 states. [2019-09-16 17:05:01,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:01,007 INFO L93 Difference]: Finished difference Result 537 states and 788 transitions. [2019-09-16 17:05:01,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:01,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:01,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:01,011 INFO L225 Difference]: With dead ends: 537 [2019-09-16 17:05:01,011 INFO L226 Difference]: Without dead ends: 537 [2019-09-16 17:05:01,011 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:01,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-16 17:05:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 417. [2019-09-16 17:05:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:05:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 616 transitions. [2019-09-16 17:05:01,027 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 616 transitions. Word has length 79 [2019-09-16 17:05:01,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:01,028 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 616 transitions. [2019-09-16 17:05:01,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:01,028 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 616 transitions. [2019-09-16 17:05:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:01,030 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:01,031 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:01,031 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:01,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:01,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1520910644, now seen corresponding path program 1 times [2019-09-16 17:05:01,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:01,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:01,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:01,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:01,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:01,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:01,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:01,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:01,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:01,119 INFO L87 Difference]: Start difference. First operand 417 states and 616 transitions. Second operand 4 states. [2019-09-16 17:05:01,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:01,447 INFO L93 Difference]: Finished difference Result 459 states and 667 transitions. [2019-09-16 17:05:01,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:01,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:01,450 INFO L225 Difference]: With dead ends: 459 [2019-09-16 17:05:01,450 INFO L226 Difference]: Without dead ends: 459 [2019-09-16 17:05:01,451 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:01,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-16 17:05:01,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2019-09-16 17:05:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:05:01,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 614 transitions. [2019-09-16 17:05:01,461 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 614 transitions. Word has length 79 [2019-09-16 17:05:01,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:01,461 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 614 transitions. [2019-09-16 17:05:01,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:01,461 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 614 transitions. [2019-09-16 17:05:01,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:01,463 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:01,463 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:01,463 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:01,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:01,464 INFO L82 PathProgramCache]: Analyzing trace with hash -718048105, now seen corresponding path program 1 times [2019-09-16 17:05:01,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:01,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:01,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:01,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:01,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:01,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:01,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:01,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:01,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:01,533 INFO L87 Difference]: Start difference. First operand 417 states and 614 transitions. Second operand 4 states. [2019-09-16 17:05:01,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:01,814 INFO L93 Difference]: Finished difference Result 453 states and 658 transitions. [2019-09-16 17:05:01,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:01,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:01,817 INFO L225 Difference]: With dead ends: 453 [2019-09-16 17:05:01,817 INFO L226 Difference]: Without dead ends: 453 [2019-09-16 17:05:01,817 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-16 17:05:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 417. [2019-09-16 17:05:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:05:01,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 612 transitions. [2019-09-16 17:05:01,828 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 612 transitions. Word has length 79 [2019-09-16 17:05:01,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:01,828 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 612 transitions. [2019-09-16 17:05:01,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:01,829 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 612 transitions. [2019-09-16 17:05:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:05:01,830 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:01,830 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:01,831 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:01,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:01,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1707509938, now seen corresponding path program 1 times [2019-09-16 17:05:01,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:01,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:01,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:01,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:01,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:01,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:01,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:01,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:01,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:01,909 INFO L87 Difference]: Start difference. First operand 417 states and 612 transitions. Second operand 4 states. [2019-09-16 17:05:02,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:02,406 INFO L93 Difference]: Finished difference Result 537 states and 782 transitions. [2019-09-16 17:05:02,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:02,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:05:02,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:02,410 INFO L225 Difference]: With dead ends: 537 [2019-09-16 17:05:02,410 INFO L226 Difference]: Without dead ends: 537 [2019-09-16 17:05:02,410 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-16 17:05:02,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 417. [2019-09-16 17:05:02,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:05:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 610 transitions. [2019-09-16 17:05:02,424 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 610 transitions. Word has length 80 [2019-09-16 17:05:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:02,424 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 610 transitions. [2019-09-16 17:05:02,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:02,424 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 610 transitions. [2019-09-16 17:05:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:05:02,426 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:02,426 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:02,426 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:02,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:02,427 INFO L82 PathProgramCache]: Analyzing trace with hash 2131156660, now seen corresponding path program 1 times [2019-09-16 17:05:02,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:02,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:02,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:02,510 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:02,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:02,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:02,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:02,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:02,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:02,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:02,512 INFO L87 Difference]: Start difference. First operand 417 states and 610 transitions. Second operand 4 states. [2019-09-16 17:05:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:02,798 INFO L93 Difference]: Finished difference Result 453 states and 654 transitions. [2019-09-16 17:05:02,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:02,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:05:02,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:02,807 INFO L225 Difference]: With dead ends: 453 [2019-09-16 17:05:02,807 INFO L226 Difference]: Without dead ends: 453 [2019-09-16 17:05:02,808 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:02,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-16 17:05:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 417. [2019-09-16 17:05:02,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:05:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 608 transitions. [2019-09-16 17:05:02,818 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 608 transitions. Word has length 80 [2019-09-16 17:05:02,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:02,818 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 608 transitions. [2019-09-16 17:05:02,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:02,818 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 608 transitions. [2019-09-16 17:05:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:02,820 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:02,820 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:02,820 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:02,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:02,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1079799867, now seen corresponding path program 1 times [2019-09-16 17:05:02,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:02,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:02,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:02,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:02,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:02,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:02,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:02,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:02,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:02,883 INFO L87 Difference]: Start difference. First operand 417 states and 608 transitions. Second operand 4 states. [2019-09-16 17:05:03,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:03,237 INFO L93 Difference]: Finished difference Result 519 states and 756 transitions. [2019-09-16 17:05:03,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:03,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:05:03,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:03,242 INFO L225 Difference]: With dead ends: 519 [2019-09-16 17:05:03,242 INFO L226 Difference]: Without dead ends: 519 [2019-09-16 17:05:03,243 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:03,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-09-16 17:05:03,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 417. [2019-09-16 17:05:03,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:05:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 606 transitions. [2019-09-16 17:05:03,254 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 606 transitions. Word has length 81 [2019-09-16 17:05:03,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:03,254 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 606 transitions. [2019-09-16 17:05:03,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 606 transitions. [2019-09-16 17:05:03,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:03,256 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:03,256 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:03,256 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:03,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:03,257 INFO L82 PathProgramCache]: Analyzing trace with hash -611627124, now seen corresponding path program 1 times [2019-09-16 17:05:03,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:03,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:03,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:03,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:03,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:03,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:03,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:03,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:03,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:03,322 INFO L87 Difference]: Start difference. First operand 417 states and 606 transitions. Second operand 4 states. [2019-09-16 17:05:03,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:03,787 INFO L93 Difference]: Finished difference Result 519 states and 754 transitions. [2019-09-16 17:05:03,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:03,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:05:03,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:03,792 INFO L225 Difference]: With dead ends: 519 [2019-09-16 17:05:03,793 INFO L226 Difference]: Without dead ends: 519 [2019-09-16 17:05:03,793 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-09-16 17:05:03,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 417. [2019-09-16 17:05:03,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:05:03,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 604 transitions. [2019-09-16 17:05:03,809 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 604 transitions. Word has length 81 [2019-09-16 17:05:03,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:03,809 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 604 transitions. [2019-09-16 17:05:03,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 604 transitions. [2019-09-16 17:05:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:03,812 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:03,812 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:03,813 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:03,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:03,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1327946361, now seen corresponding path program 1 times [2019-09-16 17:05:03,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:03,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:03,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:03,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:03,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:03,895 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:03,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:03,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:03,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:03,897 INFO L87 Difference]: Start difference. First operand 417 states and 604 transitions. Second operand 4 states. [2019-09-16 17:05:04,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:04,272 INFO L93 Difference]: Finished difference Result 435 states and 626 transitions. [2019-09-16 17:05:04,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:04,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:05:04,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:04,276 INFO L225 Difference]: With dead ends: 435 [2019-09-16 17:05:04,276 INFO L226 Difference]: Without dead ends: 435 [2019-09-16 17:05:04,277 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-09-16 17:05:04,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 417. [2019-09-16 17:05:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:05:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 602 transitions. [2019-09-16 17:05:04,291 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 602 transitions. Word has length 81 [2019-09-16 17:05:04,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:04,291 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 602 transitions. [2019-09-16 17:05:04,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:04,292 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 602 transitions. [2019-09-16 17:05:04,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:04,294 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:04,294 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:04,295 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:04,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:04,295 INFO L82 PathProgramCache]: Analyzing trace with hash -363480630, now seen corresponding path program 1 times [2019-09-16 17:05:04,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:04,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:04,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-16 17:05:04,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:04,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:04,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:04,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:04,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:04,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:04,374 INFO L87 Difference]: Start difference. First operand 417 states and 602 transitions. Second operand 3 states. [2019-09-16 17:05:04,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:04,416 INFO L93 Difference]: Finished difference Result 568 states and 821 transitions. [2019-09-16 17:05:04,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:04,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-16 17:05:04,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:04,421 INFO L225 Difference]: With dead ends: 568 [2019-09-16 17:05:04,421 INFO L226 Difference]: Without dead ends: 568 [2019-09-16 17:05:04,421 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:04,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-16 17:05:04,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-09-16 17:05:04,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-16 17:05:04,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 821 transitions. [2019-09-16 17:05:04,436 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 821 transitions. Word has length 81 [2019-09-16 17:05:04,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:04,437 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 821 transitions. [2019-09-16 17:05:04,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:04,438 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 821 transitions. [2019-09-16 17:05:04,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-16 17:05:04,442 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:04,442 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:04,443 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:04,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:04,443 INFO L82 PathProgramCache]: Analyzing trace with hash 891001312, now seen corresponding path program 1 times [2019-09-16 17:05:04,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:04,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:04,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-16 17:05:04,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:04,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:04,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:04,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:04,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:04,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:04,522 INFO L87 Difference]: Start difference. First operand 568 states and 821 transitions. Second operand 3 states. [2019-09-16 17:05:04,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:04,557 INFO L93 Difference]: Finished difference Result 719 states and 1041 transitions. [2019-09-16 17:05:04,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:04,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-16 17:05:04,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:04,563 INFO L225 Difference]: With dead ends: 719 [2019-09-16 17:05:04,563 INFO L226 Difference]: Without dead ends: 719 [2019-09-16 17:05:04,564 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:04,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-09-16 17:05:04,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2019-09-16 17:05:04,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-09-16 17:05:04,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1041 transitions. [2019-09-16 17:05:04,581 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1041 transitions. Word has length 83 [2019-09-16 17:05:04,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:04,581 INFO L475 AbstractCegarLoop]: Abstraction has 719 states and 1041 transitions. [2019-09-16 17:05:04,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:04,582 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1041 transitions. [2019-09-16 17:05:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:05:04,584 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:04,584 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:04,584 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:04,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:04,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1251114242, now seen corresponding path program 1 times [2019-09-16 17:05:04,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:04,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:04,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-16 17:05:04,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:04,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:04,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:04,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:04,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:04,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:04,669 INFO L87 Difference]: Start difference. First operand 719 states and 1041 transitions. Second operand 3 states. [2019-09-16 17:05:04,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:04,698 INFO L93 Difference]: Finished difference Result 870 states and 1262 transitions. [2019-09-16 17:05:04,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:04,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-16 17:05:04,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:04,704 INFO L225 Difference]: With dead ends: 870 [2019-09-16 17:05:04,704 INFO L226 Difference]: Without dead ends: 870 [2019-09-16 17:05:04,705 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:04,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-09-16 17:05:04,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2019-09-16 17:05:04,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-09-16 17:05:04,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1262 transitions. [2019-09-16 17:05:04,726 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1262 transitions. Word has length 104 [2019-09-16 17:05:04,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:04,726 INFO L475 AbstractCegarLoop]: Abstraction has 870 states and 1262 transitions. [2019-09-16 17:05:04,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:04,727 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1262 transitions. [2019-09-16 17:05:04,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-16 17:05:04,729 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:04,730 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:04,730 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:04,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:04,731 INFO L82 PathProgramCache]: Analyzing trace with hash -607508183, now seen corresponding path program 1 times [2019-09-16 17:05:04,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:04,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:04,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-16 17:05:04,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:04,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:04,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:04,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:04,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:04,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:04,861 INFO L87 Difference]: Start difference. First operand 870 states and 1262 transitions. Second operand 4 states. [2019-09-16 17:05:05,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:05,215 INFO L93 Difference]: Finished difference Result 1181 states and 1719 transitions. [2019-09-16 17:05:05,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:05,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-16 17:05:05,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:05,221 INFO L225 Difference]: With dead ends: 1181 [2019-09-16 17:05:05,221 INFO L226 Difference]: Without dead ends: 1181 [2019-09-16 17:05:05,222 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-16 17:05:05,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-09-16 17:05:05,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1014. [2019-09-16 17:05:05,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-09-16 17:05:05,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1514 transitions. [2019-09-16 17:05:05,244 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1514 transitions. Word has length 130 [2019-09-16 17:05:05,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:05,245 INFO L475 AbstractCegarLoop]: Abstraction has 1014 states and 1514 transitions. [2019-09-16 17:05:05,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:05,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1514 transitions. [2019-09-16 17:05:05,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-16 17:05:05,248 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:05,248 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:05,248 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:05,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:05,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1842949975, now seen corresponding path program 1 times [2019-09-16 17:05:05,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:05,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:05,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-16 17:05:05,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:05,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:05,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:05,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:05,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:05,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:05,362 INFO L87 Difference]: Start difference. First operand 1014 states and 1514 transitions. Second operand 4 states. [2019-09-16 17:05:05,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:05,643 INFO L93 Difference]: Finished difference Result 1175 states and 1707 transitions. [2019-09-16 17:05:05,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:05,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-16 17:05:05,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:05,649 INFO L225 Difference]: With dead ends: 1175 [2019-09-16 17:05:05,649 INFO L226 Difference]: Without dead ends: 1175 [2019-09-16 17:05:05,650 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-16 17:05:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-16 17:05:05,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1014. [2019-09-16 17:05:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-09-16 17:05:05,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1508 transitions. [2019-09-16 17:05:05,672 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1508 transitions. Word has length 145 [2019-09-16 17:05:05,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:05,673 INFO L475 AbstractCegarLoop]: Abstraction has 1014 states and 1508 transitions. [2019-09-16 17:05:05,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:05,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1508 transitions. [2019-09-16 17:05:05,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-16 17:05:05,676 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:05,676 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:05,676 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:05,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:05,677 INFO L82 PathProgramCache]: Analyzing trace with hash 187546869, now seen corresponding path program 1 times [2019-09-16 17:05:05,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:05,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:05,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-16 17:05:05,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:05,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:05,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:05,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:05,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:05,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:05,760 INFO L87 Difference]: Start difference. First operand 1014 states and 1508 transitions. Second operand 4 states. [2019-09-16 17:05:06,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:06,070 INFO L93 Difference]: Finished difference Result 1175 states and 1701 transitions. [2019-09-16 17:05:06,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:06,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-16 17:05:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:06,076 INFO L225 Difference]: With dead ends: 1175 [2019-09-16 17:05:06,076 INFO L226 Difference]: Without dead ends: 1175 [2019-09-16 17:05:06,077 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-16 17:05:06,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-16 17:05:06,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1014. [2019-09-16 17:05:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-09-16 17:05:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1502 transitions. [2019-09-16 17:05:06,100 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1502 transitions. Word has length 145 [2019-09-16 17:05:06,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:06,100 INFO L475 AbstractCegarLoop]: Abstraction has 1014 states and 1502 transitions. [2019-09-16 17:05:06,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:06,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1502 transitions. [2019-09-16 17:05:06,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-16 17:05:06,103 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:06,103 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:06,104 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:06,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:06,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1711632728, now seen corresponding path program 1 times [2019-09-16 17:05:06,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:06,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:06,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-16 17:05:06,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:06,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:06,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:06,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:06,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:06,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:06,269 INFO L87 Difference]: Start difference. First operand 1014 states and 1502 transitions. Second operand 4 states. [2019-09-16 17:05:06,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:06,597 INFO L93 Difference]: Finished difference Result 1187 states and 1757 transitions. [2019-09-16 17:05:06,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:06,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-16 17:05:06,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:06,603 INFO L225 Difference]: With dead ends: 1187 [2019-09-16 17:05:06,603 INFO L226 Difference]: Without dead ends: 1187 [2019-09-16 17:05:06,603 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-16 17:05:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2019-09-16 17:05:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1104. [2019-09-16 17:05:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2019-09-16 17:05:06,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1652 transitions. [2019-09-16 17:05:06,635 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1652 transitions. Word has length 145 [2019-09-16 17:05:06,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:06,636 INFO L475 AbstractCegarLoop]: Abstraction has 1104 states and 1652 transitions. [2019-09-16 17:05:06,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1652 transitions. [2019-09-16 17:05:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-16 17:05:06,639 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:06,639 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:06,639 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:06,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:06,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1539605380, now seen corresponding path program 1 times [2019-09-16 17:05:06,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:06,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:06,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-16 17:05:06,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:06,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:06,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:06,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:06,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:06,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:06,739 INFO L87 Difference]: Start difference. First operand 1104 states and 1652 transitions. Second operand 4 states. [2019-09-16 17:05:07,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:07,055 INFO L93 Difference]: Finished difference Result 1265 states and 1845 transitions. [2019-09-16 17:05:07,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:07,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-09-16 17:05:07,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:07,061 INFO L225 Difference]: With dead ends: 1265 [2019-09-16 17:05:07,061 INFO L226 Difference]: Without dead ends: 1265 [2019-09-16 17:05:07,062 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-16 17:05:07,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-09-16 17:05:07,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1104. [2019-09-16 17:05:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2019-09-16 17:05:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1646 transitions. [2019-09-16 17:05:07,084 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1646 transitions. Word has length 146 [2019-09-16 17:05:07,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:07,085 INFO L475 AbstractCegarLoop]: Abstraction has 1104 states and 1646 transitions. [2019-09-16 17:05:07,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1646 transitions. [2019-09-16 17:05:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-16 17:05:07,088 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:07,088 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:07,089 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:07,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:07,089 INFO L82 PathProgramCache]: Analyzing trace with hash -389424422, now seen corresponding path program 1 times [2019-09-16 17:05:07,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:07,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:07,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-16 17:05:07,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:07,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:07,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:07,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:07,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:07,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:07,178 INFO L87 Difference]: Start difference. First operand 1104 states and 1646 transitions. Second operand 4 states. [2019-09-16 17:05:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:07,498 INFO L93 Difference]: Finished difference Result 1265 states and 1839 transitions. [2019-09-16 17:05:07,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:07,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-09-16 17:05:07,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:07,505 INFO L225 Difference]: With dead ends: 1265 [2019-09-16 17:05:07,506 INFO L226 Difference]: Without dead ends: 1265 [2019-09-16 17:05:07,506 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-16 17:05:07,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-09-16 17:05:07,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1104. [2019-09-16 17:05:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2019-09-16 17:05:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1640 transitions. [2019-09-16 17:05:07,527 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1640 transitions. Word has length 147 [2019-09-16 17:05:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:07,527 INFO L475 AbstractCegarLoop]: Abstraction has 1104 states and 1640 transitions. [2019-09-16 17:05:07,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:07,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1640 transitions. [2019-09-16 17:05:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-16 17:05:07,530 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:07,531 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:07,531 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:07,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:07,531 INFO L82 PathProgramCache]: Analyzing trace with hash -236227263, now seen corresponding path program 1 times [2019-09-16 17:05:07,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:07,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:07,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:07,615 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-16 17:05:07,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:07,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:07,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:07,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:07,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:07,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:07,618 INFO L87 Difference]: Start difference. First operand 1104 states and 1640 transitions. Second operand 4 states. [2019-09-16 17:05:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:07,930 INFO L93 Difference]: Finished difference Result 1211 states and 1767 transitions. [2019-09-16 17:05:07,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:07,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-09-16 17:05:07,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:07,936 INFO L225 Difference]: With dead ends: 1211 [2019-09-16 17:05:07,936 INFO L226 Difference]: Without dead ends: 1211 [2019-09-16 17:05:07,937 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-16 17:05:07,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2019-09-16 17:05:07,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1104. [2019-09-16 17:05:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2019-09-16 17:05:07,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1634 transitions. [2019-09-16 17:05:07,961 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1634 transitions. Word has length 148 [2019-09-16 17:05:07,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:07,961 INFO L475 AbstractCegarLoop]: Abstraction has 1104 states and 1634 transitions. [2019-09-16 17:05:07,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:07,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1634 transitions. [2019-09-16 17:05:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-16 17:05:07,964 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:07,965 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:07,965 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:07,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:07,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1799915358, now seen corresponding path program 1 times [2019-09-16 17:05:07,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:07,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:07,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:08,117 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 199 proven. 1 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-16 17:05:08,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:05:08,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:05:08,119 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2019-09-16 17:05:08,122 INFO L207 CegarAbsIntRunner]: [0], [38], [39], [40], [43], [52], [63], [72], [74], [79], [84], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [142], [144], [149], [152], [280], [283], [291], [294], [299], [302], [304], [310], [313], [315], [317], [319], [324], [327], [335], [337], [339], [342], [350], [355], [357], [360], [369], [372], [380], [385], [387], [522], [556], [558], [570], [589], [595], [596], [597] [2019-09-16 17:05:08,178 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:05:08,178 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:05:08,255 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:05:08,258 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-16 17:05:08,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:08,262 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:05:08,365 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-16 17:05:08,365 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:05:08,375 INFO L420 sIntCurrentIteration]: We unified 147 AI predicates to 147 [2019-09-16 17:05:08,376 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:05:08,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:05:08,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2019-09-16 17:05:08,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:08,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 17:05:08,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 17:05:08,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:05:08,379 INFO L87 Difference]: Start difference. First operand 1104 states and 1634 transitions. Second operand 2 states. [2019-09-16 17:05:08,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:08,381 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-16 17:05:08,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 17:05:08,381 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 148 [2019-09-16 17:05:08,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:08,381 INFO L225 Difference]: With dead ends: 2 [2019-09-16 17:05:08,381 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:05:08,382 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:05:08,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:05:08,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:05:08,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:05:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:05:08,383 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 148 [2019-09-16 17:05:08,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:08,383 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:05:08,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 17:05:08,383 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:05:08,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:05:08,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:05:08 BoogieIcfgContainer [2019-09-16 17:05:08,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:05:08,396 INFO L168 Benchmark]: Toolchain (without parser) took 16665.42 ms. Allocated memory was 132.1 MB in the beginning and 429.4 MB in the end (delta: 297.3 MB). Free memory was 85.3 MB in the beginning and 123.3 MB in the end (delta: -37.9 MB). Peak memory consumption was 259.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:08,401 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 132.1 MB. Free memory was 106.2 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:05:08,403 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1056.91 ms. Allocated memory was 132.1 MB in the beginning and 201.3 MB in the end (delta: 69.2 MB). Free memory was 85.1 MB in the beginning and 159.0 MB in the end (delta: -73.9 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:08,404 INFO L168 Benchmark]: Boogie Preprocessor took 192.30 ms. Allocated memory is still 201.3 MB. Free memory was 159.0 MB in the beginning and 151.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:08,405 INFO L168 Benchmark]: RCFGBuilder took 1163.32 ms. Allocated memory was 201.3 MB in the beginning and 223.9 MB in the end (delta: 22.5 MB). Free memory was 151.0 MB in the beginning and 176.6 MB in the end (delta: -25.5 MB). Peak memory consumption was 84.7 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:08,406 INFO L168 Benchmark]: TraceAbstraction took 14247.57 ms. Allocated memory was 223.9 MB in the beginning and 429.4 MB in the end (delta: 205.5 MB). Free memory was 175.2 MB in the beginning and 123.3 MB in the end (delta: 51.9 MB). Peak memory consumption was 257.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:08,418 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.20 ms. Allocated memory is still 132.1 MB. Free memory was 106.2 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1056.91 ms. Allocated memory was 132.1 MB in the beginning and 201.3 MB in the end (delta: 69.2 MB). Free memory was 85.1 MB in the beginning and 159.0 MB in the end (delta: -73.9 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 192.30 ms. Allocated memory is still 201.3 MB. Free memory was 159.0 MB in the beginning and 151.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1163.32 ms. Allocated memory was 201.3 MB in the beginning and 223.9 MB in the end (delta: 22.5 MB). Free memory was 151.0 MB in the beginning and 176.6 MB in the end (delta: -25.5 MB). Peak memory consumption was 84.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14247.57 ms. Allocated memory was 223.9 MB in the beginning and 429.4 MB in the end (delta: 205.5 MB). Free memory was 175.2 MB in the beginning and 123.3 MB in the end (delta: 51.9 MB). Peak memory consumption was 257.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1646]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 169 locations, 1 error locations. SAFE Result, 14.1s OverallTime, 31 OverallIterations, 7 TraceHistogramMax, 9.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6602 SDtfs, 2333 SDslu, 8640 SDs, 0 SdLazy, 4574 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 305 GetRequests, 207 SyntacticMatches, 18 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1104occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.3741496598639455 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 2517 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2874 NumberOfCodeBlocks, 2874 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2843 ConstructedInterpolants, 0 QuantifiedInterpolants, 698053 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 30 PerfectInterpolantSequences, 3053/3054 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...