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.03.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:06,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:06,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:06,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:06,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:06,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:06,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:06,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:06,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:06,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:06,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:06,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:06,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:06,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:06,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:06,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:06,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:06,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:06,248 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:06,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:06,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:06,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:06,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:06,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:06,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:06,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:06,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:06,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:06,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:06,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:06,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:06,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:06,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:06,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:06,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:06,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:06,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:06,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:06,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:06,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:06,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:06,278 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:06,296 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:06,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:06,297 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:06,297 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:06,299 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:06,299 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:06,299 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:06,299 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:06,300 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:06,300 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:06,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:06,303 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:06,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:06,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:06,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:06,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:06,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:06,304 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:06,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:06,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:06,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:06,305 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:06,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:06,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:06,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:06,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:06,306 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:06,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:06,307 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:06,307 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:06,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:06,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:06,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:06,363 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:06,364 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:06,365 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_clnt.blast.03.i.cil-2.c [2019-09-20 13:27:06,444 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053f02f4b/131e9ccf1353439da92540bf47d2c625/FLAG8be059baa [2019-09-20 13:27:07,011 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:07,011 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_clnt.blast.03.i.cil-2.c [2019-09-20 13:27:07,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053f02f4b/131e9ccf1353439da92540bf47d2c625/FLAG8be059baa [2019-09-20 13:27:07,230 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053f02f4b/131e9ccf1353439da92540bf47d2c625 [2019-09-20 13:27:07,239 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:07,240 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:07,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:07,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:07,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:07,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:07" (1/1) ... [2019-09-20 13:27:07,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7d2efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:07, skipping insertion in model container [2019-09-20 13:27:07,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:07" (1/1) ... [2019-09-20 13:27:07,258 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:07,340 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:08,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:08,073 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:08,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:08,316 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:08,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:08 WrapperNode [2019-09-20 13:27:08,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:08,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:08,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:08,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:08,337 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:08" (1/1) ... [2019-09-20 13:27:08,339 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:08" (1/1) ... [2019-09-20 13:27:08,374 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:08" (1/1) ... [2019-09-20 13:27:08,375 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:08" (1/1) ... [2019-09-20 13:27:08,437 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:08" (1/1) ... [2019-09-20 13:27:08,450 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:08" (1/1) ... [2019-09-20 13:27:08,455 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:08" (1/1) ... [2019-09-20 13:27:08,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:08,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:08,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:08,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:08,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:08" (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:08,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:08,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:08,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-20 13:27:08,541 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-20 13:27:08,541 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:08,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-20 13:27:08,542 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:08,542 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:08,542 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:08,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:08,543 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:08,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:08,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:08,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:08,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:08,544 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:08,544 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-20 13:27:08,544 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:08,545 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-20 13:27:08,545 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-20 13:27:08,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:08,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:08,546 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:08,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:08,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:08,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:08,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:08,547 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:08,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:08,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:08,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:08,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:08,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:08,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:08,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:08,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:08,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:08,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:08,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:09,119 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:09,782 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-20 13:27:09,782 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-20 13:27:09,804 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:09,805 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:09,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:09 BoogieIcfgContainer [2019-09-20 13:27:09,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:09,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:09,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:09,813 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:09,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:07" (1/3) ... [2019-09-20 13:27:09,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d28c3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:09, skipping insertion in model container [2019-09-20 13:27:09,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:08" (2/3) ... [2019-09-20 13:27:09,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d28c3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:09, skipping insertion in model container [2019-09-20 13:27:09,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:09" (3/3) ... [2019-09-20 13:27:09,817 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-2.c [2019-09-20 13:27:09,832 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:09,843 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:09,865 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:09,904 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:09,904 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:09,904 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:09,904 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:09,904 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:09,905 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:09,905 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:09,905 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2019-09-20 13:27:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:27:09,943 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:09,944 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:09,947 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:09,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:09,954 INFO L82 PathProgramCache]: Analyzing trace with hash 461476132, now seen corresponding path program 1 times [2019-09-20 13:27:09,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:10,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:10,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:10,372 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:10,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:10,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:10,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:10,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:10,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:10,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:10,405 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2019-09-20 13:27:10,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:10,514 INFO L93 Difference]: Finished difference Result 254 states and 414 transitions. [2019-09-20 13:27:10,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:10,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:27:10,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:10,531 INFO L225 Difference]: With dead ends: 254 [2019-09-20 13:27:10,531 INFO L226 Difference]: Without dead ends: 219 [2019-09-20 13:27:10,533 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:10,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-20 13:27:10,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2019-09-20 13:27:10,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-20 13:27:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2019-09-20 13:27:10,594 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 30 [2019-09-20 13:27:10,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:10,595 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2019-09-20 13:27:10,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:10,595 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2019-09-20 13:27:10,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 13:27:10,598 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:10,599 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:10,599 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:10,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:10,599 INFO L82 PathProgramCache]: Analyzing trace with hash -147745042, now seen corresponding path program 1 times [2019-09-20 13:27:10,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:10,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:10,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:10,711 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:10,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:10,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:10,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:10,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:10,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:10,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:10,716 INFO L87 Difference]: Start difference. First operand 219 states and 323 transitions. Second operand 3 states. [2019-09-20 13:27:10,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:10,791 INFO L93 Difference]: Finished difference Result 318 states and 469 transitions. [2019-09-20 13:27:10,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:10,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-20 13:27:10,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:10,795 INFO L225 Difference]: With dead ends: 318 [2019-09-20 13:27:10,796 INFO L226 Difference]: Without dead ends: 318 [2019-09-20 13:27:10,796 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:10,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-20 13:27:10,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2019-09-20 13:27:10,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-20 13:27:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 469 transitions. [2019-09-20 13:27:10,831 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 469 transitions. Word has length 45 [2019-09-20 13:27:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:10,831 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 469 transitions. [2019-09-20 13:27:10,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 469 transitions. [2019-09-20 13:27:10,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:10,836 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:10,836 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:10,836 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:10,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:10,837 INFO L82 PathProgramCache]: Analyzing trace with hash -592195955, now seen corresponding path program 1 times [2019-09-20 13:27:10,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:10,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:10,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,065 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:11,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:11,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:11,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:11,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:11,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:11,067 INFO L87 Difference]: Start difference. First operand 318 states and 469 transitions. Second operand 4 states. [2019-09-20 13:27:11,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:11,618 INFO L93 Difference]: Finished difference Result 504 states and 746 transitions. [2019-09-20 13:27:11,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:11,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:27:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:11,623 INFO L225 Difference]: With dead ends: 504 [2019-09-20 13:27:11,624 INFO L226 Difference]: Without dead ends: 504 [2019-09-20 13:27:11,624 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:11,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-20 13:27:11,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 368. [2019-09-20 13:27:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-20 13:27:11,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 555 transitions. [2019-09-20 13:27:11,670 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 555 transitions. Word has length 63 [2019-09-20 13:27:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:11,671 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 555 transitions. [2019-09-20 13:27:11,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 555 transitions. [2019-09-20 13:27:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:11,680 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:11,680 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,680 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:11,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:11,681 INFO L82 PathProgramCache]: Analyzing trace with hash -726209461, now seen corresponding path program 1 times [2019-09-20 13:27:11,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:11,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:11,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,839 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:11,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:11,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:11,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:11,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:11,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:11,841 INFO L87 Difference]: Start difference. First operand 368 states and 555 transitions. Second operand 4 states. [2019-09-20 13:27:12,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:12,180 INFO L93 Difference]: Finished difference Result 454 states and 681 transitions. [2019-09-20 13:27:12,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:12,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:27:12,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:12,184 INFO L225 Difference]: With dead ends: 454 [2019-09-20 13:27:12,184 INFO L226 Difference]: Without dead ends: 454 [2019-09-20 13:27:12,185 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,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-20 13:27:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 408. [2019-09-20 13:27:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-20 13:27:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2019-09-20 13:27:12,198 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 63 [2019-09-20 13:27:12,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:12,199 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2019-09-20 13:27:12,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2019-09-20 13:27:12,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:12,203 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:12,203 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:12,203 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:12,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:12,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1182891182, now seen corresponding path program 1 times [2019-09-20 13:27:12,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:12,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:12,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:12,285 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,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:12,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:12,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:12,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:12,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:12,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:12,287 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 4 states. [2019-09-20 13:27:12,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:12,724 INFO L93 Difference]: Finished difference Result 536 states and 804 transitions. [2019-09-20 13:27:12,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:12,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:12,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:12,733 INFO L225 Difference]: With dead ends: 536 [2019-09-20 13:27:12,734 INFO L226 Difference]: Without dead ends: 536 [2019-09-20 13:27:12,734 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,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-20 13:27:12,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 410. [2019-09-20 13:27:12,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 625 transitions. [2019-09-20 13:27:12,749 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 625 transitions. Word has length 64 [2019-09-20 13:27:12,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:12,750 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 625 transitions. [2019-09-20 13:27:12,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:12,750 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 625 transitions. [2019-09-20 13:27:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:27:12,753 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:12,753 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:12,753 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:12,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:12,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1433744923, now seen corresponding path program 1 times [2019-09-20 13:27:12,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:12,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:12,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:12,857 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:12,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:12,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:12,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:12,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:12,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:12,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:12,859 INFO L87 Difference]: Start difference. First operand 410 states and 625 transitions. Second operand 4 states. [2019-09-20 13:27:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:13,307 INFO L93 Difference]: Finished difference Result 534 states and 800 transitions. [2019-09-20 13:27:13,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:13,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:27:13,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:13,313 INFO L225 Difference]: With dead ends: 534 [2019-09-20 13:27:13,313 INFO L226 Difference]: Without dead ends: 534 [2019-09-20 13:27:13,314 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,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-20 13:27:13,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-20 13:27:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 623 transitions. [2019-09-20 13:27:13,325 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 623 transitions. Word has length 77 [2019-09-20 13:27:13,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:13,326 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 623 transitions. [2019-09-20 13:27:13,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:13,326 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 623 transitions. [2019-09-20 13:27:13,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:27:13,328 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:13,328 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:13,329 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:13,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:13,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1752241927, now seen corresponding path program 1 times [2019-09-20 13:27:13,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:13,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:13,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:13,400 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:13,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:13,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:13,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:13,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:13,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:13,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:13,403 INFO L87 Difference]: Start difference. First operand 410 states and 623 transitions. Second operand 4 states. [2019-09-20 13:27:13,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:13,872 INFO L93 Difference]: Finished difference Result 534 states and 798 transitions. [2019-09-20 13:27:13,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:13,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:27:13,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:13,876 INFO L225 Difference]: With dead ends: 534 [2019-09-20 13:27:13,876 INFO L226 Difference]: Without dead ends: 534 [2019-09-20 13:27:13,876 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,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-20 13:27:13,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-20 13:27:13,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:13,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 621 transitions. [2019-09-20 13:27:13,888 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 621 transitions. Word has length 77 [2019-09-20 13:27:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:13,889 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 621 transitions. [2019-09-20 13:27:13,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 621 transitions. [2019-09-20 13:27:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:27:13,891 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:13,891 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,891 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:13,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:13,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1831863075, now seen corresponding path program 1 times [2019-09-20 13:27:13,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:13,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:13,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:14,001 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:14,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:14,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:14,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:14,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:14,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:14,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:14,005 INFO L87 Difference]: Start difference. First operand 410 states and 621 transitions. Second operand 4 states. [2019-09-20 13:27:14,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:14,336 INFO L93 Difference]: Finished difference Result 454 states and 675 transitions. [2019-09-20 13:27:14,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:14,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:27:14,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:14,340 INFO L225 Difference]: With dead ends: 454 [2019-09-20 13:27:14,341 INFO L226 Difference]: Without dead ends: 454 [2019-09-20 13:27:14,342 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,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-20 13:27:14,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-20 13:27:14,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 619 transitions. [2019-09-20 13:27:14,358 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 619 transitions. Word has length 77 [2019-09-20 13:27:14,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:14,358 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 619 transitions. [2019-09-20 13:27:14,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:14,359 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 619 transitions. [2019-09-20 13:27:14,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:27:14,361 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:14,362 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,362 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:14,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:14,363 INFO L82 PathProgramCache]: Analyzing trace with hash 722882629, now seen corresponding path program 1 times [2019-09-20 13:27:14,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:14,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:14,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:14,448 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,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:14,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:14,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:14,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:14,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:14,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:14,451 INFO L87 Difference]: Start difference. First operand 410 states and 619 transitions. Second operand 4 states. [2019-09-20 13:27:14,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:14,776 INFO L93 Difference]: Finished difference Result 454 states and 673 transitions. [2019-09-20 13:27:14,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:14,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:27:14,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:14,780 INFO L225 Difference]: With dead ends: 454 [2019-09-20 13:27:14,780 INFO L226 Difference]: Without dead ends: 454 [2019-09-20 13:27:14,781 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,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-20 13:27:14,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-20 13:27:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 617 transitions. [2019-09-20 13:27:14,791 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 617 transitions. Word has length 77 [2019-09-20 13:27:14,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:14,791 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 617 transitions. [2019-09-20 13:27:14,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:14,792 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 617 transitions. [2019-09-20 13:27:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:14,793 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:14,794 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:14,794 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:14,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:14,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1460682036, now seen corresponding path program 1 times [2019-09-20 13:27:14,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:14,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:14,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:14,903 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:14,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:14,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:14,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:14,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:14,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:14,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:14,906 INFO L87 Difference]: Start difference. First operand 410 states and 617 transitions. Second operand 4 states. [2019-09-20 13:27:15,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:15,349 INFO L93 Difference]: Finished difference Result 534 states and 792 transitions. [2019-09-20 13:27:15,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:15,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:15,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:15,353 INFO L225 Difference]: With dead ends: 534 [2019-09-20 13:27:15,353 INFO L226 Difference]: Without dead ends: 534 [2019-09-20 13:27:15,354 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,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-20 13:27:15,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-20 13:27:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 615 transitions. [2019-09-20 13:27:15,365 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 615 transitions. Word has length 78 [2019-09-20 13:27:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:15,365 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 615 transitions. [2019-09-20 13:27:15,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2019-09-20 13:27:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:15,367 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:15,368 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:15,368 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:15,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:15,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1160620953, now seen corresponding path program 1 times [2019-09-20 13:27:15,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:15,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:15,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:15,439 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:15,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:15,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:15,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:15,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:15,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:15,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:15,441 INFO L87 Difference]: Start difference. First operand 410 states and 615 transitions. Second operand 4 states. [2019-09-20 13:27:15,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:15,922 INFO L93 Difference]: Finished difference Result 534 states and 790 transitions. [2019-09-20 13:27:15,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:15,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:15,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:15,927 INFO L225 Difference]: With dead ends: 534 [2019-09-20 13:27:15,927 INFO L226 Difference]: Without dead ends: 534 [2019-09-20 13:27:15,928 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,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-20 13:27:15,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-20 13:27:15,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:15,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 613 transitions. [2019-09-20 13:27:15,940 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 613 transitions. Word has length 78 [2019-09-20 13:27:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:15,940 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 613 transitions. [2019-09-20 13:27:15,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 613 transitions. [2019-09-20 13:27:15,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:15,942 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:15,942 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,942 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:15,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:15,943 INFO L82 PathProgramCache]: Analyzing trace with hash 988918094, now seen corresponding path program 1 times [2019-09-20 13:27:15,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:15,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:15,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:16,012 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:16,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:16,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:16,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:16,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:16,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:16,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:16,014 INFO L87 Difference]: Start difference. First operand 410 states and 613 transitions. Second operand 4 states. [2019-09-20 13:27:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:16,323 INFO L93 Difference]: Finished difference Result 454 states and 667 transitions. [2019-09-20 13:27:16,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:16,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:16,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:16,326 INFO L225 Difference]: With dead ends: 454 [2019-09-20 13:27:16,326 INFO L226 Difference]: Without dead ends: 454 [2019-09-20 13:27:16,326 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,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-20 13:27:16,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-20 13:27:16,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:16,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 611 transitions. [2019-09-20 13:27:16,336 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 611 transitions. Word has length 78 [2019-09-20 13:27:16,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:16,336 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 611 transitions. [2019-09-20 13:27:16,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:16,337 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 611 transitions. [2019-09-20 13:27:16,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:16,338 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:16,338 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,338 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:16,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:16,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1288979177, now seen corresponding path program 1 times [2019-09-20 13:27:16,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:16,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:16,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:16,402 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,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:16,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:16,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:16,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:16,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:16,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:16,404 INFO L87 Difference]: Start difference. First operand 410 states and 611 transitions. Second operand 4 states. [2019-09-20 13:27:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:16,705 INFO L93 Difference]: Finished difference Result 454 states and 665 transitions. [2019-09-20 13:27:16,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:16,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:16,707 INFO L225 Difference]: With dead ends: 454 [2019-09-20 13:27:16,707 INFO L226 Difference]: Without dead ends: 454 [2019-09-20 13:27:16,708 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,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-20 13:27:16,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-20 13:27:16,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 609 transitions. [2019-09-20 13:27:16,717 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 609 transitions. Word has length 78 [2019-09-20 13:27:16,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:16,718 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 609 transitions. [2019-09-20 13:27:16,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 609 transitions. [2019-09-20 13:27:16,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:16,719 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:16,720 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:16,720 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:16,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:16,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2074470850, now seen corresponding path program 1 times [2019-09-20 13:27:16,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:16,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:16,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:16,783 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:16,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:16,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:16,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:16,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:16,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:16,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:16,789 INFO L87 Difference]: Start difference. First operand 410 states and 609 transitions. Second operand 4 states. [2019-09-20 13:27:17,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:17,204 INFO L93 Difference]: Finished difference Result 534 states and 784 transitions. [2019-09-20 13:27:17,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:17,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:17,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:17,208 INFO L225 Difference]: With dead ends: 534 [2019-09-20 13:27:17,208 INFO L226 Difference]: Without dead ends: 534 [2019-09-20 13:27:17,208 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,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-20 13:27:17,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-20 13:27:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 607 transitions. [2019-09-20 13:27:17,219 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 607 transitions. Word has length 79 [2019-09-20 13:27:17,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:17,219 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 607 transitions. [2019-09-20 13:27:17,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 607 transitions. [2019-09-20 13:27:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:17,221 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:17,221 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:17,221 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:17,222 INFO L82 PathProgramCache]: Analyzing trace with hash 784493186, now seen corresponding path program 1 times [2019-09-20 13:27:17,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:17,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:17,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:17,304 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:17,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:17,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:17,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:17,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:17,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:17,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:17,306 INFO L87 Difference]: Start difference. First operand 410 states and 607 transitions. Second operand 4 states. [2019-09-20 13:27:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:17,695 INFO L93 Difference]: Finished difference Result 528 states and 775 transitions. [2019-09-20 13:27:17,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:17,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:17,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:17,700 INFO L225 Difference]: With dead ends: 528 [2019-09-20 13:27:17,700 INFO L226 Difference]: Without dead ends: 528 [2019-09-20 13:27:17,700 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,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-20 13:27:17,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 410. [2019-09-20 13:27:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 605 transitions. [2019-09-20 13:27:17,710 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 605 transitions. Word has length 79 [2019-09-20 13:27:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:17,710 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 605 transitions. [2019-09-20 13:27:17,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 605 transitions. [2019-09-20 13:27:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:17,712 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:17,712 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,712 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:17,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:17,713 INFO L82 PathProgramCache]: Analyzing trace with hash 702663552, now seen corresponding path program 1 times [2019-09-20 13:27:17,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:17,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:17,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:17,777 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,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:17,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:17,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:17,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:17,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:17,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:17,779 INFO L87 Difference]: Start difference. First operand 410 states and 605 transitions. Second operand 4 states. [2019-09-20 13:27:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:18,065 INFO L93 Difference]: Finished difference Result 454 states and 659 transitions. [2019-09-20 13:27:18,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:18,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:18,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:18,068 INFO L225 Difference]: With dead ends: 454 [2019-09-20 13:27:18,068 INFO L226 Difference]: Without dead ends: 454 [2019-09-20 13:27:18,069 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,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-20 13:27:18,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-20 13:27:18,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 603 transitions. [2019-09-20 13:27:18,077 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 603 transitions. Word has length 79 [2019-09-20 13:27:18,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:18,078 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 603 transitions. [2019-09-20 13:27:18,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 603 transitions. [2019-09-20 13:27:18,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:18,079 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:18,079 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,080 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:18,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:18,080 INFO L82 PathProgramCache]: Analyzing trace with hash -587314112, now seen corresponding path program 1 times [2019-09-20 13:27:18,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:18,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:18,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:18,143 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,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:18,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:18,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:18,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:18,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:18,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:18,145 INFO L87 Difference]: Start difference. First operand 410 states and 603 transitions. Second operand 4 states. [2019-09-20 13:27:18,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:18,482 INFO L93 Difference]: Finished difference Result 448 states and 650 transitions. [2019-09-20 13:27:18,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:18,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:18,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:18,487 INFO L225 Difference]: With dead ends: 448 [2019-09-20 13:27:18,487 INFO L226 Difference]: Without dead ends: 448 [2019-09-20 13:27:18,488 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,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-09-20 13:27:18,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 410. [2019-09-20 13:27:18,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 601 transitions. [2019-09-20 13:27:18,502 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 601 transitions. Word has length 79 [2019-09-20 13:27:18,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:18,502 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 601 transitions. [2019-09-20 13:27:18,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:18,503 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 601 transitions. [2019-09-20 13:27:18,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:18,505 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:18,506 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:18,506 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:18,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:18,507 INFO L82 PathProgramCache]: Analyzing trace with hash 51641255, now seen corresponding path program 1 times [2019-09-20 13:27:18,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:18,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:18,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:18,585 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:18,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:18,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:18,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:18,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:18,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:18,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:18,587 INFO L87 Difference]: Start difference. First operand 410 states and 601 transitions. Second operand 4 states. [2019-09-20 13:27:19,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:19,065 INFO L93 Difference]: Finished difference Result 510 states and 747 transitions. [2019-09-20 13:27:19,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:19,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:19,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:19,068 INFO L225 Difference]: With dead ends: 510 [2019-09-20 13:27:19,069 INFO L226 Difference]: Without dead ends: 510 [2019-09-20 13:27:19,069 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,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-20 13:27:19,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 410. [2019-09-20 13:27:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 599 transitions. [2019-09-20 13:27:19,080 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 599 transitions. Word has length 80 [2019-09-20 13:27:19,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:19,080 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 599 transitions. [2019-09-20 13:27:19,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 599 transitions. [2019-09-20 13:27:19,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:19,082 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:19,083 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,083 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:19,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:19,083 INFO L82 PathProgramCache]: Analyzing trace with hash 475287977, now seen corresponding path program 1 times [2019-09-20 13:27:19,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:19,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:19,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:19,150 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,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:19,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:19,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:19,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:19,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:19,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:19,152 INFO L87 Difference]: Start difference. First operand 410 states and 599 transitions. Second operand 4 states. [2019-09-20 13:27:19,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:19,427 INFO L93 Difference]: Finished difference Result 430 states and 624 transitions. [2019-09-20 13:27:19,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:19,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:19,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:19,431 INFO L225 Difference]: With dead ends: 430 [2019-09-20 13:27:19,431 INFO L226 Difference]: Without dead ends: 430 [2019-09-20 13:27:19,432 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,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-09-20 13:27:19,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 410. [2019-09-20 13:27:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 597 transitions. [2019-09-20 13:27:19,441 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 597 transitions. Word has length 80 [2019-09-20 13:27:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:19,441 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 597 transitions. [2019-09-20 13:27:19,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 597 transitions. [2019-09-20 13:27:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:19,443 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:19,443 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:19,443 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:19,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:19,444 INFO L82 PathProgramCache]: Analyzing trace with hash 643036702, now seen corresponding path program 1 times [2019-09-20 13:27:19,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:19,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:19,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:19,504 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,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:19,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:19,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:19,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:19,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:19,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:19,506 INFO L87 Difference]: Start difference. First operand 410 states and 597 transitions. Second operand 4 states. [2019-09-20 13:27:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:19,911 INFO L93 Difference]: Finished difference Result 510 states and 743 transitions. [2019-09-20 13:27:19,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:19,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:19,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:19,915 INFO L225 Difference]: With dead ends: 510 [2019-09-20 13:27:19,915 INFO L226 Difference]: Without dead ends: 510 [2019-09-20 13:27:19,915 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,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-20 13:27:19,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 410. [2019-09-20 13:27:19,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 595 transitions. [2019-09-20 13:27:19,925 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 595 transitions. Word has length 81 [2019-09-20 13:27:19,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:19,925 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 595 transitions. [2019-09-20 13:27:19,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 595 transitions. [2019-09-20 13:27:19,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:19,927 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:19,927 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:19,928 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:19,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:19,928 INFO L82 PathProgramCache]: Analyzing trace with hash 891183196, now seen corresponding path program 1 times [2019-09-20 13:27:19,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:19,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:19,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:19,986 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:19,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:19,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:19,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:19,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:19,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:19,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:19,988 INFO L87 Difference]: Start difference. First operand 410 states and 595 transitions. Second operand 3 states. [2019-09-20 13:27:20,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:20,021 INFO L93 Difference]: Finished difference Result 559 states and 812 transitions. [2019-09-20 13:27:20,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:20,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-20 13:27:20,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:20,024 INFO L225 Difference]: With dead ends: 559 [2019-09-20 13:27:20,024 INFO L226 Difference]: Without dead ends: 559 [2019-09-20 13:27:20,025 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:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-20 13:27:20,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2019-09-20 13:27:20,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-20 13:27:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 812 transitions. [2019-09-20 13:27:20,036 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 812 transitions. Word has length 81 [2019-09-20 13:27:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:20,036 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 812 transitions. [2019-09-20 13:27:20,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 812 transitions. [2019-09-20 13:27:20,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:27:20,038 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:20,039 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:20,039 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:20,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:20,039 INFO L82 PathProgramCache]: Analyzing trace with hash 363210002, now seen corresponding path program 1 times [2019-09-20 13:27:20,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:20,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:20,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:20,098 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:20,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:20,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:20,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:20,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:20,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:20,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:20,100 INFO L87 Difference]: Start difference. First operand 559 states and 812 transitions. Second operand 3 states. [2019-09-20 13:27:20,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:20,136 INFO L93 Difference]: Finished difference Result 708 states and 1030 transitions. [2019-09-20 13:27:20,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:20,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-20 13:27:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:20,141 INFO L225 Difference]: With dead ends: 708 [2019-09-20 13:27:20,142 INFO L226 Difference]: Without dead ends: 708 [2019-09-20 13:27:20,142 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:20,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-09-20 13:27:20,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2019-09-20 13:27:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-09-20 13:27:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1030 transitions. [2019-09-20 13:27:20,156 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1030 transitions. Word has length 83 [2019-09-20 13:27:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:20,157 INFO L475 AbstractCegarLoop]: Abstraction has 708 states and 1030 transitions. [2019-09-20 13:27:20,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1030 transitions. [2019-09-20 13:27:20,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:20,159 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:20,159 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:20,160 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:20,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:20,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1857235727, now seen corresponding path program 1 times [2019-09-20 13:27:20,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:20,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:20,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:20,240 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:20,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:20,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:20,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:20,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:20,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:20,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:20,243 INFO L87 Difference]: Start difference. First operand 708 states and 1030 transitions. Second operand 3 states. [2019-09-20 13:27:20,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:20,284 INFO L93 Difference]: Finished difference Result 857 states and 1249 transitions. [2019-09-20 13:27:20,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:20,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-20 13:27:20,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:20,289 INFO L225 Difference]: With dead ends: 857 [2019-09-20 13:27:20,290 INFO L226 Difference]: Without dead ends: 857 [2019-09-20 13:27:20,290 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:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2019-09-20 13:27:20,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 857. [2019-09-20 13:27:20,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-09-20 13:27:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1249 transitions. [2019-09-20 13:27:20,316 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1249 transitions. Word has length 104 [2019-09-20 13:27:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:20,317 INFO L475 AbstractCegarLoop]: Abstraction has 857 states and 1249 transitions. [2019-09-20 13:27:20,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1249 transitions. [2019-09-20 13:27:20,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-20 13:27:20,322 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:20,322 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:20,322 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:20,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:20,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1155312928, now seen corresponding path program 1 times [2019-09-20 13:27:20,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:20,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:20,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:20,443 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-20 13:27:20,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:20,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:20,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:20,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:20,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:20,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:20,447 INFO L87 Difference]: Start difference. First operand 857 states and 1249 transitions. Second operand 4 states. [2019-09-20 13:27:20,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:20,923 INFO L93 Difference]: Finished difference Result 1401 states and 2067 transitions. [2019-09-20 13:27:20,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:20,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-20 13:27:20,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:20,930 INFO L225 Difference]: With dead ends: 1401 [2019-09-20 13:27:20,931 INFO L226 Difference]: Without dead ends: 1401 [2019-09-20 13:27:20,931 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:20,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2019-09-20 13:27:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 965. [2019-09-20 13:27:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-20 13:27:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1429 transitions. [2019-09-20 13:27:20,954 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1429 transitions. Word has length 141 [2019-09-20 13:27:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:20,954 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1429 transitions. [2019-09-20 13:27:20,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1429 transitions. [2019-09-20 13:27:20,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-20 13:27:20,957 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:20,958 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:20,958 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:20,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:20,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1352173795, now seen corresponding path program 1 times [2019-09-20 13:27:20,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:20,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:20,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-20 13:27:21,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:21,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:21,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:21,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:21,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:21,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:21,049 INFO L87 Difference]: Start difference. First operand 965 states and 1429 transitions. Second operand 4 states. [2019-09-20 13:27:21,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:21,480 INFO L93 Difference]: Finished difference Result 1374 states and 2023 transitions. [2019-09-20 13:27:21,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:21,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-20 13:27:21,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:21,489 INFO L225 Difference]: With dead ends: 1374 [2019-09-20 13:27:21,490 INFO L226 Difference]: Without dead ends: 1374 [2019-09-20 13:27:21,490 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:21,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2019-09-20 13:27:21,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 971. [2019-09-20 13:27:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-09-20 13:27:21,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1435 transitions. [2019-09-20 13:27:21,521 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1435 transitions. Word has length 142 [2019-09-20 13:27:21,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:21,522 INFO L475 AbstractCegarLoop]: Abstraction has 971 states and 1435 transitions. [2019-09-20 13:27:21,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1435 transitions. [2019-09-20 13:27:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-20 13:27:21,528 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:21,528 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:21,528 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:21,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:21,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1463416888, now seen corresponding path program 1 times [2019-09-20 13:27:21,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:21,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:21,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-20 13:27:21,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:21,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:21,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:21,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:21,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:21,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:21,696 INFO L87 Difference]: Start difference. First operand 971 states and 1435 transitions. Second operand 4 states. [2019-09-20 13:27:22,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:22,090 INFO L93 Difference]: Finished difference Result 1368 states and 2011 transitions. [2019-09-20 13:27:22,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:22,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-20 13:27:22,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:22,096 INFO L225 Difference]: With dead ends: 1368 [2019-09-20 13:27:22,096 INFO L226 Difference]: Without dead ends: 1368 [2019-09-20 13:27:22,096 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,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2019-09-20 13:27:22,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 971. [2019-09-20 13:27:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-09-20 13:27:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1429 transitions. [2019-09-20 13:27:22,115 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1429 transitions. Word has length 155 [2019-09-20 13:27:22,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:22,116 INFO L475 AbstractCegarLoop]: Abstraction has 971 states and 1429 transitions. [2019-09-20 13:27:22,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1429 transitions. [2019-09-20 13:27:22,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-20 13:27:22,119 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:22,119 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:22,120 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:22,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:22,120 INFO L82 PathProgramCache]: Analyzing trace with hash -2001426458, now seen corresponding path program 1 times [2019-09-20 13:27:22,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:22,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:22,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-20 13:27:22,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:22,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:22,211 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:22,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:22,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:22,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:22,212 INFO L87 Difference]: Start difference. First operand 971 states and 1429 transitions. Second operand 4 states. [2019-09-20 13:27:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:22,719 INFO L93 Difference]: Finished difference Result 1368 states and 2005 transitions. [2019-09-20 13:27:22,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:22,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-20 13:27:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:22,724 INFO L225 Difference]: With dead ends: 1368 [2019-09-20 13:27:22,724 INFO L226 Difference]: Without dead ends: 1368 [2019-09-20 13:27:22,724 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,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2019-09-20 13:27:22,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 971. [2019-09-20 13:27:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-09-20 13:27:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1423 transitions. [2019-09-20 13:27:22,744 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1423 transitions. Word has length 155 [2019-09-20 13:27:22,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:22,744 INFO L475 AbstractCegarLoop]: Abstraction has 971 states and 1423 transitions. [2019-09-20 13:27:22,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:22,744 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1423 transitions. [2019-09-20 13:27:22,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-20 13:27:22,748 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:22,748 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:22,748 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:22,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:22,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1135265655, now seen corresponding path program 1 times [2019-09-20 13:27:22,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:22,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:22,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-20 13:27:22,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:22,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:22,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:22,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:22,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:22,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:22,831 INFO L87 Difference]: Start difference. First operand 971 states and 1423 transitions. Second operand 4 states. [2019-09-20 13:27:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:23,237 INFO L93 Difference]: Finished difference Result 1368 states and 1999 transitions. [2019-09-20 13:27:23,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:23,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-20 13:27:23,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:23,244 INFO L225 Difference]: With dead ends: 1368 [2019-09-20 13:27:23,244 INFO L226 Difference]: Without dead ends: 1368 [2019-09-20 13:27:23,244 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:23,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2019-09-20 13:27:23,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 971. [2019-09-20 13:27:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-09-20 13:27:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1417 transitions. [2019-09-20 13:27:23,263 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1417 transitions. Word has length 156 [2019-09-20 13:27:23,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:23,264 INFO L475 AbstractCegarLoop]: Abstraction has 971 states and 1417 transitions. [2019-09-20 13:27:23,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:23,264 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1417 transitions. [2019-09-20 13:27:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-20 13:27:23,267 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:23,268 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:23,268 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:23,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:23,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1198398414, now seen corresponding path program 1 times [2019-09-20 13:27:23,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:23,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:23,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-20 13:27:23,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:23,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:23,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:23,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:23,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:23,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:23,372 INFO L87 Difference]: Start difference. First operand 971 states and 1417 transitions. Second operand 4 states. [2019-09-20 13:27:23,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:23,794 INFO L93 Difference]: Finished difference Result 1368 states and 1993 transitions. [2019-09-20 13:27:23,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:23,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-20 13:27:23,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:23,801 INFO L225 Difference]: With dead ends: 1368 [2019-09-20 13:27:23,801 INFO L226 Difference]: Without dead ends: 1368 [2019-09-20 13:27:23,801 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:23,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2019-09-20 13:27:23,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 971. [2019-09-20 13:27:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-09-20 13:27:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1411 transitions. [2019-09-20 13:27:23,819 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1411 transitions. Word has length 156 [2019-09-20 13:27:23,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:23,819 INFO L475 AbstractCegarLoop]: Abstraction has 971 states and 1411 transitions. [2019-09-20 13:27:23,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:23,819 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1411 transitions. [2019-09-20 13:27:23,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-20 13:27:23,822 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:23,823 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:23,823 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:23,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:23,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1200498443, now seen corresponding path program 1 times [2019-09-20 13:27:23,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:23,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:23,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-20 13:27:23,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:23,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:23,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:23,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:23,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:23,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:23,906 INFO L87 Difference]: Start difference. First operand 971 states and 1411 transitions. Second operand 4 states. [2019-09-20 13:27:24,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:24,306 INFO L93 Difference]: Finished difference Result 1368 states and 1987 transitions. [2019-09-20 13:27:24,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:24,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-20 13:27:24,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:24,313 INFO L225 Difference]: With dead ends: 1368 [2019-09-20 13:27:24,313 INFO L226 Difference]: Without dead ends: 1368 [2019-09-20 13:27:24,313 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:24,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2019-09-20 13:27:24,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 971. [2019-09-20 13:27:24,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-09-20 13:27:24,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1405 transitions. [2019-09-20 13:27:24,330 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1405 transitions. Word has length 157 [2019-09-20 13:27:24,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:24,331 INFO L475 AbstractCegarLoop]: Abstraction has 971 states and 1405 transitions. [2019-09-20 13:27:24,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:24,331 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1405 transitions. [2019-09-20 13:27:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-20 13:27:24,334 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:24,334 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:24,335 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:24,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:24,336 INFO L82 PathProgramCache]: Analyzing trace with hash -499704245, now seen corresponding path program 1 times [2019-09-20 13:27:24,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:24,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:24,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-20 13:27:24,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:24,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:24,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:24,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:24,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:24,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:24,428 INFO L87 Difference]: Start difference. First operand 971 states and 1405 transitions. Second operand 4 states. [2019-09-20 13:27:24,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:24,911 INFO L93 Difference]: Finished difference Result 1351 states and 1960 transitions. [2019-09-20 13:27:24,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:24,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-20 13:27:24,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:24,919 INFO L225 Difference]: With dead ends: 1351 [2019-09-20 13:27:24,920 INFO L226 Difference]: Without dead ends: 1351 [2019-09-20 13:27:24,920 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:24,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-09-20 13:27:24,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 971. [2019-09-20 13:27:24,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-09-20 13:27:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1399 transitions. [2019-09-20 13:27:24,940 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1399 transitions. Word has length 157 [2019-09-20 13:27:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:24,940 INFO L475 AbstractCegarLoop]: Abstraction has 971 states and 1399 transitions. [2019-09-20 13:27:24,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1399 transitions. [2019-09-20 13:27:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-20 13:27:24,943 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:24,943 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:24,944 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:24,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1849324430, now seen corresponding path program 1 times [2019-09-20 13:27:24,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:24,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:24,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-20 13:27:25,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:25,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:25,023 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:25,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:25,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:25,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:25,024 INFO L87 Difference]: Start difference. First operand 971 states and 1399 transitions. Second operand 4 states. [2019-09-20 13:27:25,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:25,357 INFO L93 Difference]: Finished difference Result 1297 states and 1888 transitions. [2019-09-20 13:27:25,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:25,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-20 13:27:25,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:25,364 INFO L225 Difference]: With dead ends: 1297 [2019-09-20 13:27:25,364 INFO L226 Difference]: Without dead ends: 1297 [2019-09-20 13:27:25,365 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:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-09-20 13:27:25,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 971. [2019-09-20 13:27:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-09-20 13:27:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1393 transitions. [2019-09-20 13:27:25,379 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1393 transitions. Word has length 158 [2019-09-20 13:27:25,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:25,380 INFO L475 AbstractCegarLoop]: Abstraction has 971 states and 1393 transitions. [2019-09-20 13:27:25,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:25,380 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1393 transitions. [2019-09-20 13:27:25,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-20 13:27:25,382 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:25,383 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:25,383 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:25,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:25,383 INFO L82 PathProgramCache]: Analyzing trace with hash -329495249, now seen corresponding path program 2 times [2019-09-20 13:27:25,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:25,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:25,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 234 proven. 4 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-20 13:27:25,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:27:25,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:27:25,500 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:27:25,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:27:25,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:27:25,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:27:25,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:27:25,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-20 13:27:25,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-20 13:27:25,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:27:25,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 13:27:25,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:27:25,850 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-09-20 13:27:25,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-09-20 13:27:25,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:27:25,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:27:25,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:27:25,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-09-20 13:27:25,940 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-09-20 13:27:25,940 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:27:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-09-20 13:27:26,091 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:27:26,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [6] total 11 [2019-09-20 13:27:26,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:26,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:26,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:26,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:27:26,093 INFO L87 Difference]: Start difference. First operand 971 states and 1393 transitions. Second operand 4 states. [2019-09-20 13:27:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,439 INFO L93 Difference]: Finished difference Result 1255 states and 1813 transitions. [2019-09-20 13:27:26,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:26,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-20 13:27:26,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,446 INFO L225 Difference]: With dead ends: 1255 [2019-09-20 13:27:26,447 INFO L226 Difference]: Without dead ends: 1255 [2019-09-20 13:27:26,447 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 315 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:27:26,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2019-09-20 13:27:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1103. [2019-09-20 13:27:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2019-09-20 13:27:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1621 transitions. [2019-09-20 13:27:26,478 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1621 transitions. Word has length 159 [2019-09-20 13:27:26,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,479 INFO L475 AbstractCegarLoop]: Abstraction has 1103 states and 1621 transitions. [2019-09-20 13:27:26,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1621 transitions. [2019-09-20 13:27:26,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-20 13:27:26,482 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:26,482 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:26,483 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:26,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1501655387, now seen corresponding path program 1 times [2019-09-20 13:27:26,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:26,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:27:26,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 234 proven. 4 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-09-20 13:27:26,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:27:26,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:27:26,592 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 163 with the following transitions: [2019-09-20 13:27:26,595 INFO L207 CegarAbsIntRunner]: [0], [38], [39], [40], [43], [52], [63], [72], [74], [79], [84], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [142], [284], [287], [295], [298], [303], [306], [308], [311], [319], [322], [324], [326], [328], [331], [333], [336], [344], [346], [348], [351], [353], [359], [364], [366], [369], [523], [557], [559], [571], [590], [596], [597], [598] [2019-09-20 13:27:26,638 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:27:26,639 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:27:26,700 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-20 13:27:26,702 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:26,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,707 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-20 13:27:26,762 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-20 13:27:26,762 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-20 13:27:26,767 INFO L420 sIntCurrentIteration]: We unified 161 AI predicates to 161 [2019-09-20 13:27:26,767 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-20 13:27:26,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:27:26,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-20 13:27:26,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:26,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:27:26,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:27:26,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:27:26,769 INFO L87 Difference]: Start difference. First operand 1103 states and 1621 transitions. Second operand 2 states. [2019-09-20 13:27:26,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,770 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-20 13:27:26,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:27:26,770 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 162 [2019-09-20 13:27:26,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,771 INFO L225 Difference]: With dead ends: 2 [2019-09-20 13:27:26,771 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:27:26,771 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 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:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:27:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:27:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:27:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:27:26,772 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 162 [2019-09-20 13:27:26,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,772 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:27:26,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:27:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:27:26,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:27:26,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:27:26 BoogieIcfgContainer [2019-09-20 13:27:26,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:27:26,786 INFO L168 Benchmark]: Toolchain (without parser) took 19541.72 ms. Allocated memory was 132.6 MB in the beginning and 478.2 MB in the end (delta: 345.5 MB). Free memory was 86.9 MB in the beginning and 271.9 MB in the end (delta: -184.9 MB). Peak memory consumption was 160.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:26,787 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:27:26,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1076.31 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 86.7 MB in the beginning and 155.4 MB in the end (delta: -68.7 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:26,790 INFO L168 Benchmark]: Boogie Preprocessor took 144.68 ms. Allocated memory is still 199.2 MB. Free memory was 155.4 MB in the beginning and 148.3 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:26,793 INFO L168 Benchmark]: RCFGBuilder took 1343.71 ms. Allocated memory was 199.2 MB in the beginning and 222.8 MB in the end (delta: 23.6 MB). Free memory was 147.6 MB in the beginning and 169.0 MB in the end (delta: -21.4 MB). Peak memory consumption was 82.0 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:26,793 INFO L168 Benchmark]: TraceAbstraction took 16971.84 ms. Allocated memory was 222.8 MB in the beginning and 478.2 MB in the end (delta: 255.3 MB). Free memory was 169.0 MB in the beginning and 271.9 MB in the end (delta: -102.8 MB). Peak memory consumption was 152.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:26,799 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1076.31 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 86.7 MB in the beginning and 155.4 MB in the end (delta: -68.7 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 144.68 ms. Allocated memory is still 199.2 MB. Free memory was 155.4 MB in the beginning and 148.3 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1343.71 ms. Allocated memory was 199.2 MB in the beginning and 222.8 MB in the end (delta: 23.6 MB). Free memory was 147.6 MB in the beginning and 169.0 MB in the end (delta: -21.4 MB). Peak memory consumption was 82.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16971.84 ms. Allocated memory was 222.8 MB in the beginning and 478.2 MB in the end (delta: 255.3 MB). Free memory was 169.0 MB in the beginning and 271.9 MB in the end (delta: -102.8 MB). Peak memory consumption was 152.5 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, 16.8s OverallTime, 34 OverallIterations, 8 TraceHistogramMax, 11.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7410 SDtfs, 2879 SDslu, 9493 SDs, 0 SdLazy, 5694 SolverSat, 214 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 654 GetRequests, 540 SyntacticMatches, 19 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1103occurred in iteration=33, 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.3726708074534162 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 5206 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 3567 NumberOfCodeBlocks, 3456 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3690 ConstructedInterpolants, 0 QuantifiedInterpolants, 880145 SizeOfPredicates, 3 NumberOfNonLiveVariables, 396 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 36 InterpolantComputations, 34 PerfectInterpolantSequences, 5434/5442 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...