java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_srvr.blast.12.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:47,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:47,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:47,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:47,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:47,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:47,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:47,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:47,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:47,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:47,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:47,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:47,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:47,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:47,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:47,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:47,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:47,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:47,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:47,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:47,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:47,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:47,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:47,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:47,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:47,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:47,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:47,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:47,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:47,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:47,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:47,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:47,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:47,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:47,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:47,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:47,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:47,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:47,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:47,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:47,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:47,328 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:47,348 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:47,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:47,349 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:47,350 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:47,350 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:47,350 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:47,351 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:47,351 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:47,351 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:47,351 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:47,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:47,354 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:47,354 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:47,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:47,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:47,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:47,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:47,355 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:47,355 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:47,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:47,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:47,356 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:47,356 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:47,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:47,357 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:47,357 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:47,357 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:47,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:47,358 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:47,358 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:47,412 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:47,432 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:47,438 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:47,440 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:47,440 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:47,441 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.12.i.cil-1.c [2019-09-20 13:27:47,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59a2f8d4/704c4fada8b348448f3c0fda60f777a7/FLAG00ad9c643 [2019-09-20 13:27:48,176 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:48,177 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.12.i.cil-1.c [2019-09-20 13:27:48,208 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59a2f8d4/704c4fada8b348448f3c0fda60f777a7/FLAG00ad9c643 [2019-09-20 13:27:48,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59a2f8d4/704c4fada8b348448f3c0fda60f777a7 [2019-09-20 13:27:48,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:48,407 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:48,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:48,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:48,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:48,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:48" (1/1) ... [2019-09-20 13:27:48,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b3c048f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:48, skipping insertion in model container [2019-09-20 13:27:48,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:48" (1/1) ... [2019-09-20 13:27:48,427 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:48,527 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:49,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:49,167 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:49,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:49,401 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:49,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:49 WrapperNode [2019-09-20 13:27:49,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:49,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:49,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:49,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:49,422 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:49" (1/1) ... [2019-09-20 13:27:49,423 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:49" (1/1) ... [2019-09-20 13:27:49,453 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:49" (1/1) ... [2019-09-20 13:27:49,454 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:49" (1/1) ... [2019-09-20 13:27:49,537 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:49" (1/1) ... [2019-09-20 13:27:49,562 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:49" (1/1) ... [2019-09-20 13:27:49,571 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:49" (1/1) ... [2019-09-20 13:27:49,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:49,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:49,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:49,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:49,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:49" (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:49,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:49,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:49,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:27:49,688 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:27:49,688 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:49,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:27:49,688 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:49,689 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:49,689 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:49,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:49,689 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:49,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:49,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:49,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:49,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:49,690 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:49,691 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:27:49,691 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:49,691 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:27:49,691 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:27:49,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:49,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:49,692 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:49,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:49,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:49,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:49,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:49,693 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:49,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:49,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:49,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:49,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:49,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:49,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:49,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:49,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:49,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:49,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:49,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:50,374 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:51,161 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:27:51,161 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:27:51,183 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:51,183 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:51,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:51 BoogieIcfgContainer [2019-09-20 13:27:51,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:51,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:51,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:51,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:51,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:48" (1/3) ... [2019-09-20 13:27:51,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b74bfce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:51, skipping insertion in model container [2019-09-20 13:27:51,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:49" (2/3) ... [2019-09-20 13:27:51,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b74bfce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:51, skipping insertion in model container [2019-09-20 13:27:51,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:51" (3/3) ... [2019-09-20 13:27:51,196 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12.i.cil-1.c [2019-09-20 13:27:51,206 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:51,217 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:51,233 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:51,256 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:51,257 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:51,257 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:51,257 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:51,257 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:51,257 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:51,257 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:51,258 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:51,277 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2019-09-20 13:27:51,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-20 13:27:51,291 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:51,292 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:51,294 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:51,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:51,300 INFO L82 PathProgramCache]: Analyzing trace with hash -525661899, now seen corresponding path program 1 times [2019-09-20 13:27:51,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:51,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:51,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:51,720 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:51,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:51,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:51,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:51,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:51,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:51,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:51,746 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 4 states. [2019-09-20 13:27:52,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:52,169 INFO L93 Difference]: Finished difference Result 192 states and 314 transitions. [2019-09-20 13:27:52,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:52,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-09-20 13:27:52,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:52,194 INFO L225 Difference]: With dead ends: 192 [2019-09-20 13:27:52,194 INFO L226 Difference]: Without dead ends: 171 [2019-09-20 13:27:52,199 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:52,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-20 13:27:52,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2019-09-20 13:27:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-20 13:27:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 236 transitions. [2019-09-20 13:27:52,280 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 236 transitions. Word has length 47 [2019-09-20 13:27:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:52,281 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 236 transitions. [2019-09-20 13:27:52,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 236 transitions. [2019-09-20 13:27:52,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 13:27:52,287 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:52,288 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:52,288 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:52,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:52,288 INFO L82 PathProgramCache]: Analyzing trace with hash -184670169, now seen corresponding path program 1 times [2019-09-20 13:27:52,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:52,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:52,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:52,409 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:52,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:52,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:52,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:52,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:52,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:52,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:52,416 INFO L87 Difference]: Start difference. First operand 154 states and 236 transitions. Second operand 4 states. [2019-09-20 13:27:52,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:52,820 INFO L93 Difference]: Finished difference Result 171 states and 256 transitions. [2019-09-20 13:27:52,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:52,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-09-20 13:27:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:52,823 INFO L225 Difference]: With dead ends: 171 [2019-09-20 13:27:52,823 INFO L226 Difference]: Without dead ends: 171 [2019-09-20 13:27:52,824 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:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-20 13:27:52,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2019-09-20 13:27:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-20 13:27:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 235 transitions. [2019-09-20 13:27:52,834 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 235 transitions. Word has length 60 [2019-09-20 13:27:52,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:52,835 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 235 transitions. [2019-09-20 13:27:52,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 235 transitions. [2019-09-20 13:27:52,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-20 13:27:52,837 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:52,837 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:52,838 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:52,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:52,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1954240703, now seen corresponding path program 1 times [2019-09-20 13:27:52,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:52,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:52,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:52,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:52,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:52,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:52,983 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:52,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:52,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:52,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:52,984 INFO L87 Difference]: Start difference. First operand 154 states and 235 transitions. Second operand 4 states. [2019-09-20 13:27:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:53,430 INFO L93 Difference]: Finished difference Result 170 states and 254 transitions. [2019-09-20 13:27:53,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:53,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-09-20 13:27:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:53,432 INFO L225 Difference]: With dead ends: 170 [2019-09-20 13:27:53,433 INFO L226 Difference]: Without dead ends: 170 [2019-09-20 13:27:53,433 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:53,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-20 13:27:53,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 154. [2019-09-20 13:27:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-20 13:27:53,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 234 transitions. [2019-09-20 13:27:53,442 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 234 transitions. Word has length 61 [2019-09-20 13:27:53,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:53,443 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 234 transitions. [2019-09-20 13:27:53,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 234 transitions. [2019-09-20 13:27:53,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-20 13:27:53,445 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:53,445 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:53,449 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:53,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:53,450 INFO L82 PathProgramCache]: Analyzing trace with hash 950618707, now seen corresponding path program 1 times [2019-09-20 13:27:53,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:53,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:53,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:53,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:53,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:27:53,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:53,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:27:53,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:27:53,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:53,585 INFO L87 Difference]: Start difference. First operand 154 states and 234 transitions. Second operand 5 states. [2019-09-20 13:27:54,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:54,064 INFO L93 Difference]: Finished difference Result 175 states and 262 transitions. [2019-09-20 13:27:54,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:54,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-20 13:27:54,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:54,066 INFO L225 Difference]: With dead ends: 175 [2019-09-20 13:27:54,067 INFO L226 Difference]: Without dead ends: 175 [2019-09-20 13:27:54,067 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:27:54,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-20 13:27:54,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-09-20 13:27:54,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-20 13:27:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 261 transitions. [2019-09-20 13:27:54,078 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 261 transitions. Word has length 61 [2019-09-20 13:27:54,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:54,078 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 261 transitions. [2019-09-20 13:27:54,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:27:54,079 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 261 transitions. [2019-09-20 13:27:54,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-20 13:27:54,080 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:54,081 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:54,081 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:54,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:54,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1314070005, now seen corresponding path program 1 times [2019-09-20 13:27:54,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:54,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:54,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:54,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:54,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:54,182 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:54,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:54,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:54,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:54,183 INFO L87 Difference]: Start difference. First operand 174 states and 261 transitions. Second operand 4 states. [2019-09-20 13:27:54,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:54,512 INFO L93 Difference]: Finished difference Result 189 states and 278 transitions. [2019-09-20 13:27:54,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:54,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-09-20 13:27:54,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:54,515 INFO L225 Difference]: With dead ends: 189 [2019-09-20 13:27:54,515 INFO L226 Difference]: Without dead ends: 189 [2019-09-20 13:27:54,516 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:54,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-20 13:27:54,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 174. [2019-09-20 13:27:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-20 13:27:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 260 transitions. [2019-09-20 13:27:54,523 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 260 transitions. Word has length 61 [2019-09-20 13:27:54,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:54,524 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 260 transitions. [2019-09-20 13:27:54,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 260 transitions. [2019-09-20 13:27:54,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-20 13:27:54,525 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:54,525 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:54,526 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:54,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:54,526 INFO L82 PathProgramCache]: Analyzing trace with hash 343958410, now seen corresponding path program 1 times [2019-09-20 13:27:54,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:54,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:54,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:54,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:54,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:54,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:54,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:54,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:54,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:54,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:54,635 INFO L87 Difference]: Start difference. First operand 174 states and 260 transitions. Second operand 4 states. [2019-09-20 13:27:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:54,914 INFO L93 Difference]: Finished difference Result 187 states and 275 transitions. [2019-09-20 13:27:54,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:54,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-09-20 13:27:54,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:54,916 INFO L225 Difference]: With dead ends: 187 [2019-09-20 13:27:54,916 INFO L226 Difference]: Without dead ends: 187 [2019-09-20 13:27:54,917 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:54,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-20 13:27:54,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 174. [2019-09-20 13:27:54,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-20 13:27:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 259 transitions. [2019-09-20 13:27:54,930 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 259 transitions. Word has length 61 [2019-09-20 13:27:54,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:54,930 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 259 transitions. [2019-09-20 13:27:54,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:54,931 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 259 transitions. [2019-09-20 13:27:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:27:54,932 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:54,932 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:54,932 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:54,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:54,933 INFO L82 PathProgramCache]: Analyzing trace with hash 607243108, now seen corresponding path program 1 times [2019-09-20 13:27:54,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:54,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:54,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:54,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:54,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:54,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:54,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:54,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:54,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:54,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:54,992 INFO L87 Difference]: Start difference. First operand 174 states and 259 transitions. Second operand 4 states. [2019-09-20 13:27:55,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:55,281 INFO L93 Difference]: Finished difference Result 187 states and 274 transitions. [2019-09-20 13:27:55,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:55,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-20 13:27:55,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:55,284 INFO L225 Difference]: With dead ends: 187 [2019-09-20 13:27:55,284 INFO L226 Difference]: Without dead ends: 187 [2019-09-20 13:27:55,284 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:55,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-20 13:27:55,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 174. [2019-09-20 13:27:55,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-20 13:27:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 258 transitions. [2019-09-20 13:27:55,290 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 258 transitions. Word has length 62 [2019-09-20 13:27:55,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:55,291 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 258 transitions. [2019-09-20 13:27:55,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:55,291 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 258 transitions. [2019-09-20 13:27:55,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:55,292 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:55,293 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:55,293 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:55,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:55,293 INFO L82 PathProgramCache]: Analyzing trace with hash -116413625, now seen corresponding path program 1 times [2019-09-20 13:27:55,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:55,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:55,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:55,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:55,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:55,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:55,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:55,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:55,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:55,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:55,358 INFO L87 Difference]: Start difference. First operand 174 states and 258 transitions. Second operand 4 states. [2019-09-20 13:27:55,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:55,640 INFO L93 Difference]: Finished difference Result 187 states and 273 transitions. [2019-09-20 13:27:55,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:55,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:27:55,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:55,642 INFO L225 Difference]: With dead ends: 187 [2019-09-20 13:27:55,642 INFO L226 Difference]: Without dead ends: 187 [2019-09-20 13:27:55,643 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:55,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-20 13:27:55,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 174. [2019-09-20 13:27:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-20 13:27:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 257 transitions. [2019-09-20 13:27:55,649 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 257 transitions. Word has length 63 [2019-09-20 13:27:55,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:55,649 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 257 transitions. [2019-09-20 13:27:55,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:55,649 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 257 transitions. [2019-09-20 13:27:55,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:55,650 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:55,650 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:55,651 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:55,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:55,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1598262239, now seen corresponding path program 1 times [2019-09-20 13:27:55,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:55,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:55,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:55,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:55,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:55,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:55,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:55,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:55,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:55,730 INFO L87 Difference]: Start difference. First operand 174 states and 257 transitions. Second operand 4 states. [2019-09-20 13:27:55,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:55,992 INFO L93 Difference]: Finished difference Result 187 states and 272 transitions. [2019-09-20 13:27:55,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:55,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:55,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:55,994 INFO L225 Difference]: With dead ends: 187 [2019-09-20 13:27:55,994 INFO L226 Difference]: Without dead ends: 187 [2019-09-20 13:27:55,995 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:55,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-20 13:27:56,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 174. [2019-09-20 13:27:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-20 13:27:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 256 transitions. [2019-09-20 13:27:56,001 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 256 transitions. Word has length 64 [2019-09-20 13:27:56,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:56,002 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 256 transitions. [2019-09-20 13:27:56,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:56,002 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 256 transitions. [2019-09-20 13:27:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:56,003 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:56,003 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:56,003 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:56,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:56,004 INFO L82 PathProgramCache]: Analyzing trace with hash -238834178, now seen corresponding path program 1 times [2019-09-20 13:27:56,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:56,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:56,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:56,057 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:56,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:56,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:56,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:56,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:56,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:56,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:56,059 INFO L87 Difference]: Start difference. First operand 174 states and 256 transitions. Second operand 4 states. [2019-09-20 13:27:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:56,416 INFO L93 Difference]: Finished difference Result 216 states and 318 transitions. [2019-09-20 13:27:56,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:56,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:56,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:56,419 INFO L225 Difference]: With dead ends: 216 [2019-09-20 13:27:56,419 INFO L226 Difference]: Without dead ends: 216 [2019-09-20 13:27:56,420 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:56,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-20 13:27:56,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 196. [2019-09-20 13:27:56,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-20 13:27:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 293 transitions. [2019-09-20 13:27:56,428 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 293 transitions. Word has length 64 [2019-09-20 13:27:56,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:56,428 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 293 transitions. [2019-09-20 13:27:56,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:56,429 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 293 transitions. [2019-09-20 13:27:56,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:56,430 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:56,430 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:56,430 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:56,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:56,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1591837282, now seen corresponding path program 1 times [2019-09-20 13:27:56,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:56,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:56,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:56,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:56,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:56,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:56,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:56,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:56,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:56,494 INFO L87 Difference]: Start difference. First operand 196 states and 293 transitions. Second operand 4 states. [2019-09-20 13:27:56,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:56,750 INFO L93 Difference]: Finished difference Result 199 states and 296 transitions. [2019-09-20 13:27:56,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:56,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:56,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:56,754 INFO L225 Difference]: With dead ends: 199 [2019-09-20 13:27:56,754 INFO L226 Difference]: Without dead ends: 199 [2019-09-20 13:27:56,754 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:56,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-20 13:27:56,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2019-09-20 13:27:56,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-20 13:27:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 292 transitions. [2019-09-20 13:27:56,761 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 292 transitions. Word has length 65 [2019-09-20 13:27:56,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:56,761 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 292 transitions. [2019-09-20 13:27:56,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 292 transitions. [2019-09-20 13:27:56,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:27:56,762 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:56,762 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:56,763 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:56,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:56,763 INFO L82 PathProgramCache]: Analyzing trace with hash -684502530, now seen corresponding path program 1 times [2019-09-20 13:27:56,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:56,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:56,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:56,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:56,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:56,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:56,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:56,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:56,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:56,829 INFO L87 Difference]: Start difference. First operand 196 states and 292 transitions. Second operand 4 states. [2019-09-20 13:27:57,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:57,149 INFO L93 Difference]: Finished difference Result 216 states and 316 transitions. [2019-09-20 13:27:57,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:57,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:27:57,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:57,152 INFO L225 Difference]: With dead ends: 216 [2019-09-20 13:27:57,153 INFO L226 Difference]: Without dead ends: 216 [2019-09-20 13:27:57,153 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:57,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-20 13:27:57,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 196. [2019-09-20 13:27:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-20 13:27:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 291 transitions. [2019-09-20 13:27:57,161 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 291 transitions. Word has length 77 [2019-09-20 13:27:57,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:57,161 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 291 transitions. [2019-09-20 13:27:57,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 291 transitions. [2019-09-20 13:27:57,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:57,163 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:57,164 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:57,164 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:57,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:57,165 INFO L82 PathProgramCache]: Analyzing trace with hash 370995988, now seen corresponding path program 1 times [2019-09-20 13:27:57,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:57,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:57,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:57,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:57,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:57,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:57,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:57,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:57,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:57,267 INFO L87 Difference]: Start difference. First operand 196 states and 291 transitions. Second operand 4 states. [2019-09-20 13:27:57,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:57,579 INFO L93 Difference]: Finished difference Result 215 states and 314 transitions. [2019-09-20 13:27:57,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:57,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:57,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:57,582 INFO L225 Difference]: With dead ends: 215 [2019-09-20 13:27:57,582 INFO L226 Difference]: Without dead ends: 215 [2019-09-20 13:27:57,582 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:57,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-20 13:27:57,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 196. [2019-09-20 13:27:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-20 13:27:57,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 290 transitions. [2019-09-20 13:27:57,589 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 290 transitions. Word has length 78 [2019-09-20 13:27:57,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:57,591 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 290 transitions. [2019-09-20 13:27:57,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:57,591 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 290 transitions. [2019-09-20 13:27:57,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:57,592 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:57,593 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:57,593 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:57,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:57,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2029024403, now seen corresponding path program 1 times [2019-09-20 13:27:57,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:57,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:57,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:57,669 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:57,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:57,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:57,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:57,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:57,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:57,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:57,671 INFO L87 Difference]: Start difference. First operand 196 states and 290 transitions. Second operand 4 states. [2019-09-20 13:27:57,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:57,971 INFO L93 Difference]: Finished difference Result 213 states and 311 transitions. [2019-09-20 13:27:57,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:57,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:57,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:57,974 INFO L225 Difference]: With dead ends: 213 [2019-09-20 13:27:57,974 INFO L226 Difference]: Without dead ends: 213 [2019-09-20 13:27:57,974 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:57,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-20 13:27:57,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2019-09-20 13:27:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-20 13:27:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 289 transitions. [2019-09-20 13:27:57,982 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 289 transitions. Word has length 78 [2019-09-20 13:27:57,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:57,982 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 289 transitions. [2019-09-20 13:27:57,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 289 transitions. [2019-09-20 13:27:57,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:57,984 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:57,984 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:57,984 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:57,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:57,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1304681339, now seen corresponding path program 1 times [2019-09-20 13:27:57,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:57,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:57,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:58,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:58,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:58,071 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:58,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:58,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:58,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:58,072 INFO L87 Difference]: Start difference. First operand 196 states and 289 transitions. Second operand 4 states. [2019-09-20 13:27:58,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:58,395 INFO L93 Difference]: Finished difference Result 213 states and 310 transitions. [2019-09-20 13:27:58,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:58,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:58,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:58,397 INFO L225 Difference]: With dead ends: 213 [2019-09-20 13:27:58,397 INFO L226 Difference]: Without dead ends: 213 [2019-09-20 13:27:58,398 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:58,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-20 13:27:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2019-09-20 13:27:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-20 13:27:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 288 transitions. [2019-09-20 13:27:58,406 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 288 transitions. Word has length 79 [2019-09-20 13:27:58,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:58,406 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 288 transitions. [2019-09-20 13:27:58,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:58,407 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 288 transitions. [2019-09-20 13:27:58,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:58,408 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:58,408 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:58,408 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:58,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:58,409 INFO L82 PathProgramCache]: Analyzing trace with hash 29335056, now seen corresponding path program 1 times [2019-09-20 13:27:58,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:58,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:58,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:58,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:58,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:58,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:58,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:58,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:58,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:58,476 INFO L87 Difference]: Start difference. First operand 196 states and 288 transitions. Second operand 4 states. [2019-09-20 13:27:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:58,774 INFO L93 Difference]: Finished difference Result 213 states and 309 transitions. [2019-09-20 13:27:58,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:58,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:58,776 INFO L225 Difference]: With dead ends: 213 [2019-09-20 13:27:58,776 INFO L226 Difference]: Without dead ends: 213 [2019-09-20 13:27:58,777 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-20 13:27:58,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2019-09-20 13:27:58,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-20 13:27:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 287 transitions. [2019-09-20 13:27:58,783 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 287 transitions. Word has length 80 [2019-09-20 13:27:58,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:58,783 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 287 transitions. [2019-09-20 13:27:58,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:58,784 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 287 transitions. [2019-09-20 13:27:58,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:58,785 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:58,785 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:58,785 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:58,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:58,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1821504054, now seen corresponding path program 1 times [2019-09-20 13:27:58,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:58,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:58,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:58,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:58,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:58,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:58,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:58,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:58,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:58,848 INFO L87 Difference]: Start difference. First operand 196 states and 287 transitions. Second operand 4 states. [2019-09-20 13:27:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:59,176 INFO L93 Difference]: Finished difference Result 213 states and 308 transitions. [2019-09-20 13:27:59,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:59,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:59,178 INFO L225 Difference]: With dead ends: 213 [2019-09-20 13:27:59,178 INFO L226 Difference]: Without dead ends: 213 [2019-09-20 13:27:59,179 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:59,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-20 13:27:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2019-09-20 13:27:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-20 13:27:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 286 transitions. [2019-09-20 13:27:59,186 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 286 transitions. Word has length 81 [2019-09-20 13:27:59,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:59,187 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 286 transitions. [2019-09-20 13:27:59,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 286 transitions. [2019-09-20 13:27:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:27:59,188 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:59,189 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:59,189 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:59,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:59,189 INFO L82 PathProgramCache]: Analyzing trace with hash -77601045, now seen corresponding path program 1 times [2019-09-20 13:27:59,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:59,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:59,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:59,260 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:59,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:59,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:59,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:59,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:59,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:59,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:59,262 INFO L87 Difference]: Start difference. First operand 196 states and 286 transitions. Second operand 4 states. [2019-09-20 13:27:59,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:59,590 INFO L93 Difference]: Finished difference Result 203 states and 295 transitions. [2019-09-20 13:27:59,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:59,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:27:59,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:59,594 INFO L225 Difference]: With dead ends: 203 [2019-09-20 13:27:59,594 INFO L226 Difference]: Without dead ends: 203 [2019-09-20 13:27:59,594 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:59,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-20 13:27:59,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 196. [2019-09-20 13:27:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-20 13:27:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 285 transitions. [2019-09-20 13:27:59,603 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 285 transitions. Word has length 82 [2019-09-20 13:27:59,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:59,603 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 285 transitions. [2019-09-20 13:27:59,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 285 transitions. [2019-09-20 13:27:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-20 13:27:59,605 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:59,606 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:59,606 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:59,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:59,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1100659645, now seen corresponding path program 1 times [2019-09-20 13:27:59,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:59,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:59,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:59,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:59,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:59,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:59,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:59,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:59,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:59,752 INFO L87 Difference]: Start difference. First operand 196 states and 285 transitions. Second operand 4 states. [2019-09-20 13:28:00,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:00,376 INFO L93 Difference]: Finished difference Result 304 states and 450 transitions. [2019-09-20 13:28:00,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:00,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-20 13:28:00,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:00,380 INFO L225 Difference]: With dead ends: 304 [2019-09-20 13:28:00,381 INFO L226 Difference]: Without dead ends: 304 [2019-09-20 13:28:00,381 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-20 13:28:00,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 237. [2019-09-20 13:28:00,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-09-20 13:28:00,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 358 transitions. [2019-09-20 13:28:00,393 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 358 transitions. Word has length 86 [2019-09-20 13:28:00,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:00,394 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 358 transitions. [2019-09-20 13:28:00,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:00,394 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 358 transitions. [2019-09-20 13:28:00,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-20 13:28:00,396 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:00,396 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:00,397 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:00,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:00,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1348940485, now seen corresponding path program 1 times [2019-09-20 13:28:00,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:00,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:00,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:00,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:00,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:00,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:00,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:00,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:00,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:00,495 INFO L87 Difference]: Start difference. First operand 237 states and 358 transitions. Second operand 4 states. [2019-09-20 13:28:00,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:00,924 INFO L93 Difference]: Finished difference Result 286 states and 431 transitions. [2019-09-20 13:28:00,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:00,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-20 13:28:00,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:00,927 INFO L225 Difference]: With dead ends: 286 [2019-09-20 13:28:00,927 INFO L226 Difference]: Without dead ends: 286 [2019-09-20 13:28:00,927 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:00,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-20 13:28:00,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 261. [2019-09-20 13:28:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-20 13:28:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 399 transitions. [2019-09-20 13:28:00,935 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 399 transitions. Word has length 86 [2019-09-20 13:28:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:00,935 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 399 transitions. [2019-09-20 13:28:00,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 399 transitions. [2019-09-20 13:28:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-20 13:28:00,937 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:00,937 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:00,937 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:00,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:00,938 INFO L82 PathProgramCache]: Analyzing trace with hash 231535711, now seen corresponding path program 1 times [2019-09-20 13:28:00,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:00,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:00,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:01,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:01,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:01,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:01,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:01,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:01,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:01,028 INFO L87 Difference]: Start difference. First operand 261 states and 399 transitions. Second operand 4 states. [2019-09-20 13:28:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:01,562 INFO L93 Difference]: Finished difference Result 322 states and 483 transitions. [2019-09-20 13:28:01,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:01,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-20 13:28:01,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:01,565 INFO L225 Difference]: With dead ends: 322 [2019-09-20 13:28:01,565 INFO L226 Difference]: Without dead ends: 322 [2019-09-20 13:28:01,566 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:01,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-20 13:28:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 262. [2019-09-20 13:28:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-20 13:28:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 400 transitions. [2019-09-20 13:28:01,574 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 400 transitions. Word has length 87 [2019-09-20 13:28:01,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:01,575 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 400 transitions. [2019-09-20 13:28:01,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 400 transitions. [2019-09-20 13:28:01,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-20 13:28:01,577 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:01,577 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:01,577 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:01,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:01,577 INFO L82 PathProgramCache]: Analyzing trace with hash 756863961, now seen corresponding path program 1 times [2019-09-20 13:28:01,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:01,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:01,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:01,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:01,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:01,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:01,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:01,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:01,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:01,677 INFO L87 Difference]: Start difference. First operand 262 states and 400 transitions. Second operand 4 states. [2019-09-20 13:28:02,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:02,219 INFO L93 Difference]: Finished difference Result 322 states and 482 transitions. [2019-09-20 13:28:02,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:02,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-09-20 13:28:02,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:02,222 INFO L225 Difference]: With dead ends: 322 [2019-09-20 13:28:02,222 INFO L226 Difference]: Without dead ends: 322 [2019-09-20 13:28:02,223 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:02,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-20 13:28:02,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 262. [2019-09-20 13:28:02,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-20 13:28:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 399 transitions. [2019-09-20 13:28:02,235 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 399 transitions. Word has length 99 [2019-09-20 13:28:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:02,236 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 399 transitions. [2019-09-20 13:28:02,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 399 transitions. [2019-09-20 13:28:02,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-20 13:28:02,239 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:02,239 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:02,240 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:02,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:02,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1999763305, now seen corresponding path program 1 times [2019-09-20 13:28:02,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:02,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:02,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:02,324 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:02,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:02,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:02,325 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:02,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:02,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:02,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:02,327 INFO L87 Difference]: Start difference. First operand 262 states and 399 transitions. Second operand 4 states. [2019-09-20 13:28:02,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:02,759 INFO L93 Difference]: Finished difference Result 287 states and 430 transitions. [2019-09-20 13:28:02,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:02,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-09-20 13:28:02,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:02,762 INFO L225 Difference]: With dead ends: 287 [2019-09-20 13:28:02,762 INFO L226 Difference]: Without dead ends: 287 [2019-09-20 13:28:02,763 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:02,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-20 13:28:02,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 262. [2019-09-20 13:28:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-20 13:28:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 398 transitions. [2019-09-20 13:28:02,771 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 398 transitions. Word has length 99 [2019-09-20 13:28:02,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:02,771 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 398 transitions. [2019-09-20 13:28:02,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 398 transitions. [2019-09-20 13:28:02,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-20 13:28:02,773 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:02,773 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:02,773 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:02,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:02,774 INFO L82 PathProgramCache]: Analyzing trace with hash 2103684249, now seen corresponding path program 1 times [2019-09-20 13:28:02,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:02,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:02,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:02,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:02,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:02,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:02,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:02,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:02,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:02,842 INFO L87 Difference]: Start difference. First operand 262 states and 398 transitions. Second operand 4 states. [2019-09-20 13:28:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:03,312 INFO L93 Difference]: Finished difference Result 321 states and 479 transitions. [2019-09-20 13:28:03,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:03,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-20 13:28:03,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:03,316 INFO L225 Difference]: With dead ends: 321 [2019-09-20 13:28:03,316 INFO L226 Difference]: Without dead ends: 321 [2019-09-20 13:28:03,317 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:03,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-20 13:28:03,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 262. [2019-09-20 13:28:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-20 13:28:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 397 transitions. [2019-09-20 13:28:03,326 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 397 transitions. Word has length 100 [2019-09-20 13:28:03,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:03,327 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 397 transitions. [2019-09-20 13:28:03,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 397 transitions. [2019-09-20 13:28:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-20 13:28:03,328 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:03,329 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:03,329 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:03,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:03,329 INFO L82 PathProgramCache]: Analyzing trace with hash -533254632, now seen corresponding path program 1 times [2019-09-20 13:28:03,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:03,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:03,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:03,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:03,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:03,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:03,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:03,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:03,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:03,396 INFO L87 Difference]: Start difference. First operand 262 states and 397 transitions. Second operand 4 states. [2019-09-20 13:28:03,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:03,918 INFO L93 Difference]: Finished difference Result 319 states and 476 transitions. [2019-09-20 13:28:03,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:03,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-20 13:28:03,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:03,922 INFO L225 Difference]: With dead ends: 319 [2019-09-20 13:28:03,922 INFO L226 Difference]: Without dead ends: 319 [2019-09-20 13:28:03,923 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:03,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-20 13:28:03,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 262. [2019-09-20 13:28:03,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-20 13:28:03,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 396 transitions. [2019-09-20 13:28:03,931 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 396 transitions. Word has length 100 [2019-09-20 13:28:03,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:03,931 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 396 transitions. [2019-09-20 13:28:03,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:03,931 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 396 transitions. [2019-09-20 13:28:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-20 13:28:03,933 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:03,933 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:03,934 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:03,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:03,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1747382373, now seen corresponding path program 1 times [2019-09-20 13:28:03,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:03,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:03,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:04,025 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:04,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:04,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:04,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:04,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:04,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:04,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:04,027 INFO L87 Difference]: Start difference. First operand 262 states and 396 transitions. Second operand 4 states. [2019-09-20 13:28:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:04,341 INFO L93 Difference]: Finished difference Result 286 states and 426 transitions. [2019-09-20 13:28:04,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:04,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-20 13:28:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:04,344 INFO L225 Difference]: With dead ends: 286 [2019-09-20 13:28:04,344 INFO L226 Difference]: Without dead ends: 286 [2019-09-20 13:28:04,345 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:04,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-20 13:28:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 262. [2019-09-20 13:28:04,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-20 13:28:04,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 395 transitions. [2019-09-20 13:28:04,351 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 395 transitions. Word has length 100 [2019-09-20 13:28:04,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:04,352 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 395 transitions. [2019-09-20 13:28:04,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 395 transitions. [2019-09-20 13:28:04,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-20 13:28:04,353 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:04,354 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:04,354 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:04,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:04,354 INFO L82 PathProgramCache]: Analyzing trace with hash -89353958, now seen corresponding path program 1 times [2019-09-20 13:28:04,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:04,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:04,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:04,437 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:04,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:04,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:04,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:04,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:04,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:04,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:04,439 INFO L87 Difference]: Start difference. First operand 262 states and 395 transitions. Second operand 4 states. [2019-09-20 13:28:04,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:04,772 INFO L93 Difference]: Finished difference Result 284 states and 423 transitions. [2019-09-20 13:28:04,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:04,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-20 13:28:04,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:04,774 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:28:04,774 INFO L226 Difference]: Without dead ends: 284 [2019-09-20 13:28:04,775 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:04,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-20 13:28:04,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 262. [2019-09-20 13:28:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-20 13:28:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 394 transitions. [2019-09-20 13:28:04,782 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 394 transitions. Word has length 100 [2019-09-20 13:28:04,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:04,782 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 394 transitions. [2019-09-20 13:28:04,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 394 transitions. [2019-09-20 13:28:04,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:28:04,784 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:04,784 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:04,784 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:04,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:04,785 INFO L82 PathProgramCache]: Analyzing trace with hash -816557418, now seen corresponding path program 1 times [2019-09-20 13:28:04,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:04,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:04,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:04,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:04,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:04,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:04,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:04,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:04,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:04,843 INFO L87 Difference]: Start difference. First operand 262 states and 394 transitions. Second operand 4 states. [2019-09-20 13:28:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:05,283 INFO L93 Difference]: Finished difference Result 319 states and 473 transitions. [2019-09-20 13:28:05,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:05,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:28:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:05,286 INFO L225 Difference]: With dead ends: 319 [2019-09-20 13:28:05,286 INFO L226 Difference]: Without dead ends: 319 [2019-09-20 13:28:05,287 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:05,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-20 13:28:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 262. [2019-09-20 13:28:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-20 13:28:05,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 393 transitions. [2019-09-20 13:28:05,294 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 393 transitions. Word has length 101 [2019-09-20 13:28:05,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:05,294 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 393 transitions. [2019-09-20 13:28:05,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:05,294 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 393 transitions. [2019-09-20 13:28:05,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:28:05,296 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:05,296 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:05,296 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:05,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:05,297 INFO L82 PathProgramCache]: Analyzing trace with hash 59461588, now seen corresponding path program 1 times [2019-09-20 13:28:05,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:05,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:05,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:05,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:05,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:05,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:05,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:05,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:05,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:05,353 INFO L87 Difference]: Start difference. First operand 262 states and 393 transitions. Second operand 4 states. [2019-09-20 13:28:05,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:05,655 INFO L93 Difference]: Finished difference Result 284 states and 421 transitions. [2019-09-20 13:28:05,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:05,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:28:05,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:05,658 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:28:05,658 INFO L226 Difference]: Without dead ends: 284 [2019-09-20 13:28:05,659 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:05,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-20 13:28:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 262. [2019-09-20 13:28:05,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-20 13:28:05,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 392 transitions. [2019-09-20 13:28:05,666 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 392 transitions. Word has length 101 [2019-09-20 13:28:05,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:05,666 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 392 transitions. [2019-09-20 13:28:05,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:05,667 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 392 transitions. [2019-09-20 13:28:05,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:05,668 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:05,668 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:05,669 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:05,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:05,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1304556971, now seen corresponding path program 1 times [2019-09-20 13:28:05,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:05,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:05,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:05,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:05,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:05,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:05,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:05,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:05,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:05,744 INFO L87 Difference]: Start difference. First operand 262 states and 392 transitions. Second operand 4 states. [2019-09-20 13:28:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:06,197 INFO L93 Difference]: Finished difference Result 319 states and 471 transitions. [2019-09-20 13:28:06,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:06,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:06,200 INFO L225 Difference]: With dead ends: 319 [2019-09-20 13:28:06,200 INFO L226 Difference]: Without dead ends: 319 [2019-09-20 13:28:06,200 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-20 13:28:06,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 262. [2019-09-20 13:28:06,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-20 13:28:06,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 391 transitions. [2019-09-20 13:28:06,207 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 391 transitions. Word has length 102 [2019-09-20 13:28:06,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:06,208 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 391 transitions. [2019-09-20 13:28:06,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:06,208 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 391 transitions. [2019-09-20 13:28:06,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:06,209 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:06,210 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:06,210 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:06,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:06,210 INFO L82 PathProgramCache]: Analyzing trace with hash 82228439, now seen corresponding path program 1 times [2019-09-20 13:28:06,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:06,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:06,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:06,272 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:06,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:06,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:06,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:06,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:06,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:06,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:06,274 INFO L87 Difference]: Start difference. First operand 262 states and 391 transitions. Second operand 4 states. [2019-09-20 13:28:06,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:06,561 INFO L93 Difference]: Finished difference Result 284 states and 419 transitions. [2019-09-20 13:28:06,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:06,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:06,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:06,563 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:28:06,563 INFO L226 Difference]: Without dead ends: 284 [2019-09-20 13:28:06,564 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:06,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-20 13:28:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 262. [2019-09-20 13:28:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-20 13:28:06,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 390 transitions. [2019-09-20 13:28:06,572 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 390 transitions. Word has length 102 [2019-09-20 13:28:06,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:06,572 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 390 transitions. [2019-09-20 13:28:06,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:06,573 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 390 transitions. [2019-09-20 13:28:06,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:06,575 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:06,576 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:06,576 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:06,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:06,576 INFO L82 PathProgramCache]: Analyzing trace with hash -874443119, now seen corresponding path program 1 times [2019-09-20 13:28:06,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:06,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:06,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:06,658 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:06,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:06,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:06,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:06,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:06,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:06,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:06,660 INFO L87 Difference]: Start difference. First operand 262 states and 390 transitions. Second operand 4 states. [2019-09-20 13:28:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,060 INFO L93 Difference]: Finished difference Result 319 states and 469 transitions. [2019-09-20 13:28:07,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,063 INFO L225 Difference]: With dead ends: 319 [2019-09-20 13:28:07,063 INFO L226 Difference]: Without dead ends: 319 [2019-09-20 13:28:07,063 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:07,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-20 13:28:07,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 262. [2019-09-20 13:28:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-20 13:28:07,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 389 transitions. [2019-09-20 13:28:07,070 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 389 transitions. Word has length 103 [2019-09-20 13:28:07,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,070 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 389 transitions. [2019-09-20 13:28:07,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,070 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 389 transitions. [2019-09-20 13:28:07,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:07,072 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,072 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:07,072 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,073 INFO L82 PathProgramCache]: Analyzing trace with hash -833768369, now seen corresponding path program 1 times [2019-09-20 13:28:07,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,138 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:07,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,140 INFO L87 Difference]: Start difference. First operand 262 states and 389 transitions. Second operand 4 states. [2019-09-20 13:28:07,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,423 INFO L93 Difference]: Finished difference Result 284 states and 417 transitions. [2019-09-20 13:28:07,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:07,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,426 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:28:07,426 INFO L226 Difference]: Without dead ends: 284 [2019-09-20 13:28:07,427 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:07,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-20 13:28:07,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 262. [2019-09-20 13:28:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-20 13:28:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 388 transitions. [2019-09-20 13:28:07,434 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 388 transitions. Word has length 103 [2019-09-20 13:28:07,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,434 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 388 transitions. [2019-09-20 13:28:07,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,434 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 388 transitions. [2019-09-20 13:28:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:28:07,435 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,435 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:07,436 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,436 INFO L82 PathProgramCache]: Analyzing trace with hash -2047584784, now seen corresponding path program 1 times [2019-09-20 13:28:07,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,510 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:07,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,512 INFO L87 Difference]: Start difference. First operand 262 states and 388 transitions. Second operand 4 states. [2019-09-20 13:28:07,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,904 INFO L93 Difference]: Finished difference Result 309 states and 455 transitions. [2019-09-20 13:28:07,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:28:07,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,907 INFO L225 Difference]: With dead ends: 309 [2019-09-20 13:28:07,907 INFO L226 Difference]: Without dead ends: 309 [2019-09-20 13:28:07,907 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:07,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-20 13:28:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 262. [2019-09-20 13:28:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-20 13:28:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 387 transitions. [2019-09-20 13:28:07,913 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 387 transitions. Word has length 104 [2019-09-20 13:28:07,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,914 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 387 transitions. [2019-09-20 13:28:07,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 387 transitions. [2019-09-20 13:28:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:28:07,915 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,915 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:07,915 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,916 INFO L82 PathProgramCache]: Analyzing trace with hash -786667534, now seen corresponding path program 1 times [2019-09-20 13:28:07,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:07,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,981 INFO L87 Difference]: Start difference. First operand 262 states and 387 transitions. Second operand 4 states. [2019-09-20 13:28:08,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,287 INFO L93 Difference]: Finished difference Result 274 states and 403 transitions. [2019-09-20 13:28:08,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:28:08,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,290 INFO L225 Difference]: With dead ends: 274 [2019-09-20 13:28:08,290 INFO L226 Difference]: Without dead ends: 274 [2019-09-20 13:28:08,291 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:08,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-20 13:28:08,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 262. [2019-09-20 13:28:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-20 13:28:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 386 transitions. [2019-09-20 13:28:08,297 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 386 transitions. Word has length 104 [2019-09-20 13:28:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,297 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 386 transitions. [2019-09-20 13:28:08,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 386 transitions. [2019-09-20 13:28:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:28:08,298 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,299 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:08,299 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1168872726, now seen corresponding path program 1 times [2019-09-20 13:28:08,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:08,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,374 INFO L87 Difference]: Start difference. First operand 262 states and 386 transitions. Second operand 4 states. [2019-09-20 13:28:08,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,735 INFO L93 Difference]: Finished difference Result 309 states and 453 transitions. [2019-09-20 13:28:08,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-20 13:28:08,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,739 INFO L225 Difference]: With dead ends: 309 [2019-09-20 13:28:08,739 INFO L226 Difference]: Without dead ends: 309 [2019-09-20 13:28:08,739 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:08,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-20 13:28:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 262. [2019-09-20 13:28:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-20 13:28:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 385 transitions. [2019-09-20 13:28:08,745 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 385 transitions. Word has length 108 [2019-09-20 13:28:08,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,745 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 385 transitions. [2019-09-20 13:28:08,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 385 transitions. [2019-09-20 13:28:08,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:28:08,747 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,747 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:08,747 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1164519912, now seen corresponding path program 1 times [2019-09-20 13:28:08,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:08,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,829 INFO L87 Difference]: Start difference. First operand 262 states and 385 transitions. Second operand 4 states. [2019-09-20 13:28:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,153 INFO L93 Difference]: Finished difference Result 315 states and 465 transitions. [2019-09-20 13:28:09,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-20 13:28:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,157 INFO L225 Difference]: With dead ends: 315 [2019-09-20 13:28:09,157 INFO L226 Difference]: Without dead ends: 315 [2019-09-20 13:28:09,157 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:09,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-20 13:28:09,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 288. [2019-09-20 13:28:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-20 13:28:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 430 transitions. [2019-09-20 13:28:09,163 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 430 transitions. Word has length 108 [2019-09-20 13:28:09,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,164 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 430 transitions. [2019-09-20 13:28:09,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,164 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 430 transitions. [2019-09-20 13:28:09,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-20 13:28:09,165 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,165 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:09,166 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,166 INFO L82 PathProgramCache]: Analyzing trace with hash 115035318, now seen corresponding path program 1 times [2019-09-20 13:28:09,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,242 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:09,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,243 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,244 INFO L87 Difference]: Start difference. First operand 288 states and 430 transitions. Second operand 4 states. [2019-09-20 13:28:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,613 INFO L93 Difference]: Finished difference Result 335 states and 497 transitions. [2019-09-20 13:28:09,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-20 13:28:09,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,615 INFO L225 Difference]: With dead ends: 335 [2019-09-20 13:28:09,615 INFO L226 Difference]: Without dead ends: 335 [2019-09-20 13:28:09,616 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:09,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-20 13:28:09,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 288. [2019-09-20 13:28:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-20 13:28:09,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 429 transitions. [2019-09-20 13:28:09,622 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 429 transitions. Word has length 111 [2019-09-20 13:28:09,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,622 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 429 transitions. [2019-09-20 13:28:09,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,622 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 429 transitions. [2019-09-20 13:28:09,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-20 13:28:09,623 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,624 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:09,624 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1633919819, now seen corresponding path program 1 times [2019-09-20 13:28:09,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,692 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:09,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,694 INFO L87 Difference]: Start difference. First operand 288 states and 429 transitions. Second operand 4 states. [2019-09-20 13:28:10,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,039 INFO L93 Difference]: Finished difference Result 327 states and 483 transitions. [2019-09-20 13:28:10,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-20 13:28:10,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,042 INFO L225 Difference]: With dead ends: 327 [2019-09-20 13:28:10,042 INFO L226 Difference]: Without dead ends: 327 [2019-09-20 13:28:10,042 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:10,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-20 13:28:10,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 288. [2019-09-20 13:28:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-20 13:28:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 428 transitions. [2019-09-20 13:28:10,049 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 428 transitions. Word has length 112 [2019-09-20 13:28:10,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,050 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 428 transitions. [2019-09-20 13:28:10,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 428 transitions. [2019-09-20 13:28:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-20 13:28:10,051 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,051 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:10,051 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,052 INFO L82 PathProgramCache]: Analyzing trace with hash 307453014, now seen corresponding path program 1 times [2019-09-20 13:28:10,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:10,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,134 INFO L87 Difference]: Start difference. First operand 288 states and 428 transitions. Second operand 4 states. [2019-09-20 13:28:10,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,531 INFO L93 Difference]: Finished difference Result 327 states and 482 transitions. [2019-09-20 13:28:10,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-20 13:28:10,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,534 INFO L225 Difference]: With dead ends: 327 [2019-09-20 13:28:10,534 INFO L226 Difference]: Without dead ends: 327 [2019-09-20 13:28:10,535 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-20 13:28:10,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 288. [2019-09-20 13:28:10,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-20 13:28:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 427 transitions. [2019-09-20 13:28:10,542 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 427 transitions. Word has length 113 [2019-09-20 13:28:10,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,542 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 427 transitions. [2019-09-20 13:28:10,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 427 transitions. [2019-09-20 13:28:10,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-20 13:28:10,544 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,544 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:10,544 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,545 INFO L82 PathProgramCache]: Analyzing trace with hash 501731051, now seen corresponding path program 1 times [2019-09-20 13:28:10,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:10,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,617 INFO L87 Difference]: Start difference. First operand 288 states and 427 transitions. Second operand 4 states. [2019-09-20 13:28:10,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,972 INFO L93 Difference]: Finished difference Result 327 states and 481 transitions. [2019-09-20 13:28:10,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-20 13:28:10,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,976 INFO L225 Difference]: With dead ends: 327 [2019-09-20 13:28:10,976 INFO L226 Difference]: Without dead ends: 327 [2019-09-20 13:28:10,977 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:10,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-20 13:28:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 288. [2019-09-20 13:28:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-20 13:28:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 426 transitions. [2019-09-20 13:28:10,983 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 426 transitions. Word has length 114 [2019-09-20 13:28:10,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,983 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 426 transitions. [2019-09-20 13:28:10,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,983 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 426 transitions. [2019-09-20 13:28:10,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-20 13:28:10,984 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,985 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:10,985 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,985 INFO L82 PathProgramCache]: Analyzing trace with hash 818344949, now seen corresponding path program 1 times [2019-09-20 13:28:10,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:11,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,069 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,070 INFO L87 Difference]: Start difference. First operand 288 states and 426 transitions. Second operand 4 states. [2019-09-20 13:28:11,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,445 INFO L93 Difference]: Finished difference Result 325 states and 478 transitions. [2019-09-20 13:28:11,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-20 13:28:11,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,449 INFO L225 Difference]: With dead ends: 325 [2019-09-20 13:28:11,449 INFO L226 Difference]: Without dead ends: 325 [2019-09-20 13:28:11,450 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:11,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-20 13:28:11,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 288. [2019-09-20 13:28:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-20 13:28:11,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 425 transitions. [2019-09-20 13:28:11,456 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 425 transitions. Word has length 114 [2019-09-20 13:28:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,456 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 425 transitions. [2019-09-20 13:28:11,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 425 transitions. [2019-09-20 13:28:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-20 13:28:11,458 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,458 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:11,458 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1595469332, now seen corresponding path program 1 times [2019-09-20 13:28:11,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:11,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,535 INFO L87 Difference]: Start difference. First operand 288 states and 425 transitions. Second operand 4 states. [2019-09-20 13:28:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,845 INFO L93 Difference]: Finished difference Result 323 states and 474 transitions. [2019-09-20 13:28:11,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-20 13:28:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,849 INFO L225 Difference]: With dead ends: 323 [2019-09-20 13:28:11,849 INFO L226 Difference]: Without dead ends: 323 [2019-09-20 13:28:11,849 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:11,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-20 13:28:11,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 288. [2019-09-20 13:28:11,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-20 13:28:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 424 transitions. [2019-09-20 13:28:11,855 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 424 transitions. Word has length 115 [2019-09-20 13:28:11,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,856 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 424 transitions. [2019-09-20 13:28:11,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 424 transitions. [2019-09-20 13:28:11,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-20 13:28:11,857 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,857 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:11,857 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,858 INFO L82 PathProgramCache]: Analyzing trace with hash 362638516, now seen corresponding path program 1 times [2019-09-20 13:28:11,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:11,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,935 INFO L87 Difference]: Start difference. First operand 288 states and 424 transitions. Second operand 4 states. [2019-09-20 13:28:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:12,313 INFO L93 Difference]: Finished difference Result 320 states and 469 transitions. [2019-09-20 13:28:12,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:12,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-20 13:28:12,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:12,315 INFO L225 Difference]: With dead ends: 320 [2019-09-20 13:28:12,315 INFO L226 Difference]: Without dead ends: 320 [2019-09-20 13:28:12,315 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:12,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-20 13:28:12,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 288. [2019-09-20 13:28:12,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-20 13:28:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 423 transitions. [2019-09-20 13:28:12,321 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 423 transitions. Word has length 115 [2019-09-20 13:28:12,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:12,321 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 423 transitions. [2019-09-20 13:28:12,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:12,321 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 423 transitions. [2019-09-20 13:28:12,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-20 13:28:12,322 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:12,322 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:12,323 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:12,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:12,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1024473421, now seen corresponding path program 1 times [2019-09-20 13:28:12,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:12,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:12,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:12,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:12,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:12,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:12,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:12,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:12,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:12,407 INFO L87 Difference]: Start difference. First operand 288 states and 423 transitions. Second operand 4 states. [2019-09-20 13:28:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:12,806 INFO L93 Difference]: Finished difference Result 320 states and 468 transitions. [2019-09-20 13:28:12,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:12,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-09-20 13:28:12,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:12,809 INFO L225 Difference]: With dead ends: 320 [2019-09-20 13:28:12,809 INFO L226 Difference]: Without dead ends: 320 [2019-09-20 13:28:12,809 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-20 13:28:12,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 288. [2019-09-20 13:28:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-20 13:28:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 422 transitions. [2019-09-20 13:28:12,815 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 422 transitions. Word has length 118 [2019-09-20 13:28:12,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:12,816 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 422 transitions. [2019-09-20 13:28:12,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:12,816 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 422 transitions. [2019-09-20 13:28:12,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-20 13:28:12,817 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:12,817 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:12,817 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:12,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:12,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1467273033, now seen corresponding path program 1 times [2019-09-20 13:28:12,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:12,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:12,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:12,901 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:12,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:12,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:12,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:12,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:12,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:12,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:12,902 INFO L87 Difference]: Start difference. First operand 288 states and 422 transitions. Second operand 4 states. [2019-09-20 13:28:13,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,237 INFO L93 Difference]: Finished difference Result 314 states and 458 transitions. [2019-09-20 13:28:13,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:13,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-09-20 13:28:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,241 INFO L225 Difference]: With dead ends: 314 [2019-09-20 13:28:13,241 INFO L226 Difference]: Without dead ends: 314 [2019-09-20 13:28:13,241 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-20 13:28:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 288. [2019-09-20 13:28:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-20 13:28:13,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 421 transitions. [2019-09-20 13:28:13,249 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 421 transitions. Word has length 119 [2019-09-20 13:28:13,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,250 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 421 transitions. [2019-09-20 13:28:13,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:13,250 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 421 transitions. [2019-09-20 13:28:13,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-20 13:28:13,252 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,252 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:13,252 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1746493050, now seen corresponding path program 1 times [2019-09-20 13:28:13,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:13,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:13,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:13,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:13,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:13,359 INFO L87 Difference]: Start difference. First operand 288 states and 421 transitions. Second operand 4 states. [2019-09-20 13:28:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,682 INFO L93 Difference]: Finished difference Result 314 states and 457 transitions. [2019-09-20 13:28:13,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:13,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-09-20 13:28:13,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,685 INFO L225 Difference]: With dead ends: 314 [2019-09-20 13:28:13,685 INFO L226 Difference]: Without dead ends: 314 [2019-09-20 13:28:13,685 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-20 13:28:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 288. [2019-09-20 13:28:13,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-20 13:28:13,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 420 transitions. [2019-09-20 13:28:13,691 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 420 transitions. Word has length 119 [2019-09-20 13:28:13,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,691 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 420 transitions. [2019-09-20 13:28:13,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:13,691 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 420 transitions. [2019-09-20 13:28:13,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-20 13:28:13,692 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,693 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:13,693 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1372607574, now seen corresponding path program 1 times [2019-09-20 13:28:13,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,773 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:13,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:13,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:13,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:13,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:13,776 INFO L87 Difference]: Start difference. First operand 288 states and 420 transitions. Second operand 4 states. [2019-09-20 13:28:14,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,137 INFO L93 Difference]: Finished difference Result 311 states and 452 transitions. [2019-09-20 13:28:14,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:14,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-20 13:28:14,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,140 INFO L225 Difference]: With dead ends: 311 [2019-09-20 13:28:14,140 INFO L226 Difference]: Without dead ends: 311 [2019-09-20 13:28:14,141 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:14,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-20 13:28:14,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 288. [2019-09-20 13:28:14,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-20 13:28:14,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 419 transitions. [2019-09-20 13:28:14,146 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 419 transitions. Word has length 120 [2019-09-20 13:28:14,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,147 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 419 transitions. [2019-09-20 13:28:14,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:14,147 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 419 transitions. [2019-09-20 13:28:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-20 13:28:14,148 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,149 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:14,149 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1293124930, now seen corresponding path program 1 times [2019-09-20 13:28:14,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:14,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,232 INFO L87 Difference]: Start difference. First operand 288 states and 419 transitions. Second operand 4 states. [2019-09-20 13:28:14,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,555 INFO L93 Difference]: Finished difference Result 311 states and 451 transitions. [2019-09-20 13:28:14,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:14,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-20 13:28:14,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,556 INFO L225 Difference]: With dead ends: 311 [2019-09-20 13:28:14,556 INFO L226 Difference]: Without dead ends: 311 [2019-09-20 13:28:14,557 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:14,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-20 13:28:14,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 288. [2019-09-20 13:28:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-20 13:28:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 418 transitions. [2019-09-20 13:28:14,561 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 418 transitions. Word has length 121 [2019-09-20 13:28:14,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,562 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 418 transitions. [2019-09-20 13:28:14,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:14,562 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 418 transitions. [2019-09-20 13:28:14,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-20 13:28:14,563 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,563 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:14,563 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,564 INFO L82 PathProgramCache]: Analyzing trace with hash -716725212, now seen corresponding path program 1 times [2019-09-20 13:28:14,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-20 13:28:14,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,634 INFO L87 Difference]: Start difference. First operand 288 states and 418 transitions. Second operand 4 states. [2019-09-20 13:28:15,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:15,042 INFO L93 Difference]: Finished difference Result 360 states and 529 transitions. [2019-09-20 13:28:15,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:15,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-20 13:28:15,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:15,045 INFO L225 Difference]: With dead ends: 360 [2019-09-20 13:28:15,045 INFO L226 Difference]: Without dead ends: 360 [2019-09-20 13:28:15,045 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:15,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-09-20 13:28:15,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 320. [2019-09-20 13:28:15,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-20 13:28:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 475 transitions. [2019-09-20 13:28:15,055 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 475 transitions. Word has length 121 [2019-09-20 13:28:15,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:15,058 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 475 transitions. [2019-09-20 13:28:15,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:15,058 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 475 transitions. [2019-09-20 13:28:15,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-20 13:28:15,059 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:15,060 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:15,060 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:15,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:15,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1060531330, now seen corresponding path program 1 times [2019-09-20 13:28:15,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:15,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:15,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:15,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:15,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:15,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:15,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:15,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:15,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,191 INFO L87 Difference]: Start difference. First operand 320 states and 475 transitions. Second operand 4 states. [2019-09-20 13:28:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:15,543 INFO L93 Difference]: Finished difference Result 340 states and 503 transitions. [2019-09-20 13:28:15,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:15,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-20 13:28:15,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:15,546 INFO L225 Difference]: With dead ends: 340 [2019-09-20 13:28:15,546 INFO L226 Difference]: Without dead ends: 340 [2019-09-20 13:28:15,547 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-09-20 13:28:15,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 320. [2019-09-20 13:28:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-20 13:28:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 474 transitions. [2019-09-20 13:28:15,552 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 474 transitions. Word has length 122 [2019-09-20 13:28:15,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:15,553 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 474 transitions. [2019-09-20 13:28:15,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 474 transitions. [2019-09-20 13:28:15,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-20 13:28:15,555 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:15,556 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:15,556 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:15,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:15,557 INFO L82 PathProgramCache]: Analyzing trace with hash -627907154, now seen corresponding path program 1 times [2019-09-20 13:28:15,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:15,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:15,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-20 13:28:15,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:15,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:15,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:15,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:15,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:15,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,628 INFO L87 Difference]: Start difference. First operand 320 states and 474 transitions. Second operand 4 states. [2019-09-20 13:28:16,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,051 INFO L93 Difference]: Finished difference Result 426 states and 637 transitions. [2019-09-20 13:28:16,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-20 13:28:16,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,055 INFO L225 Difference]: With dead ends: 426 [2019-09-20 13:28:16,055 INFO L226 Difference]: Without dead ends: 426 [2019-09-20 13:28:16,056 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:16,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-09-20 13:28:16,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 359. [2019-09-20 13:28:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-20 13:28:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 545 transitions. [2019-09-20 13:28:16,062 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 545 transitions. Word has length 122 [2019-09-20 13:28:16,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,063 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 545 transitions. [2019-09-20 13:28:16,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 545 transitions. [2019-09-20 13:28:16,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-20 13:28:16,064 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,064 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:16,065 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,065 INFO L82 PathProgramCache]: Analyzing trace with hash 403455009, now seen corresponding path program 1 times [2019-09-20 13:28:16,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:16,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:16,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:16,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:16,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:16,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:16,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,126 INFO L87 Difference]: Start difference. First operand 359 states and 545 transitions. Second operand 4 states. [2019-09-20 13:28:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,419 INFO L93 Difference]: Finished difference Result 386 states and 579 transitions. [2019-09-20 13:28:16,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-20 13:28:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,422 INFO L225 Difference]: With dead ends: 386 [2019-09-20 13:28:16,422 INFO L226 Difference]: Without dead ends: 386 [2019-09-20 13:28:16,422 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:16,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-09-20 13:28:16,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 359. [2019-09-20 13:28:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-20 13:28:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 544 transitions. [2019-09-20 13:28:16,426 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 544 transitions. Word has length 123 [2019-09-20 13:28:16,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,427 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 544 transitions. [2019-09-20 13:28:16,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,427 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 544 transitions. [2019-09-20 13:28:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-20 13:28:16,428 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,428 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:16,428 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2001961044, now seen corresponding path program 1 times [2019-09-20 13:28:16,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:16,503 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-20 13:28:16,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:16,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:16,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:16,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:16,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:16,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,505 INFO L87 Difference]: Start difference. First operand 359 states and 544 transitions. Second operand 4 states. [2019-09-20 13:28:16,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,924 INFO L93 Difference]: Finished difference Result 420 states and 628 transitions. [2019-09-20 13:28:16,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-20 13:28:16,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,927 INFO L225 Difference]: With dead ends: 420 [2019-09-20 13:28:16,927 INFO L226 Difference]: Without dead ends: 420 [2019-09-20 13:28:16,928 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:16,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-09-20 13:28:16,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 358. [2019-09-20 13:28:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-09-20 13:28:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 543 transitions. [2019-09-20 13:28:16,933 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 543 transitions. Word has length 123 [2019-09-20 13:28:16,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,933 INFO L475 AbstractCegarLoop]: Abstraction has 358 states and 543 transitions. [2019-09-20 13:28:16,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,933 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 543 transitions. [2019-09-20 13:28:16,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-20 13:28:16,934 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,935 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:16,935 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2138877398, now seen corresponding path program 1 times [2019-09-20 13:28:16,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:17,012 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:17,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:17,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:17,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:17,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:17,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:17,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,014 INFO L87 Difference]: Start difference. First operand 358 states and 543 transitions. Second operand 4 states. [2019-09-20 13:28:17,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:17,304 INFO L93 Difference]: Finished difference Result 385 states and 577 transitions. [2019-09-20 13:28:17,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:17,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-20 13:28:17,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:17,306 INFO L225 Difference]: With dead ends: 385 [2019-09-20 13:28:17,306 INFO L226 Difference]: Without dead ends: 385 [2019-09-20 13:28:17,307 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:17,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-09-20 13:28:17,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 358. [2019-09-20 13:28:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-09-20 13:28:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 542 transitions. [2019-09-20 13:28:17,311 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 542 transitions. Word has length 124 [2019-09-20 13:28:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:17,311 INFO L475 AbstractCegarLoop]: Abstraction has 358 states and 542 transitions. [2019-09-20 13:28:17,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:17,312 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 542 transitions. [2019-09-20 13:28:17,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-20 13:28:17,312 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:17,313 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:17,313 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:17,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:17,313 INFO L82 PathProgramCache]: Analyzing trace with hash -968572580, now seen corresponding path program 1 times [2019-09-20 13:28:17,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:17,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:17,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:17,387 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:17,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:17,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:17,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:17,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:17,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:17,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,389 INFO L87 Difference]: Start difference. First operand 358 states and 542 transitions. Second operand 4 states. [2019-09-20 13:28:17,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:17,685 INFO L93 Difference]: Finished difference Result 385 states and 576 transitions. [2019-09-20 13:28:17,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:17,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-20 13:28:17,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:17,689 INFO L225 Difference]: With dead ends: 385 [2019-09-20 13:28:17,690 INFO L226 Difference]: Without dead ends: 385 [2019-09-20 13:28:17,690 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:17,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-09-20 13:28:17,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 358. [2019-09-20 13:28:17,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-09-20 13:28:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 541 transitions. [2019-09-20 13:28:17,696 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 541 transitions. Word has length 125 [2019-09-20 13:28:17,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:17,696 INFO L475 AbstractCegarLoop]: Abstraction has 358 states and 541 transitions. [2019-09-20 13:28:17,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:17,697 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 541 transitions. [2019-09-20 13:28:17,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-20 13:28:17,698 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:17,698 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:17,698 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:17,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:17,699 INFO L82 PathProgramCache]: Analyzing trace with hash -670630779, now seen corresponding path program 1 times [2019-09-20 13:28:17,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:17,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:17,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:17,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:17,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:17,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:17,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:17,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:17,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,804 INFO L87 Difference]: Start difference. First operand 358 states and 541 transitions. Second operand 4 states. [2019-09-20 13:28:18,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,070 INFO L93 Difference]: Finished difference Result 375 states and 563 transitions. [2019-09-20 13:28:18,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:18,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-20 13:28:18,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:18,073 INFO L225 Difference]: With dead ends: 375 [2019-09-20 13:28:18,073 INFO L226 Difference]: Without dead ends: 375 [2019-09-20 13:28:18,073 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-20 13:28:18,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 358. [2019-09-20 13:28:18,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-09-20 13:28:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 540 transitions. [2019-09-20 13:28:18,077 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 540 transitions. Word has length 126 [2019-09-20 13:28:18,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:18,078 INFO L475 AbstractCegarLoop]: Abstraction has 358 states and 540 transitions. [2019-09-20 13:28:18,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 540 transitions. [2019-09-20 13:28:18,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-20 13:28:18,079 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:18,079 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:18,080 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:18,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:18,080 INFO L82 PathProgramCache]: Analyzing trace with hash 779106087, now seen corresponding path program 1 times [2019-09-20 13:28:18,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:18,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:18,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:18,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:18,148 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:18,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:18,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:18,149 INFO L87 Difference]: Start difference. First operand 358 states and 540 transitions. Second operand 3 states. [2019-09-20 13:28:18,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,200 INFO L93 Difference]: Finished difference Result 687 states and 1038 transitions. [2019-09-20 13:28:18,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:18,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-20 13:28:18,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:18,204 INFO L225 Difference]: With dead ends: 687 [2019-09-20 13:28:18,204 INFO L226 Difference]: Without dead ends: 687 [2019-09-20 13:28:18,204 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:18,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-09-20 13:28:18,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 685. [2019-09-20 13:28:18,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-09-20 13:28:18,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1037 transitions. [2019-09-20 13:28:18,213 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1037 transitions. Word has length 127 [2019-09-20 13:28:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:18,214 INFO L475 AbstractCegarLoop]: Abstraction has 685 states and 1037 transitions. [2019-09-20 13:28:18,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1037 transitions. [2019-09-20 13:28:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-20 13:28:18,216 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:18,216 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:18,216 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:18,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:18,217 INFO L82 PathProgramCache]: Analyzing trace with hash -592701211, now seen corresponding path program 1 times [2019-09-20 13:28:18,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:18,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:18,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,299 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:18,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:18,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:18,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:18,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,301 INFO L87 Difference]: Start difference. First operand 685 states and 1037 transitions. Second operand 4 states.