java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_clnt.blast.04.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:07,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:07,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:07,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:07,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:07,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:07,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:07,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:07,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:07,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:07,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:07,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:07,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:07,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:07,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:07,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:07,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:07,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:07,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:07,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:07,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:07,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:07,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:07,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:07,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:07,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:07,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:07,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:07,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:07,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:07,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:07,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:07,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:07,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:07,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:07,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:07,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:07,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:07,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:07,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:07,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:07,270 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:27:07,288 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:07,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:07,288 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:07,289 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:07,289 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:07,289 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:07,290 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:07,290 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:07,290 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:07,290 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:07,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:07,291 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:07,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:07,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:07,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:07,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:07,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:07,292 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:07,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:07,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:07,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:07,293 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:07,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:07,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:07,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:07,294 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:07,294 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:07,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:07,295 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:07,295 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:07,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:07,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:07,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:07,347 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:07,347 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:07,348 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_clnt.blast.04.i.cil-2.c [2019-09-20 13:27:07,413 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d821479c1/1f51dbe159144dabbd21f7812d7a870e/FLAG9aa464fc4 [2019-09-20 13:27:08,121 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:08,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_clnt.blast.04.i.cil-2.c [2019-09-20 13:27:08,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d821479c1/1f51dbe159144dabbd21f7812d7a870e/FLAG9aa464fc4 [2019-09-20 13:27:08,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d821479c1/1f51dbe159144dabbd21f7812d7a870e [2019-09-20 13:27:08,307 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:08,308 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:08,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:08,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:08,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:08,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:08" (1/1) ... [2019-09-20 13:27:08,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@450c6c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:08, skipping insertion in model container [2019-09-20 13:27:08,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:08" (1/1) ... [2019-09-20 13:27:08,325 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:08,399 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:08,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:09,034 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:09,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:09,315 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:09,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:09 WrapperNode [2019-09-20 13:27:09,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:09,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:09,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:09,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:09,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:09" (1/1) ... [2019-09-20 13:27:09,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:09" (1/1) ... [2019-09-20 13:27:09,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:09" (1/1) ... [2019-09-20 13:27:09,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:09" (1/1) ... [2019-09-20 13:27:09,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:09" (1/1) ... [2019-09-20 13:27:09,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:09" (1/1) ... [2019-09-20 13:27:09,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:09" (1/1) ... [2019-09-20 13:27:09,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:09,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:09,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:09,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:09,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:09,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:09,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:09,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-20 13:27:09,563 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-20 13:27:09,563 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:09,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-20 13:27:09,564 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:09,564 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:09,564 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:09,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:09,564 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:09,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:09,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-20 13:27:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-20 13:27:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-20 13:27:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:10,137 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:10,761 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-20 13:27:10,761 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-20 13:27:10,780 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:10,780 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:10,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:10 BoogieIcfgContainer [2019-09-20 13:27:10,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:10,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:10,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:10,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:10,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:08" (1/3) ... [2019-09-20 13:27:10,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e86639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:10, skipping insertion in model container [2019-09-20 13:27:10,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:09" (2/3) ... [2019-09-20 13:27:10,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e86639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:10, skipping insertion in model container [2019-09-20 13:27:10,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:10" (3/3) ... [2019-09-20 13:27:10,792 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-2.c [2019-09-20 13:27:10,802 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:10,817 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:10,834 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:10,865 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:10,865 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:10,866 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:10,866 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:10,866 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:10,866 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:10,866 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:10,866 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:10,885 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2019-09-20 13:27:10,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:27:10,898 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:10,899 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:10,903 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:10,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:10,911 INFO L82 PathProgramCache]: Analyzing trace with hash 461476132, now seen corresponding path program 1 times [2019-09-20 13:27:10,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:10,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:10,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:11,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:11,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:11,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:11,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:11,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:11,369 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2019-09-20 13:27:11,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:11,519 INFO L93 Difference]: Finished difference Result 254 states and 414 transitions. [2019-09-20 13:27:11,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:11,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:27:11,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:11,549 INFO L225 Difference]: With dead ends: 254 [2019-09-20 13:27:11,549 INFO L226 Difference]: Without dead ends: 219 [2019-09-20 13:27:11,554 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-20 13:27:11,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2019-09-20 13:27:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-20 13:27:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2019-09-20 13:27:11,646 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 30 [2019-09-20 13:27:11,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:11,646 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2019-09-20 13:27:11,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:11,647 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2019-09-20 13:27:11,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 13:27:11,650 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:11,650 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-20 13:27:11,651 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:11,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:11,651 INFO L82 PathProgramCache]: Analyzing trace with hash -147745042, now seen corresponding path program 1 times [2019-09-20 13:27:11,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:11,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:11,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:11,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:11,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:11,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:11,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:11,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:11,817 INFO L87 Difference]: Start difference. First operand 219 states and 323 transitions. Second operand 3 states. [2019-09-20 13:27:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:11,888 INFO L93 Difference]: Finished difference Result 319 states and 470 transitions. [2019-09-20 13:27:11,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:11,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-20 13:27:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:11,892 INFO L225 Difference]: With dead ends: 319 [2019-09-20 13:27:11,892 INFO L226 Difference]: Without dead ends: 319 [2019-09-20 13:27:11,893 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-20 13:27:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2019-09-20 13:27:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-20 13:27:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 470 transitions. [2019-09-20 13:27:11,912 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 470 transitions. Word has length 45 [2019-09-20 13:27:11,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:11,913 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 470 transitions. [2019-09-20 13:27:11,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 470 transitions. [2019-09-20 13:27:11,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:11,917 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:11,917 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-20 13:27:11,918 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:11,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:11,918 INFO L82 PathProgramCache]: Analyzing trace with hash -389905176, now seen corresponding path program 1 times [2019-09-20 13:27:11,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:11,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:11,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:12,118 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-20 13:27:12,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:12,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:12,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:12,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:12,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:12,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:12,122 INFO L87 Difference]: Start difference. First operand 319 states and 470 transitions. Second operand 4 states. [2019-09-20 13:27:12,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:12,709 INFO L93 Difference]: Finished difference Result 505 states and 747 transitions. [2019-09-20 13:27:12,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:12,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:27:12,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:12,714 INFO L225 Difference]: With dead ends: 505 [2019-09-20 13:27:12,715 INFO L226 Difference]: Without dead ends: 505 [2019-09-20 13:27:12,715 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:12,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-20 13:27:12,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 369. [2019-09-20 13:27:12,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-09-20 13:27:12,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 556 transitions. [2019-09-20 13:27:12,733 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 556 transitions. Word has length 63 [2019-09-20 13:27:12,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:12,733 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 556 transitions. [2019-09-20 13:27:12,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:12,734 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 556 transitions. [2019-09-20 13:27:12,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:12,738 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:12,738 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-20 13:27:12,738 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:12,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:12,739 INFO L82 PathProgramCache]: Analyzing trace with hash -523918682, now seen corresponding path program 1 times [2019-09-20 13:27:12,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:12,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:12,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:12,828 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-20 13:27:12,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:12,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:12,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:12,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:12,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:12,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:12,830 INFO L87 Difference]: Start difference. First operand 369 states and 556 transitions. Second operand 4 states. [2019-09-20 13:27:13,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:13,180 INFO L93 Difference]: Finished difference Result 455 states and 682 transitions. [2019-09-20 13:27:13,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:13,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:27:13,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:13,185 INFO L225 Difference]: With dead ends: 455 [2019-09-20 13:27:13,185 INFO L226 Difference]: Without dead ends: 455 [2019-09-20 13:27:13,186 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:13,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-20 13:27:13,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 409. [2019-09-20 13:27:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-09-20 13:27:13,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 624 transitions. [2019-09-20 13:27:13,200 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 624 transitions. Word has length 63 [2019-09-20 13:27:13,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:13,201 INFO L475 AbstractCegarLoop]: Abstraction has 409 states and 624 transitions. [2019-09-20 13:27:13,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:13,201 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 624 transitions. [2019-09-20 13:27:13,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:13,207 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:13,207 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-20 13:27:13,208 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:13,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:13,209 INFO L82 PathProgramCache]: Analyzing trace with hash 793155671, now seen corresponding path program 1 times [2019-09-20 13:27:13,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:13,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:13,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:13,342 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-20 13:27:13,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:13,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:13,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:13,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:13,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:13,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:13,344 INFO L87 Difference]: Start difference. First operand 409 states and 624 transitions. Second operand 4 states. [2019-09-20 13:27:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:13,818 INFO L93 Difference]: Finished difference Result 537 states and 805 transitions. [2019-09-20 13:27:13,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:13,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:13,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:13,822 INFO L225 Difference]: With dead ends: 537 [2019-09-20 13:27:13,822 INFO L226 Difference]: Without dead ends: 537 [2019-09-20 13:27:13,822 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:13,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-20 13:27:13,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 411. [2019-09-20 13:27:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-20 13:27:13,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 626 transitions. [2019-09-20 13:27:13,836 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 626 transitions. Word has length 64 [2019-09-20 13:27:13,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:13,836 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 626 transitions. [2019-09-20 13:27:13,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 626 transitions. [2019-09-20 13:27:13,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:27:13,838 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:13,838 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:13,839 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:13,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1956758784, now seen corresponding path program 1 times [2019-09-20 13:27:13,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:13,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:13,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:13,951 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-20 13:27:13,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:13,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:13,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:13,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:13,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:13,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:13,954 INFO L87 Difference]: Start difference. First operand 411 states and 626 transitions. Second operand 4 states. [2019-09-20 13:27:14,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:14,396 INFO L93 Difference]: Finished difference Result 535 states and 801 transitions. [2019-09-20 13:27:14,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:14,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:27:14,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:14,404 INFO L225 Difference]: With dead ends: 535 [2019-09-20 13:27:14,404 INFO L226 Difference]: Without dead ends: 535 [2019-09-20 13:27:14,404 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-20 13:27:14,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-20 13:27:14,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-20 13:27:14,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 624 transitions. [2019-09-20 13:27:14,417 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 624 transitions. Word has length 77 [2019-09-20 13:27:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:14,417 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 624 transitions. [2019-09-20 13:27:14,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:14,417 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 624 transitions. [2019-09-20 13:27:14,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:27:14,419 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:14,419 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:14,419 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:14,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:14,420 INFO L82 PathProgramCache]: Analyzing trace with hash 847778338, now seen corresponding path program 1 times [2019-09-20 13:27:14,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:14,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:14,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:14,502 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-20 13:27:14,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:14,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:14,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:14,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:14,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:14,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:14,504 INFO L87 Difference]: Start difference. First operand 411 states and 624 transitions. Second operand 4 states. [2019-09-20 13:27:14,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:14,921 INFO L93 Difference]: Finished difference Result 535 states and 799 transitions. [2019-09-20 13:27:14,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:14,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:27:14,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:14,925 INFO L225 Difference]: With dead ends: 535 [2019-09-20 13:27:14,926 INFO L226 Difference]: Without dead ends: 535 [2019-09-20 13:27:14,926 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:14,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-20 13:27:14,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-20 13:27:14,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-20 13:27:14,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 622 transitions. [2019-09-20 13:27:14,939 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 622 transitions. Word has length 77 [2019-09-20 13:27:14,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:14,939 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 622 transitions. [2019-09-20 13:27:14,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 622 transitions. [2019-09-20 13:27:14,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:27:14,941 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:14,942 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:14,942 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:14,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:14,942 INFO L82 PathProgramCache]: Analyzing trace with hash 927399486, now seen corresponding path program 1 times [2019-09-20 13:27:14,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:14,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:14,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:15,032 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-20 13:27:15,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:15,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:15,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:15,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:15,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:15,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:15,034 INFO L87 Difference]: Start difference. First operand 411 states and 622 transitions. Second operand 4 states. [2019-09-20 13:27:15,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:15,374 INFO L93 Difference]: Finished difference Result 455 states and 676 transitions. [2019-09-20 13:27:15,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:15,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:27:15,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:15,378 INFO L225 Difference]: With dead ends: 455 [2019-09-20 13:27:15,378 INFO L226 Difference]: Without dead ends: 455 [2019-09-20 13:27:15,378 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-20 13:27:15,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-20 13:27:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-20 13:27:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 620 transitions. [2019-09-20 13:27:15,388 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 620 transitions. Word has length 77 [2019-09-20 13:27:15,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:15,388 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 620 transitions. [2019-09-20 13:27:15,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 620 transitions. [2019-09-20 13:27:15,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:27:15,390 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:15,390 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:15,390 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:15,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:15,391 INFO L82 PathProgramCache]: Analyzing trace with hash -181580960, now seen corresponding path program 1 times [2019-09-20 13:27:15,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:15,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:15,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:15,473 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-20 13:27:15,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:15,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:15,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:15,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:15,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:15,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:15,475 INFO L87 Difference]: Start difference. First operand 411 states and 620 transitions. Second operand 4 states. [2019-09-20 13:27:15,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:15,858 INFO L93 Difference]: Finished difference Result 455 states and 674 transitions. [2019-09-20 13:27:15,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:15,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:27:15,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:15,861 INFO L225 Difference]: With dead ends: 455 [2019-09-20 13:27:15,862 INFO L226 Difference]: Without dead ends: 455 [2019-09-20 13:27:15,862 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:15,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-20 13:27:15,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-20 13:27:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-20 13:27:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 618 transitions. [2019-09-20 13:27:15,872 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 618 transitions. Word has length 77 [2019-09-20 13:27:15,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:15,872 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 618 transitions. [2019-09-20 13:27:15,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:15,872 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 618 transitions. [2019-09-20 13:27:15,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:15,874 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:15,874 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:15,874 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:15,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:15,874 INFO L82 PathProgramCache]: Analyzing trace with hash 565717777, now seen corresponding path program 1 times [2019-09-20 13:27:15,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:15,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:15,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:15,939 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-20 13:27:15,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:15,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:15,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:15,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:15,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:15,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:15,941 INFO L87 Difference]: Start difference. First operand 411 states and 618 transitions. Second operand 4 states. [2019-09-20 13:27:16,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:16,378 INFO L93 Difference]: Finished difference Result 535 states and 793 transitions. [2019-09-20 13:27:16,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:16,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:16,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:16,383 INFO L225 Difference]: With dead ends: 535 [2019-09-20 13:27:16,383 INFO L226 Difference]: Without dead ends: 535 [2019-09-20 13:27:16,383 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:16,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-20 13:27:16,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-20 13:27:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-20 13:27:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 616 transitions. [2019-09-20 13:27:16,394 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 616 transitions. Word has length 78 [2019-09-20 13:27:16,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:16,394 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 616 transitions. [2019-09-20 13:27:16,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 616 transitions. [2019-09-20 13:27:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:16,395 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:16,396 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-20 13:27:16,396 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:16,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:16,396 INFO L82 PathProgramCache]: Analyzing trace with hash 865778860, now seen corresponding path program 1 times [2019-09-20 13:27:16,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:16,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:16,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:16,457 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-20 13:27:16,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:16,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:16,458 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:16,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:16,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:16,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:16,459 INFO L87 Difference]: Start difference. First operand 411 states and 616 transitions. Second operand 4 states. [2019-09-20 13:27:16,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:16,919 INFO L93 Difference]: Finished difference Result 535 states and 791 transitions. [2019-09-20 13:27:16,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:16,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:16,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:16,923 INFO L225 Difference]: With dead ends: 535 [2019-09-20 13:27:16,924 INFO L226 Difference]: Without dead ends: 535 [2019-09-20 13:27:16,924 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:16,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-20 13:27:16,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-20 13:27:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-20 13:27:16,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 614 transitions. [2019-09-20 13:27:16,942 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 614 transitions. Word has length 78 [2019-09-20 13:27:16,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:16,943 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 614 transitions. [2019-09-20 13:27:16,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:16,944 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 614 transitions. [2019-09-20 13:27:16,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:16,946 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:16,946 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:16,947 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:16,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:16,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1279649389, now seen corresponding path program 1 times [2019-09-20 13:27:16,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:16,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:16,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:17,038 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-20 13:27:17,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:17,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:17,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:17,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:17,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:17,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:17,042 INFO L87 Difference]: Start difference. First operand 411 states and 614 transitions. Second operand 4 states. [2019-09-20 13:27:17,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:17,368 INFO L93 Difference]: Finished difference Result 455 states and 668 transitions. [2019-09-20 13:27:17,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:17,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:17,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:17,371 INFO L225 Difference]: With dead ends: 455 [2019-09-20 13:27:17,371 INFO L226 Difference]: Without dead ends: 455 [2019-09-20 13:27:17,371 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:17,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-20 13:27:17,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-20 13:27:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-20 13:27:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 612 transitions. [2019-09-20 13:27:17,381 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 612 transitions. Word has length 78 [2019-09-20 13:27:17,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:17,381 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 612 transitions. [2019-09-20 13:27:17,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:17,381 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 612 transitions. [2019-09-20 13:27:17,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:17,383 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:17,383 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-20 13:27:17,383 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:17,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:17,384 INFO L82 PathProgramCache]: Analyzing trace with hash -979588306, now seen corresponding path program 1 times [2019-09-20 13:27:17,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:17,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:17,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:17,450 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-20 13:27:17,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:17,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:17,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:17,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:17,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:17,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:17,452 INFO L87 Difference]: Start difference. First operand 411 states and 612 transitions. Second operand 4 states. [2019-09-20 13:27:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:17,762 INFO L93 Difference]: Finished difference Result 455 states and 666 transitions. [2019-09-20 13:27:17,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:17,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:17,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:17,766 INFO L225 Difference]: With dead ends: 455 [2019-09-20 13:27:17,766 INFO L226 Difference]: Without dead ends: 455 [2019-09-20 13:27:17,766 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:17,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-20 13:27:17,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-20 13:27:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-20 13:27:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 610 transitions. [2019-09-20 13:27:17,776 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 610 transitions. Word has length 78 [2019-09-20 13:27:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:17,776 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 610 transitions. [2019-09-20 13:27:17,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 610 transitions. [2019-09-20 13:27:17,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:17,778 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:17,778 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:17,779 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:17,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:17,779 INFO L82 PathProgramCache]: Analyzing trace with hash 468355613, now seen corresponding path program 1 times [2019-09-20 13:27:17,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:17,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:17,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:17,838 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-20 13:27:17,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:17,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:17,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:17,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:17,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:17,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:17,840 INFO L87 Difference]: Start difference. First operand 411 states and 610 transitions. Second operand 4 states. [2019-09-20 13:27:18,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:18,293 INFO L93 Difference]: Finished difference Result 535 states and 785 transitions. [2019-09-20 13:27:18,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:18,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:18,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:18,297 INFO L225 Difference]: With dead ends: 535 [2019-09-20 13:27:18,297 INFO L226 Difference]: Without dead ends: 535 [2019-09-20 13:27:18,298 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:18,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-20 13:27:18,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-20 13:27:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-20 13:27:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 608 transitions. [2019-09-20 13:27:18,308 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 608 transitions. Word has length 79 [2019-09-20 13:27:18,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:18,308 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 608 transitions. [2019-09-20 13:27:18,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 608 transitions. [2019-09-20 13:27:18,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:18,310 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:18,310 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-20 13:27:18,310 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:18,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:18,311 INFO L82 PathProgramCache]: Analyzing trace with hash -821622051, now seen corresponding path program 1 times [2019-09-20 13:27:18,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:18,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:18,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:18,388 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-20 13:27:18,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:18,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:18,389 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:18,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:18,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:18,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:18,390 INFO L87 Difference]: Start difference. First operand 411 states and 608 transitions. Second operand 4 states. [2019-09-20 13:27:18,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:18,816 INFO L93 Difference]: Finished difference Result 529 states and 776 transitions. [2019-09-20 13:27:18,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:18,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:18,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:18,820 INFO L225 Difference]: With dead ends: 529 [2019-09-20 13:27:18,820 INFO L226 Difference]: Without dead ends: 529 [2019-09-20 13:27:18,820 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:18,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-20 13:27:18,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 411. [2019-09-20 13:27:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-20 13:27:18,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 606 transitions. [2019-09-20 13:27:18,837 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 606 transitions. Word has length 79 [2019-09-20 13:27:18,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:18,838 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 606 transitions. [2019-09-20 13:27:18,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:18,838 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 606 transitions. [2019-09-20 13:27:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:18,839 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:18,840 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:18,840 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:18,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:18,840 INFO L82 PathProgramCache]: Analyzing trace with hash -903451685, now seen corresponding path program 1 times [2019-09-20 13:27:18,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:18,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:18,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:18,938 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-20 13:27:18,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:18,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:18,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:18,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:18,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:18,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:18,942 INFO L87 Difference]: Start difference. First operand 411 states and 606 transitions. Second operand 4 states. [2019-09-20 13:27:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:19,243 INFO L93 Difference]: Finished difference Result 455 states and 660 transitions. [2019-09-20 13:27:19,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:19,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:19,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:19,246 INFO L225 Difference]: With dead ends: 455 [2019-09-20 13:27:19,246 INFO L226 Difference]: Without dead ends: 455 [2019-09-20 13:27:19,247 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:19,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-20 13:27:19,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-20 13:27:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-20 13:27:19,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 604 transitions. [2019-09-20 13:27:19,255 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 604 transitions. Word has length 79 [2019-09-20 13:27:19,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:19,256 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 604 transitions. [2019-09-20 13:27:19,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:19,256 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 604 transitions. [2019-09-20 13:27:19,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:19,257 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:19,258 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-20 13:27:19,258 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:19,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:19,258 INFO L82 PathProgramCache]: Analyzing trace with hash 2101537947, now seen corresponding path program 1 times [2019-09-20 13:27:19,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:19,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:19,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:19,324 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-20 13:27:19,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:19,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:19,324 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:19,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:19,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:19,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:19,325 INFO L87 Difference]: Start difference. First operand 411 states and 604 transitions. Second operand 4 states. [2019-09-20 13:27:19,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:19,592 INFO L93 Difference]: Finished difference Result 449 states and 651 transitions. [2019-09-20 13:27:19,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:19,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:19,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:19,595 INFO L225 Difference]: With dead ends: 449 [2019-09-20 13:27:19,595 INFO L226 Difference]: Without dead ends: 449 [2019-09-20 13:27:19,595 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:19,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-20 13:27:19,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 411. [2019-09-20 13:27:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-20 13:27:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 602 transitions. [2019-09-20 13:27:19,610 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 602 transitions. Word has length 79 [2019-09-20 13:27:19,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:19,610 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 602 transitions. [2019-09-20 13:27:19,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:19,610 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 602 transitions. [2019-09-20 13:27:19,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:19,612 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:19,613 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:19,613 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:19,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:19,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1801676460, now seen corresponding path program 1 times [2019-09-20 13:27:19,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:19,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:19,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:19,686 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-20 13:27:19,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:19,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:19,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:19,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:19,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:19,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:19,689 INFO L87 Difference]: Start difference. First operand 411 states and 602 transitions. Second operand 4 states. [2019-09-20 13:27:20,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:20,063 INFO L93 Difference]: Finished difference Result 511 states and 748 transitions. [2019-09-20 13:27:20,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:20,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:20,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:20,068 INFO L225 Difference]: With dead ends: 511 [2019-09-20 13:27:20,068 INFO L226 Difference]: Without dead ends: 511 [2019-09-20 13:27:20,068 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:20,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-20 13:27:20,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 411. [2019-09-20 13:27:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-20 13:27:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 600 transitions. [2019-09-20 13:27:20,077 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 600 transitions. Word has length 80 [2019-09-20 13:27:20,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:20,078 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 600 transitions. [2019-09-20 13:27:20,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:20,078 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 600 transitions. [2019-09-20 13:27:20,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:20,079 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:20,079 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:20,080 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:20,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:20,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2069644114, now seen corresponding path program 1 times [2019-09-20 13:27:20,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:20,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:20,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:20,143 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-20 13:27:20,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:20,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:20,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:20,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:20,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:20,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:20,145 INFO L87 Difference]: Start difference. First operand 411 states and 600 transitions. Second operand 4 states. [2019-09-20 13:27:20,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:20,474 INFO L93 Difference]: Finished difference Result 431 states and 625 transitions. [2019-09-20 13:27:20,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:20,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:20,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:20,478 INFO L225 Difference]: With dead ends: 431 [2019-09-20 13:27:20,478 INFO L226 Difference]: Without dead ends: 431 [2019-09-20 13:27:20,479 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-09-20 13:27:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 411. [2019-09-20 13:27:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-20 13:27:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2019-09-20 13:27:20,495 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 80 [2019-09-20 13:27:20,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:20,496 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2019-09-20 13:27:20,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2019-09-20 13:27:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:20,501 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:20,501 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-20 13:27:20,501 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:20,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:20,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1190699097, now seen corresponding path program 1 times [2019-09-20 13:27:20,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:20,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:20,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:20,570 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-20 13:27:20,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:20,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:20,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:20,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:20,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:20,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:20,572 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand 4 states. [2019-09-20 13:27:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:21,092 INFO L93 Difference]: Finished difference Result 511 states and 744 transitions. [2019-09-20 13:27:21,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:21,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:21,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:21,097 INFO L225 Difference]: With dead ends: 511 [2019-09-20 13:27:21,098 INFO L226 Difference]: Without dead ends: 511 [2019-09-20 13:27:21,098 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-20 13:27:21,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 411. [2019-09-20 13:27:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-20 13:27:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 596 transitions. [2019-09-20 13:27:21,114 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 596 transitions. Word has length 81 [2019-09-20 13:27:21,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:21,115 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 596 transitions. [2019-09-20 13:27:21,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:21,116 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 596 transitions. [2019-09-20 13:27:21,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:21,118 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:21,119 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-20 13:27:21,119 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:21,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:21,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1438845591, now seen corresponding path program 1 times [2019-09-20 13:27:21,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:21,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:21,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:21,254 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-20 13:27:21,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:21,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:21,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:21,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:21,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:21,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:21,257 INFO L87 Difference]: Start difference. First operand 411 states and 596 transitions. Second operand 3 states. [2019-09-20 13:27:21,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:21,293 INFO L93 Difference]: Finished difference Result 560 states and 813 transitions. [2019-09-20 13:27:21,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:21,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-20 13:27:21,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:21,296 INFO L225 Difference]: With dead ends: 560 [2019-09-20 13:27:21,297 INFO L226 Difference]: Without dead ends: 560 [2019-09-20 13:27:21,297 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:21,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-09-20 13:27:21,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2019-09-20 13:27:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-09-20 13:27:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 813 transitions. [2019-09-20 13:27:21,311 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 813 transitions. Word has length 81 [2019-09-20 13:27:21,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:21,312 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 813 transitions. [2019-09-20 13:27:21,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:21,312 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 813 transitions. [2019-09-20 13:27:21,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:27:21,314 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:21,314 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-20 13:27:21,314 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:21,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:21,315 INFO L82 PathProgramCache]: Analyzing trace with hash 181906312, now seen corresponding path program 1 times [2019-09-20 13:27:21,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:21,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:21,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:21,383 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-20 13:27:21,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:21,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:21,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:21,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:21,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:21,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:21,385 INFO L87 Difference]: Start difference. First operand 560 states and 813 transitions. Second operand 3 states. [2019-09-20 13:27:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:21,416 INFO L93 Difference]: Finished difference Result 709 states and 1031 transitions. [2019-09-20 13:27:21,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:21,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-20 13:27:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:21,422 INFO L225 Difference]: With dead ends: 709 [2019-09-20 13:27:21,422 INFO L226 Difference]: Without dead ends: 709 [2019-09-20 13:27:21,423 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-09-20 13:27:21,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2019-09-20 13:27:21,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-09-20 13:27:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1031 transitions. [2019-09-20 13:27:21,439 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1031 transitions. Word has length 83 [2019-09-20 13:27:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:21,439 INFO L475 AbstractCegarLoop]: Abstraction has 709 states and 1031 transitions. [2019-09-20 13:27:21,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1031 transitions. [2019-09-20 13:27:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:21,442 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:21,442 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-20 13:27:21,442 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:21,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:21,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1980699707, now seen corresponding path program 1 times [2019-09-20 13:27:21,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:21,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:21,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:21,516 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-20 13:27:21,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:21,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:21,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:21,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:21,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:21,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:21,518 INFO L87 Difference]: Start difference. First operand 709 states and 1031 transitions. Second operand 3 states. [2019-09-20 13:27:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:21,549 INFO L93 Difference]: Finished difference Result 858 states and 1250 transitions. [2019-09-20 13:27:21,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:21,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-20 13:27:21,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:21,554 INFO L225 Difference]: With dead ends: 858 [2019-09-20 13:27:21,554 INFO L226 Difference]: Without dead ends: 858 [2019-09-20 13:27:21,555 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:21,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2019-09-20 13:27:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2019-09-20 13:27:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-09-20 13:27:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1250 transitions. [2019-09-20 13:27:21,571 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1250 transitions. Word has length 104 [2019-09-20 13:27:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:21,572 INFO L475 AbstractCegarLoop]: Abstraction has 858 states and 1250 transitions. [2019-09-20 13:27:21,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:21,572 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1250 transitions. [2019-09-20 13:27:21,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-20 13:27:21,574 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:21,574 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:21,575 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:21,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:21,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1640086875, now seen corresponding path program 1 times [2019-09-20 13:27:21,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:21,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:21,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-20 13:27:21,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:21,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:21,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:21,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:21,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:21,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:21,673 INFO L87 Difference]: Start difference. First operand 858 states and 1250 transitions. Second operand 4 states. [2019-09-20 13:27:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:22,003 INFO L93 Difference]: Finished difference Result 1143 states and 1671 transitions. [2019-09-20 13:27:22,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:22,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-20 13:27:22,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:22,010 INFO L225 Difference]: With dead ends: 1143 [2019-09-20 13:27:22,010 INFO L226 Difference]: Without dead ends: 1143 [2019-09-20 13:27:22,015 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2019-09-20 13:27:22,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 990. [2019-09-20 13:27:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990 states. [2019-09-20 13:27:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1478 transitions. [2019-09-20 13:27:22,037 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1478 transitions. Word has length 125 [2019-09-20 13:27:22,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:22,038 INFO L475 AbstractCegarLoop]: Abstraction has 990 states and 1478 transitions. [2019-09-20 13:27:22,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1478 transitions. [2019-09-20 13:27:22,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-20 13:27:22,042 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:22,042 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:22,042 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:22,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:22,045 INFO L82 PathProgramCache]: Analyzing trace with hash -884198403, now seen corresponding path program 1 times [2019-09-20 13:27:22,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:22,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:22,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 124 proven. 11 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-20 13:27:22,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:27:22,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:27:22,150 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 140 with the following transitions: [2019-09-20 13:27:22,153 INFO L207 CegarAbsIntRunner]: [0], [38], [39], [40], [43], [52], [63], [72], [74], [77], [79], [84], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [142], [242], [244], [247], [251], [256], [271], [277], [282], [284], [287], [295], [298], [303], [306], [314], [319], [321], [323], [328], [331], [333], [336], [344], [346], [348], [351], [359], [364], [366], [369], [523], [557], [559], [571], [590], [596], [597], [598] [2019-09-20 13:27:22,211 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:27:22,211 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:27:22,321 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-20 13:27:22,323 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-20 13:27:22,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:22,328 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-20 13:27:22,435 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-20 13:27:22,436 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-20 13:27:22,447 INFO L420 sIntCurrentIteration]: We unified 138 AI predicates to 138 [2019-09-20 13:27:22,447 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-20 13:27:22,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:27:22,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-20 13:27:22,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:22,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:27:22,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:27:22,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:27:22,450 INFO L87 Difference]: Start difference. First operand 990 states and 1478 transitions. Second operand 2 states. [2019-09-20 13:27:22,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:22,451 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-20 13:27:22,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:27:22,451 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 139 [2019-09-20 13:27:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:22,451 INFO L225 Difference]: With dead ends: 2 [2019-09-20 13:27:22,452 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:27:22,452 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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-20 13:27:22,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:27:22,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:27:22,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:27:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:27:22,453 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 139 [2019-09-20 13:27:22,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:22,453 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:27:22,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:27:22,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:27:22,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:27:22,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:27:22 BoogieIcfgContainer [2019-09-20 13:27:22,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:27:22,465 INFO L168 Benchmark]: Toolchain (without parser) took 14154.35 ms. Allocated memory was 137.9 MB in the beginning and 400.0 MB in the end (delta: 262.1 MB). Free memory was 81.7 MB in the beginning and 113.6 MB in the end (delta: -31.9 MB). Peak memory consumption was 230.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:22,466 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 137.9 MB. Free memory was 102.6 MB in the beginning and 102.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:27:22,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1007.25 ms. Allocated memory was 137.9 MB in the beginning and 198.2 MB in the end (delta: 60.3 MB). Free memory was 81.5 MB in the beginning and 155.1 MB in the end (delta: -73.7 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:22,469 INFO L168 Benchmark]: Boogie Preprocessor took 165.18 ms. Allocated memory is still 198.2 MB. Free memory was 155.1 MB in the beginning and 147.4 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:22,474 INFO L168 Benchmark]: RCFGBuilder took 1299.34 ms. Allocated memory was 198.2 MB in the beginning and 218.6 MB in the end (delta: 20.4 MB). Free memory was 147.4 MB in the beginning and 169.0 MB in the end (delta: -21.6 MB). Peak memory consumption was 86.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:22,478 INFO L168 Benchmark]: TraceAbstraction took 11678.14 ms. Allocated memory was 218.6 MB in the beginning and 400.0 MB in the end (delta: 181.4 MB). Free memory was 169.0 MB in the beginning and 113.6 MB in the end (delta: 55.4 MB). Peak memory consumption was 236.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:22,488 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.26 ms. Allocated memory is still 137.9 MB. Free memory was 102.6 MB in the beginning and 102.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1007.25 ms. Allocated memory was 137.9 MB in the beginning and 198.2 MB in the end (delta: 60.3 MB). Free memory was 81.5 MB in the beginning and 155.1 MB in the end (delta: -73.7 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 165.18 ms. Allocated memory is still 198.2 MB. Free memory was 155.1 MB in the beginning and 147.4 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1299.34 ms. Allocated memory was 198.2 MB in the beginning and 218.6 MB in the end (delta: 20.4 MB). Free memory was 147.4 MB in the beginning and 169.0 MB in the end (delta: -21.6 MB). Peak memory consumption was 86.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11678.14 ms. Allocated memory was 218.6 MB in the beginning and 400.0 MB in the end (delta: 181.4 MB). Free memory was 169.0 MB in the beginning and 113.6 MB in the end (delta: 55.4 MB). Peak memory consumption was 236.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1643]: 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, 167 locations, 1 error locations. SAFE Result, 11.6s OverallTime, 25 OverallIterations, 7 TraceHistogramMax, 8.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5258 SDtfs, 2021 SDslu, 6728 SDs, 0 SdLazy, 3676 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 186 SyntacticMatches, 18 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=990occurred in iteration=24, 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.4565217391304348 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 1677 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1974 NumberOfCodeBlocks, 1974 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1949 ConstructedInterpolants, 0 QuantifiedInterpolants, 406715 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 24 PerfectInterpolantSequences, 1564/1575 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...