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.14.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:54:41,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:54:41,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:54:41,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:54:41,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:54:41,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:54:41,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:54:41,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:54:41,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:54:41,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:54:41,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:54:41,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:54:41,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:54:41,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:54:41,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:54:41,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:54:41,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:54:41,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:54:41,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:54:41,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:54:41,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:54:41,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:54:41,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:54:41,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:54:41,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:54:41,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:54:41,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:54:41,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:54:41,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:54:41,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:54:41,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:54:41,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:54:41,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:54:41,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:54:41,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:54:41,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:54:41,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:54:41,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:54:41,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:54:41,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:54:41,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:54:41,429 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-09 05:54:41,453 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:54:41,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:54:41,454 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:54:41,454 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:54:41,455 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:54:41,455 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:54:41,455 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:54:41,456 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:54:41,456 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:54:41,456 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:54:41,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:54:41,459 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:54:41,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:54:41,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:54:41,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:54:41,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:54:41,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:54:41,461 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:54:41,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:54:41,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:54:41,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:54:41,462 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:54:41,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:54:41,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:54:41,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:54:41,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:54:41,463 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:54:41,463 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:54:41,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:54:41,464 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:54:41,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:54:41,534 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:54:41,538 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:54:41,539 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:54:41,540 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:54:41,541 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.14.i.cil-1.c [2019-09-09 05:54:41,613 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60170a2c/23ecb63e25874f978cbaeef24e0dec44/FLAG6ff86da1c [2019-09-09 05:54:42,224 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:54:42,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.14.i.cil-1.c [2019-09-09 05:54:42,246 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60170a2c/23ecb63e25874f978cbaeef24e0dec44/FLAG6ff86da1c [2019-09-09 05:54:42,407 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60170a2c/23ecb63e25874f978cbaeef24e0dec44 [2019-09-09 05:54:42,417 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:54:42,419 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:54:42,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:54:42,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:54:42,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:54:42,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:54:42" (1/1) ... [2019-09-09 05:54:42,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@197a7b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:42, skipping insertion in model container [2019-09-09 05:54:42,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:54:42" (1/1) ... [2019-09-09 05:54:42,434 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:54:42,517 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:54:43,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:54:43,108 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:54:43,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:54:43,303 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:54:43,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:43 WrapperNode [2019-09-09 05:54:43,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:54:43,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:54:43,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:54:43,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:54:43,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:43" (1/1) ... [2019-09-09 05:54:43,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:43" (1/1) ... [2019-09-09 05:54:43,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:43" (1/1) ... [2019-09-09 05:54:43,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:43" (1/1) ... [2019-09-09 05:54:43,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:43" (1/1) ... [2019-09-09 05:54:43,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:43" (1/1) ... [2019-09-09 05:54:43,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:43" (1/1) ... [2019-09-09 05:54:43,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:54:43,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:54:43,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:54:43,561 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:54:43,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:54:43,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:54:43,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:54:43,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-09 05:54:43,654 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-09 05:54:43,654 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:54:43,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:54:43,655 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-09 05:54:43,655 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-09 05:54:43,656 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-09 05:54:43,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:54:43,656 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-09 05:54:43,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:54:43,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:54:43,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:54:43,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:54:43,660 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-09 05:54:43,661 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-09 05:54:43,661 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-09 05:54:43,661 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:54:43,662 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-09 05:54:43,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-09 05:54:43,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-09 05:54:43,663 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:54:43,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-09 05:54:43,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-09 05:54:43,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-09 05:54:43,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-09 05:54:43,665 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-09 05:54:43,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-09 05:54:43,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:54:43,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-09 05:54:43,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-09 05:54:43,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-09 05:54:43,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:54:43,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-09 05:54:43,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-09 05:54:43,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-09 05:54:43,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-09 05:54:43,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-09 05:54:44,405 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:54:45,282 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-09 05:54:45,283 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-09 05:54:45,307 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:54:45,307 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:54:45,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:54:45 BoogieIcfgContainer [2019-09-09 05:54:45,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:54:45,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:54:45,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:54:45,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:54:45,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:54:42" (1/3) ... [2019-09-09 05:54:45,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd6e747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:54:45, skipping insertion in model container [2019-09-09 05:54:45,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:43" (2/3) ... [2019-09-09 05:54:45,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd6e747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:54:45, skipping insertion in model container [2019-09-09 05:54:45,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:54:45" (3/3) ... [2019-09-09 05:54:45,316 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14.i.cil-1.c [2019-09-09 05:54:45,326 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:54:45,335 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:54:45,352 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:54:45,383 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:54:45,383 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:54:45,384 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:54:45,384 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:54:45,384 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:54:45,384 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:54:45,384 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:54:45,384 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:54:45,404 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states. [2019-09-09 05:54:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-09 05:54:45,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:45,420 INFO L399 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, 1, 1] [2019-09-09 05:54:45,422 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:45,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:45,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2060539826, now seen corresponding path program 1 times [2019-09-09 05:54:45,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:45,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:45,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:45,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:45,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:45,831 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-09 05:54:45,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:45,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:45,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:45,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:45,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:45,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:45,861 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 4 states. [2019-09-09 05:54:46,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:46,312 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2019-09-09 05:54:46,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:46,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-09-09 05:54:46,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:46,329 INFO L225 Difference]: With dead ends: 196 [2019-09-09 05:54:46,329 INFO L226 Difference]: Without dead ends: 175 [2019-09-09 05:54:46,331 INFO L628 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-09 05:54:46,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-09 05:54:46,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 158. [2019-09-09 05:54:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-09 05:54:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 244 transitions. [2019-09-09 05:54:46,406 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 244 transitions. Word has length 49 [2019-09-09 05:54:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:46,407 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 244 transitions. [2019-09-09 05:54:46,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 244 transitions. [2019-09-09 05:54:46,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:54:46,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:46,413 INFO L399 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, 1, 1] [2019-09-09 05:54:46,413 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:46,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:46,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1928544508, now seen corresponding path program 1 times [2019-09-09 05:54:46,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:46,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:46,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:46,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:46,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:46,594 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-09 05:54:46,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:46,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:46,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:46,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:46,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:46,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:46,601 INFO L87 Difference]: Start difference. First operand 158 states and 244 transitions. Second operand 4 states. [2019-09-09 05:54:47,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:47,070 INFO L93 Difference]: Finished difference Result 175 states and 264 transitions. [2019-09-09 05:54:47,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:47,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-09 05:54:47,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:47,076 INFO L225 Difference]: With dead ends: 175 [2019-09-09 05:54:47,077 INFO L226 Difference]: Without dead ends: 175 [2019-09-09 05:54:47,078 INFO L628 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-09 05:54:47,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-09 05:54:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 158. [2019-09-09 05:54:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-09 05:54:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 243 transitions. [2019-09-09 05:54:47,098 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 243 transitions. Word has length 62 [2019-09-09 05:54:47,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:47,100 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 243 transitions. [2019-09-09 05:54:47,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 243 transitions. [2019-09-09 05:54:47,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:54:47,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:47,107 INFO L399 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, 1, 1] [2019-09-09 05:54:47,107 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:47,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:47,108 INFO L82 PathProgramCache]: Analyzing trace with hash -33363220, now seen corresponding path program 1 times [2019-09-09 05:54:47,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:47,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:47,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:47,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:47,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:47,259 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-09 05:54:47,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:47,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:47,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:47,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:47,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:47,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:47,261 INFO L87 Difference]: Start difference. First operand 158 states and 243 transitions. Second operand 4 states. [2019-09-09 05:54:47,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:47,638 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2019-09-09 05:54:47,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:47,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:54:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:47,640 INFO L225 Difference]: With dead ends: 174 [2019-09-09 05:54:47,641 INFO L226 Difference]: Without dead ends: 174 [2019-09-09 05:54:47,641 INFO L628 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-09 05:54:47,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-09 05:54:47,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2019-09-09 05:54:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-09 05:54:47,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 242 transitions. [2019-09-09 05:54:47,649 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 242 transitions. Word has length 63 [2019-09-09 05:54:47,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:47,650 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 242 transitions. [2019-09-09 05:54:47,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:47,653 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 242 transitions. [2019-09-09 05:54:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:54:47,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:47,655 INFO L399 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, 1] [2019-09-09 05:54:47,656 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:47,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:47,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1853540224, now seen corresponding path program 1 times [2019-09-09 05:54:47,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:47,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:47,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:47,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:47,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:47,804 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-09 05:54:47,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:47,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:54:47,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:47,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:54:47,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:54:47,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:47,806 INFO L87 Difference]: Start difference. First operand 158 states and 242 transitions. Second operand 5 states. [2019-09-09 05:54:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:48,355 INFO L93 Difference]: Finished difference Result 179 states and 270 transitions. [2019-09-09 05:54:48,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:54:48,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-09 05:54:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:48,358 INFO L225 Difference]: With dead ends: 179 [2019-09-09 05:54:48,358 INFO L226 Difference]: Without dead ends: 179 [2019-09-09 05:54:48,358 INFO L628 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-09 05:54:48,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-09 05:54:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-09-09 05:54:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-09 05:54:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 269 transitions. [2019-09-09 05:54:48,366 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 269 transitions. Word has length 63 [2019-09-09 05:54:48,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:48,367 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 269 transitions. [2019-09-09 05:54:48,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:54:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 269 transitions. [2019-09-09 05:54:48,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:54:48,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:48,369 INFO L399 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, 1, 1] [2019-09-09 05:54:48,369 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:48,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:48,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1258860232, now seen corresponding path program 1 times [2019-09-09 05:54:48,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:48,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:48,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:48,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:48,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:48,431 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-09 05:54:48,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:48,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:48,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:48,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:48,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:48,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:48,433 INFO L87 Difference]: Start difference. First operand 178 states and 269 transitions. Second operand 4 states. [2019-09-09 05:54:48,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:48,713 INFO L93 Difference]: Finished difference Result 193 states and 286 transitions. [2019-09-09 05:54:48,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:48,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:54:48,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:48,715 INFO L225 Difference]: With dead ends: 193 [2019-09-09 05:54:48,715 INFO L226 Difference]: Without dead ends: 193 [2019-09-09 05:54:48,716 INFO L628 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-09 05:54:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-09 05:54:48,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 178. [2019-09-09 05:54:48,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-09 05:54:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 268 transitions. [2019-09-09 05:54:48,723 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 268 transitions. Word has length 63 [2019-09-09 05:54:48,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:48,724 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 268 transitions. [2019-09-09 05:54:48,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:48,724 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 268 transitions. [2019-09-09 05:54:48,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:54:48,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:48,726 INFO L399 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, 1, 1] [2019-09-09 05:54:48,726 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:48,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:48,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1326420233, now seen corresponding path program 1 times [2019-09-09 05:54:48,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:48,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:48,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:48,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:48,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:48,802 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-09 05:54:48,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:48,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:48,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:48,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:48,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:48,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:48,808 INFO L87 Difference]: Start difference. First operand 178 states and 268 transitions. Second operand 4 states. [2019-09-09 05:54:49,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:49,066 INFO L93 Difference]: Finished difference Result 191 states and 283 transitions. [2019-09-09 05:54:49,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:49,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:54:49,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:49,069 INFO L225 Difference]: With dead ends: 191 [2019-09-09 05:54:49,070 INFO L226 Difference]: Without dead ends: 191 [2019-09-09 05:54:49,070 INFO L628 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-09 05:54:49,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-09 05:54:49,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2019-09-09 05:54:49,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-09 05:54:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 267 transitions. [2019-09-09 05:54:49,077 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 267 transitions. Word has length 63 [2019-09-09 05:54:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:49,077 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 267 transitions. [2019-09-09 05:54:49,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:49,077 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 267 transitions. [2019-09-09 05:54:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:54:49,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:49,079 INFO L399 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, 1, 1] [2019-09-09 05:54:49,079 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:49,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:49,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1044164865, now seen corresponding path program 1 times [2019-09-09 05:54:49,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:49,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:49,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:49,143 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-09 05:54:49,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:49,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:49,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:49,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:49,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:49,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:49,145 INFO L87 Difference]: Start difference. First operand 178 states and 267 transitions. Second operand 4 states. [2019-09-09 05:54:49,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:49,459 INFO L93 Difference]: Finished difference Result 191 states and 282 transitions. [2019-09-09 05:54:49,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:49,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-09 05:54:49,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:49,461 INFO L225 Difference]: With dead ends: 191 [2019-09-09 05:54:49,462 INFO L226 Difference]: Without dead ends: 191 [2019-09-09 05:54:49,462 INFO L628 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-09 05:54:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-09 05:54:49,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2019-09-09 05:54:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-09 05:54:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 266 transitions. [2019-09-09 05:54:49,470 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 266 transitions. Word has length 64 [2019-09-09 05:54:49,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:49,470 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 266 transitions. [2019-09-09 05:54:49,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:49,471 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 266 transitions. [2019-09-09 05:54:49,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:54:49,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:49,472 INFO L399 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, 1, 1] [2019-09-09 05:54:49,473 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:49,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:49,473 INFO L82 PathProgramCache]: Analyzing trace with hash 964284788, now seen corresponding path program 1 times [2019-09-09 05:54:49,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:49,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:49,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:49,537 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-09 05:54:49,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:49,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:49,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:49,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:49,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:49,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:49,539 INFO L87 Difference]: Start difference. First operand 178 states and 266 transitions. Second operand 4 states. [2019-09-09 05:54:49,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:49,913 INFO L93 Difference]: Finished difference Result 191 states and 281 transitions. [2019-09-09 05:54:49,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:49,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-09 05:54:49,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:49,915 INFO L225 Difference]: With dead ends: 191 [2019-09-09 05:54:49,915 INFO L226 Difference]: Without dead ends: 191 [2019-09-09 05:54:49,916 INFO L628 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-09 05:54:49,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-09 05:54:49,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2019-09-09 05:54:49,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-09 05:54:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 265 transitions. [2019-09-09 05:54:49,922 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 265 transitions. Word has length 65 [2019-09-09 05:54:49,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:49,922 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 265 transitions. [2019-09-09 05:54:49,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:49,922 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 265 transitions. [2019-09-09 05:54:49,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-09 05:54:49,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:49,924 INFO L399 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, 1, 1] [2019-09-09 05:54:49,924 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:49,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:49,924 INFO L82 PathProgramCache]: Analyzing trace with hash -959059780, now seen corresponding path program 1 times [2019-09-09 05:54:49,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:49,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:49,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:49,986 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-09 05:54:49,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:49,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:49,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:49,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:49,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:49,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:49,988 INFO L87 Difference]: Start difference. First operand 178 states and 265 transitions. Second operand 4 states. [2019-09-09 05:54:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:50,247 INFO L93 Difference]: Finished difference Result 191 states and 280 transitions. [2019-09-09 05:54:50,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:50,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-09 05:54:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:50,249 INFO L225 Difference]: With dead ends: 191 [2019-09-09 05:54:50,249 INFO L226 Difference]: Without dead ends: 191 [2019-09-09 05:54:50,249 INFO L628 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-09 05:54:50,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-09 05:54:50,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2019-09-09 05:54:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-09 05:54:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 264 transitions. [2019-09-09 05:54:50,254 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 264 transitions. Word has length 66 [2019-09-09 05:54:50,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:50,254 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 264 transitions. [2019-09-09 05:54:50,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 264 transitions. [2019-09-09 05:54:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-09 05:54:50,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:50,256 INFO L399 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, 1, 1] [2019-09-09 05:54:50,256 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:50,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:50,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1177157861, now seen corresponding path program 1 times [2019-09-09 05:54:50,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:50,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:50,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:50,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:50,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:50,311 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-09 05:54:50,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:50,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:50,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:50,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:50,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:50,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:50,313 INFO L87 Difference]: Start difference. First operand 178 states and 264 transitions. Second operand 4 states. [2019-09-09 05:54:50,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:50,619 INFO L93 Difference]: Finished difference Result 220 states and 326 transitions. [2019-09-09 05:54:50,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:50,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-09 05:54:50,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:50,622 INFO L225 Difference]: With dead ends: 220 [2019-09-09 05:54:50,623 INFO L226 Difference]: Without dead ends: 220 [2019-09-09 05:54:50,623 INFO L628 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-09 05:54:50,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-09 05:54:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 200. [2019-09-09 05:54:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-09 05:54:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2019-09-09 05:54:50,632 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 66 [2019-09-09 05:54:50,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:50,633 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2019-09-09 05:54:50,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:50,633 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2019-09-09 05:54:50,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-09 05:54:50,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:50,635 INFO L399 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, 1, 1] [2019-09-09 05:54:50,635 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:50,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:50,635 INFO L82 PathProgramCache]: Analyzing trace with hash 99738575, now seen corresponding path program 1 times [2019-09-09 05:54:50,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:50,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:50,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:50,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:50,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:50,758 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-09 05:54:50,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:50,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:50,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:50,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:50,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:50,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:50,760 INFO L87 Difference]: Start difference. First operand 200 states and 301 transitions. Second operand 4 states. [2019-09-09 05:54:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:51,000 INFO L93 Difference]: Finished difference Result 203 states and 304 transitions. [2019-09-09 05:54:51,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:51,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-09 05:54:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:51,002 INFO L225 Difference]: With dead ends: 203 [2019-09-09 05:54:51,003 INFO L226 Difference]: Without dead ends: 203 [2019-09-09 05:54:51,003 INFO L628 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-09 05:54:51,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-09 05:54:51,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2019-09-09 05:54:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-09 05:54:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 300 transitions. [2019-09-09 05:54:51,009 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 300 transitions. Word has length 67 [2019-09-09 05:54:51,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:51,009 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 300 transitions. [2019-09-09 05:54:51,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 300 transitions. [2019-09-09 05:54:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:54:51,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:51,011 INFO L399 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, 1, 1] [2019-09-09 05:54:51,011 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:51,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:51,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1071932073, now seen corresponding path program 1 times [2019-09-09 05:54:51,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:51,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:51,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:51,077 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-09 05:54:51,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:51,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:51,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:51,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:51,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:51,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:51,079 INFO L87 Difference]: Start difference. First operand 200 states and 300 transitions. Second operand 4 states. [2019-09-09 05:54:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:51,360 INFO L93 Difference]: Finished difference Result 220 states and 324 transitions. [2019-09-09 05:54:51,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:51,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-09 05:54:51,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:51,362 INFO L225 Difference]: With dead ends: 220 [2019-09-09 05:54:51,363 INFO L226 Difference]: Without dead ends: 220 [2019-09-09 05:54:51,363 INFO L628 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-09 05:54:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-09 05:54:51,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 200. [2019-09-09 05:54:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-09 05:54:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 299 transitions. [2019-09-09 05:54:51,370 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 299 transitions. Word has length 79 [2019-09-09 05:54:51,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:51,371 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 299 transitions. [2019-09-09 05:54:51,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:51,371 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 299 transitions. [2019-09-09 05:54:51,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:54:51,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:51,372 INFO L399 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, 1, 1] [2019-09-09 05:54:51,372 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:51,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:51,373 INFO L82 PathProgramCache]: Analyzing trace with hash -473678523, now seen corresponding path program 1 times [2019-09-09 05:54:51,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:51,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:51,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:51,433 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-09 05:54:51,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:51,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:51,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:51,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:51,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:51,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:51,435 INFO L87 Difference]: Start difference. First operand 200 states and 299 transitions. Second operand 4 states. [2019-09-09 05:54:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:51,707 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2019-09-09 05:54:51,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:51,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:54:51,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:51,710 INFO L225 Difference]: With dead ends: 219 [2019-09-09 05:54:51,710 INFO L226 Difference]: Without dead ends: 219 [2019-09-09 05:54:51,710 INFO L628 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-09 05:54:51,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-09 05:54:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 200. [2019-09-09 05:54:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-09 05:54:51,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 298 transitions. [2019-09-09 05:54:51,716 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 298 transitions. Word has length 80 [2019-09-09 05:54:51,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:51,716 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 298 transitions. [2019-09-09 05:54:51,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:51,716 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 298 transitions. [2019-09-09 05:54:51,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:54:51,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:51,718 INFO L399 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, 1, 1] [2019-09-09 05:54:51,718 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:51,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:51,718 INFO L82 PathProgramCache]: Analyzing trace with hash -541238524, now seen corresponding path program 1 times [2019-09-09 05:54:51,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:51,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:51,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:51,792 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-09 05:54:51,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:51,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:51,793 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:51,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:51,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:51,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:51,794 INFO L87 Difference]: Start difference. First operand 200 states and 298 transitions. Second operand 4 states. [2019-09-09 05:54:52,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:52,074 INFO L93 Difference]: Finished difference Result 217 states and 319 transitions. [2019-09-09 05:54:52,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:52,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:54:52,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:52,077 INFO L225 Difference]: With dead ends: 217 [2019-09-09 05:54:52,077 INFO L226 Difference]: Without dead ends: 217 [2019-09-09 05:54:52,078 INFO L628 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-09 05:54:52,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-09 05:54:52,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2019-09-09 05:54:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-09 05:54:52,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 297 transitions. [2019-09-09 05:54:52,084 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 297 transitions. Word has length 80 [2019-09-09 05:54:52,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:52,085 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 297 transitions. [2019-09-09 05:54:52,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:52,085 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 297 transitions. [2019-09-09 05:54:52,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 05:54:52,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:52,090 INFO L399 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, 1, 1] [2019-09-09 05:54:52,090 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:52,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:52,091 INFO L82 PathProgramCache]: Analyzing trace with hash -385005932, now seen corresponding path program 1 times [2019-09-09 05:54:52,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:52,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:52,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:52,165 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-09 05:54:52,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:52,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:52,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:52,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:52,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:52,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:52,167 INFO L87 Difference]: Start difference. First operand 200 states and 297 transitions. Second operand 4 states. [2019-09-09 05:54:52,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:52,432 INFO L93 Difference]: Finished difference Result 217 states and 318 transitions. [2019-09-09 05:54:52,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:52,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-09 05:54:52,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:52,435 INFO L225 Difference]: With dead ends: 217 [2019-09-09 05:54:52,435 INFO L226 Difference]: Without dead ends: 217 [2019-09-09 05:54:52,438 INFO L628 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-09 05:54:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-09 05:54:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2019-09-09 05:54:52,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-09 05:54:52,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 296 transitions. [2019-09-09 05:54:52,444 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 296 transitions. Word has length 81 [2019-09-09 05:54:52,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:52,444 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 296 transitions. [2019-09-09 05:54:52,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:52,444 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 296 transitions. [2019-09-09 05:54:52,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-09 05:54:52,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:52,446 INFO L399 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, 1, 1] [2019-09-09 05:54:52,446 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:52,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:52,446 INFO L82 PathProgramCache]: Analyzing trace with hash -390336959, now seen corresponding path program 1 times [2019-09-09 05:54:52,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:52,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:52,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:52,523 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-09 05:54:52,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:52,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:52,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:52,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:52,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:52,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:52,527 INFO L87 Difference]: Start difference. First operand 200 states and 296 transitions. Second operand 4 states. [2019-09-09 05:54:52,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:52,792 INFO L93 Difference]: Finished difference Result 217 states and 317 transitions. [2019-09-09 05:54:52,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:52,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-09 05:54:52,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:52,794 INFO L225 Difference]: With dead ends: 217 [2019-09-09 05:54:52,794 INFO L226 Difference]: Without dead ends: 217 [2019-09-09 05:54:52,795 INFO L628 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-09 05:54:52,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-09 05:54:52,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2019-09-09 05:54:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-09 05:54:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 295 transitions. [2019-09-09 05:54:52,800 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 295 transitions. Word has length 82 [2019-09-09 05:54:52,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:52,800 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 295 transitions. [2019-09-09 05:54:52,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 295 transitions. [2019-09-09 05:54:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-09 05:54:52,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:52,802 INFO L399 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, 1, 1] [2019-09-09 05:54:52,802 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:52,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:52,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2660977, now seen corresponding path program 1 times [2019-09-09 05:54:52,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:52,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:52,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:52,851 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-09 05:54:52,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:52,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:52,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:52,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:52,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:52,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:52,853 INFO L87 Difference]: Start difference. First operand 200 states and 295 transitions. Second operand 4 states. [2019-09-09 05:54:53,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:53,149 INFO L93 Difference]: Finished difference Result 217 states and 316 transitions. [2019-09-09 05:54:53,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:53,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-09 05:54:53,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:53,153 INFO L225 Difference]: With dead ends: 217 [2019-09-09 05:54:53,153 INFO L226 Difference]: Without dead ends: 217 [2019-09-09 05:54:53,154 INFO L628 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-09 05:54:53,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-09 05:54:53,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2019-09-09 05:54:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-09 05:54:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 294 transitions. [2019-09-09 05:54:53,167 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 294 transitions. Word has length 83 [2019-09-09 05:54:53,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:53,168 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 294 transitions. [2019-09-09 05:54:53,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:53,169 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 294 transitions. [2019-09-09 05:54:53,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-09 05:54:53,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:53,171 INFO L399 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, 1, 1] [2019-09-09 05:54:53,171 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:53,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:53,172 INFO L82 PathProgramCache]: Analyzing trace with hash -316669604, now seen corresponding path program 1 times [2019-09-09 05:54:53,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:53,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:53,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:53,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:53,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:53,341 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-09 05:54:53,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:53,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:53,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:53,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:53,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:53,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:53,345 INFO L87 Difference]: Start difference. First operand 200 states and 294 transitions. Second operand 4 states. [2019-09-09 05:54:53,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:53,680 INFO L93 Difference]: Finished difference Result 207 states and 303 transitions. [2019-09-09 05:54:53,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:53,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-09 05:54:53,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:53,683 INFO L225 Difference]: With dead ends: 207 [2019-09-09 05:54:53,683 INFO L226 Difference]: Without dead ends: 207 [2019-09-09 05:54:53,684 INFO L628 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-09 05:54:53,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-09 05:54:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2019-09-09 05:54:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-09 05:54:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 293 transitions. [2019-09-09 05:54:53,689 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 293 transitions. Word has length 84 [2019-09-09 05:54:53,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:53,690 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 293 transitions. [2019-09-09 05:54:53,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:53,690 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 293 transitions. [2019-09-09 05:54:53,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-09 05:54:53,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:53,691 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:53,691 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:53,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:53,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1342493364, now seen corresponding path program 1 times [2019-09-09 05:54:53,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:53,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:53,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:53,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:53,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:53,795 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-09 05:54:53,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:53,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:53,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:53,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:53,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:53,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:53,798 INFO L87 Difference]: Start difference. First operand 200 states and 293 transitions. Second operand 4 states. [2019-09-09 05:54:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:54,271 INFO L93 Difference]: Finished difference Result 311 states and 464 transitions. [2019-09-09 05:54:54,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:54,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-09 05:54:54,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:54,274 INFO L225 Difference]: With dead ends: 311 [2019-09-09 05:54:54,274 INFO L226 Difference]: Without dead ends: 311 [2019-09-09 05:54:54,276 INFO L628 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-09 05:54:54,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-09 05:54:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 241. [2019-09-09 05:54:54,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-09-09 05:54:54,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 366 transitions. [2019-09-09 05:54:54,284 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 366 transitions. Word has length 88 [2019-09-09 05:54:54,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:54,285 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 366 transitions. [2019-09-09 05:54:54,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:54,285 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 366 transitions. [2019-09-09 05:54:54,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-09 05:54:54,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:54,288 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:54,288 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:54,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:54,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1766140086, now seen corresponding path program 1 times [2019-09-09 05:54:54,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:54,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:54,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:54,360 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-09 05:54:54,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:54,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:54,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:54,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:54,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:54,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:54,362 INFO L87 Difference]: Start difference. First operand 241 states and 366 transitions. Second operand 4 states. [2019-09-09 05:54:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:54,674 INFO L93 Difference]: Finished difference Result 290 states and 439 transitions. [2019-09-09 05:54:54,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:54,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-09 05:54:54,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:54,676 INFO L225 Difference]: With dead ends: 290 [2019-09-09 05:54:54,676 INFO L226 Difference]: Without dead ends: 290 [2019-09-09 05:54:54,677 INFO L628 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-09 05:54:54,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-09 05:54:54,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 265. [2019-09-09 05:54:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-09 05:54:54,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 407 transitions. [2019-09-09 05:54:54,684 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 407 transitions. Word has length 88 [2019-09-09 05:54:54,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:54,685 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 407 transitions. [2019-09-09 05:54:54,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:54,685 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 407 transitions. [2019-09-09 05:54:54,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 05:54:54,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:54,686 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:54,687 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:54,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:54,687 INFO L82 PathProgramCache]: Analyzing trace with hash -190796336, now seen corresponding path program 1 times [2019-09-09 05:54:54,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:54,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:54,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:54,757 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-09 05:54:54,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:54,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:54,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:54,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:54,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:54,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:54,759 INFO L87 Difference]: Start difference. First operand 265 states and 407 transitions. Second operand 4 states. [2019-09-09 05:54:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:55,184 INFO L93 Difference]: Finished difference Result 327 states and 493 transitions. [2019-09-09 05:54:55,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:55,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-09 05:54:55,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:55,187 INFO L225 Difference]: With dead ends: 327 [2019-09-09 05:54:55,187 INFO L226 Difference]: Without dead ends: 327 [2019-09-09 05:54:55,188 INFO L628 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-09 05:54:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-09 05:54:55,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 266. [2019-09-09 05:54:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-09 05:54:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 408 transitions. [2019-09-09 05:54:55,195 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 408 transitions. Word has length 89 [2019-09-09 05:54:55,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:55,195 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 408 transitions. [2019-09-09 05:54:55,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 408 transitions. [2019-09-09 05:54:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:54:55,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:55,197 INFO L399 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, 1, 1] [2019-09-09 05:54:55,197 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:55,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:55,197 INFO L82 PathProgramCache]: Analyzing trace with hash -278320546, now seen corresponding path program 1 times [2019-09-09 05:54:55,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:55,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:55,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:55,265 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-09 05:54:55,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:55,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:55,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:55,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:55,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:55,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:55,266 INFO L87 Difference]: Start difference. First operand 266 states and 408 transitions. Second operand 4 states. [2019-09-09 05:54:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:55,677 INFO L93 Difference]: Finished difference Result 327 states and 492 transitions. [2019-09-09 05:54:55,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:55,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-09 05:54:55,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:55,680 INFO L225 Difference]: With dead ends: 327 [2019-09-09 05:54:55,680 INFO L226 Difference]: Without dead ends: 327 [2019-09-09 05:54:55,681 INFO L628 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-09 05:54:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-09 05:54:55,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 266. [2019-09-09 05:54:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-09 05:54:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 407 transitions. [2019-09-09 05:54:55,689 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 407 transitions. Word has length 101 [2019-09-09 05:54:55,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:55,689 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 407 transitions. [2019-09-09 05:54:55,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 407 transitions. [2019-09-09 05:54:55,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:54:55,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:55,691 INFO L399 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, 1, 1] [2019-09-09 05:54:55,691 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:55,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:55,692 INFO L82 PathProgramCache]: Analyzing trace with hash 597698460, now seen corresponding path program 1 times [2019-09-09 05:54:55,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:55,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:55,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:55,756 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-09 05:54:55,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:55,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:55,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:55,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:55,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:55,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:55,758 INFO L87 Difference]: Start difference. First operand 266 states and 407 transitions. Second operand 4 states. [2019-09-09 05:54:56,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:56,072 INFO L93 Difference]: Finished difference Result 291 states and 438 transitions. [2019-09-09 05:54:56,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:56,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-09 05:54:56,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:56,075 INFO L225 Difference]: With dead ends: 291 [2019-09-09 05:54:56,075 INFO L226 Difference]: Without dead ends: 291 [2019-09-09 05:54:56,076 INFO L628 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-09 05:54:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-09 05:54:56,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 266. [2019-09-09 05:54:56,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-09 05:54:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 406 transitions. [2019-09-09 05:54:56,082 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 406 transitions. Word has length 101 [2019-09-09 05:54:56,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:56,083 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 406 transitions. [2019-09-09 05:54:56,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:56,083 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 406 transitions. [2019-09-09 05:54:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:54:56,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:56,085 INFO L399 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, 1, 1] [2019-09-09 05:54:56,085 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:56,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:56,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1641524962, now seen corresponding path program 1 times [2019-09-09 05:54:56,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:56,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:56,158 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-09 05:54:56,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:56,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:56,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:56,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:56,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:56,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:56,160 INFO L87 Difference]: Start difference. First operand 266 states and 406 transitions. Second operand 4 states. [2019-09-09 05:54:56,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:56,663 INFO L93 Difference]: Finished difference Result 326 states and 489 transitions. [2019-09-09 05:54:56,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:56,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:54:56,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:56,666 INFO L225 Difference]: With dead ends: 326 [2019-09-09 05:54:56,666 INFO L226 Difference]: Without dead ends: 326 [2019-09-09 05:54:56,666 INFO L628 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-09 05:54:56,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-09 05:54:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 266. [2019-09-09 05:54:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-09 05:54:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 405 transitions. [2019-09-09 05:54:56,674 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 405 transitions. Word has length 102 [2019-09-09 05:54:56,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:56,674 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 405 transitions. [2019-09-09 05:54:56,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:56,674 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 405 transitions. [2019-09-09 05:54:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:54:56,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:56,676 INFO L399 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, 1, 1] [2019-09-09 05:54:56,677 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:56,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:56,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1709084963, now seen corresponding path program 1 times [2019-09-09 05:54:56,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:56,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:56,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:56,787 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-09 05:54:56,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:56,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:56,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:56,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:56,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:56,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:56,789 INFO L87 Difference]: Start difference. First operand 266 states and 405 transitions. Second operand 4 states. [2019-09-09 05:54:57,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:57,168 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-09-09 05:54:57,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:57,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:54:57,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:57,171 INFO L225 Difference]: With dead ends: 324 [2019-09-09 05:54:57,171 INFO L226 Difference]: Without dead ends: 324 [2019-09-09 05:54:57,171 INFO L628 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-09 05:54:57,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-09 05:54:57,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 266. [2019-09-09 05:54:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-09 05:54:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 404 transitions. [2019-09-09 05:54:57,180 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 404 transitions. Word has length 102 [2019-09-09 05:54:57,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:57,180 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 404 transitions. [2019-09-09 05:54:57,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 404 transitions. [2019-09-09 05:54:57,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:54:57,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:57,182 INFO L399 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, 1, 1] [2019-09-09 05:54:57,182 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:57,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:57,183 INFO L82 PathProgramCache]: Analyzing trace with hash -254739552, now seen corresponding path program 1 times [2019-09-09 05:54:57,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:57,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:57,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:57,255 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-09 05:54:57,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:57,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:57,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:57,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:57,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:57,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:57,258 INFO L87 Difference]: Start difference. First operand 266 states and 404 transitions. Second operand 4 states. [2019-09-09 05:54:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:57,552 INFO L93 Difference]: Finished difference Result 290 states and 434 transitions. [2019-09-09 05:54:57,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:57,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:54:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:57,555 INFO L225 Difference]: With dead ends: 290 [2019-09-09 05:54:57,556 INFO L226 Difference]: Without dead ends: 290 [2019-09-09 05:54:57,556 INFO L628 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-09 05:54:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-09 05:54:57,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 266. [2019-09-09 05:54:57,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-09 05:54:57,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 403 transitions. [2019-09-09 05:54:57,563 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 403 transitions. Word has length 102 [2019-09-09 05:54:57,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:57,563 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 403 transitions. [2019-09-09 05:54:57,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:57,563 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 403 transitions. [2019-09-09 05:54:57,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:54:57,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:57,565 INFO L399 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, 1, 1] [2019-09-09 05:54:57,565 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:57,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:57,565 INFO L82 PathProgramCache]: Analyzing trace with hash -322299553, now seen corresponding path program 1 times [2019-09-09 05:54:57,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:57,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:57,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:57,631 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-09 05:54:57,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:57,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:57,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:57,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:57,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:57,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:57,633 INFO L87 Difference]: Start difference. First operand 266 states and 403 transitions. Second operand 4 states. [2019-09-09 05:54:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:57,925 INFO L93 Difference]: Finished difference Result 288 states and 431 transitions. [2019-09-09 05:54:57,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:57,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:54:57,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:57,928 INFO L225 Difference]: With dead ends: 288 [2019-09-09 05:54:57,928 INFO L226 Difference]: Without dead ends: 288 [2019-09-09 05:54:57,929 INFO L628 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-09 05:54:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-09 05:54:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2019-09-09 05:54:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-09 05:54:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 402 transitions. [2019-09-09 05:54:57,935 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 402 transitions. Word has length 102 [2019-09-09 05:54:57,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:57,935 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 402 transitions. [2019-09-09 05:54:57,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 402 transitions. [2019-09-09 05:54:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:54:57,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:57,937 INFO L399 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, 1, 1] [2019-09-09 05:54:57,937 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:57,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:57,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2066460123, now seen corresponding path program 1 times [2019-09-09 05:54:57,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:57,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:57,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:57,996 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-09 05:54:57,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:57,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:57,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:57,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:57,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:57,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:57,998 INFO L87 Difference]: Start difference. First operand 266 states and 402 transitions. Second operand 4 states. [2019-09-09 05:54:58,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:58,402 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2019-09-09 05:54:58,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:58,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:54:58,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:58,404 INFO L225 Difference]: With dead ends: 324 [2019-09-09 05:54:58,404 INFO L226 Difference]: Without dead ends: 324 [2019-09-09 05:54:58,405 INFO L628 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-09 05:54:58,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-09 05:54:58,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 266. [2019-09-09 05:54:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-09 05:54:58,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 401 transitions. [2019-09-09 05:54:58,411 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 401 transitions. Word has length 103 [2019-09-09 05:54:58,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:58,411 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 401 transitions. [2019-09-09 05:54:58,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:58,411 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 401 transitions. [2019-09-09 05:54:58,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:54:58,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:58,413 INFO L399 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, 1, 1] [2019-09-09 05:54:58,413 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:58,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:58,413 INFO L82 PathProgramCache]: Analyzing trace with hash 2107134873, now seen corresponding path program 1 times [2019-09-09 05:54:58,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:58,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:58,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:58,476 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-09 05:54:58,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:58,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:58,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:58,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:58,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:58,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:58,478 INFO L87 Difference]: Start difference. First operand 266 states and 401 transitions. Second operand 4 states. [2019-09-09 05:54:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:58,772 INFO L93 Difference]: Finished difference Result 288 states and 429 transitions. [2019-09-09 05:54:58,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:58,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:54:58,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:58,775 INFO L225 Difference]: With dead ends: 288 [2019-09-09 05:54:58,775 INFO L226 Difference]: Without dead ends: 288 [2019-09-09 05:54:58,776 INFO L628 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-09 05:54:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-09 05:54:58,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2019-09-09 05:54:58,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-09 05:54:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 400 transitions. [2019-09-09 05:54:58,786 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 400 transitions. Word has length 103 [2019-09-09 05:54:58,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:58,786 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 400 transitions. [2019-09-09 05:54:58,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:58,787 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 400 transitions. [2019-09-09 05:54:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:54:58,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:58,789 INFO L399 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, 1, 1] [2019-09-09 05:54:58,789 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:58,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:58,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1704300582, now seen corresponding path program 1 times [2019-09-09 05:54:58,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:58,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:58,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:58,877 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-09 05:54:58,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:58,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:58,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:58,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:58,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:58,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:58,879 INFO L87 Difference]: Start difference. First operand 266 states and 400 transitions. Second operand 4 states. [2019-09-09 05:54:59,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:59,391 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2019-09-09 05:54:59,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:59,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:54:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:59,394 INFO L225 Difference]: With dead ends: 324 [2019-09-09 05:54:59,394 INFO L226 Difference]: Without dead ends: 324 [2019-09-09 05:54:59,395 INFO L628 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-09 05:54:59,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-09 05:54:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 266. [2019-09-09 05:54:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-09 05:54:59,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 399 transitions. [2019-09-09 05:54:59,401 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 399 transitions. Word has length 104 [2019-09-09 05:54:59,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:59,402 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 399 transitions. [2019-09-09 05:54:59,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:59,402 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 399 transitions. [2019-09-09 05:54:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:54:59,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:59,404 INFO L399 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, 1, 1] [2019-09-09 05:54:59,404 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:59,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:59,404 INFO L82 PathProgramCache]: Analyzing trace with hash -443383332, now seen corresponding path program 1 times [2019-09-09 05:54:59,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:59,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:59,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:59,471 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-09 05:54:59,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:59,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:59,472 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:59,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:59,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:59,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:59,473 INFO L87 Difference]: Start difference. First operand 266 states and 399 transitions. Second operand 4 states. [2019-09-09 05:54:59,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:59,757 INFO L93 Difference]: Finished difference Result 288 states and 427 transitions. [2019-09-09 05:54:59,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:59,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:54:59,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:59,759 INFO L225 Difference]: With dead ends: 288 [2019-09-09 05:54:59,759 INFO L226 Difference]: Without dead ends: 288 [2019-09-09 05:54:59,762 INFO L628 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-09 05:54:59,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-09 05:54:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2019-09-09 05:54:59,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-09 05:54:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 398 transitions. [2019-09-09 05:54:59,770 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 398 transitions. Word has length 104 [2019-09-09 05:54:59,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:59,770 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 398 transitions. [2019-09-09 05:54:59,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:59,770 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 398 transitions. [2019-09-09 05:54:59,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:54:59,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:59,772 INFO L399 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, 1, 1] [2019-09-09 05:54:59,772 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:59,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:59,773 INFO L82 PathProgramCache]: Analyzing trace with hash -2080827626, now seen corresponding path program 1 times [2019-09-09 05:54:59,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:59,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:59,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:59,859 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-09 05:54:59,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:59,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:59,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:59,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:59,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:59,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:59,862 INFO L87 Difference]: Start difference. First operand 266 states and 398 transitions. Second operand 4 states. [2019-09-09 05:55:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:00,283 INFO L93 Difference]: Finished difference Result 324 states and 479 transitions. [2019-09-09 05:55:00,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:00,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-09 05:55:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:00,287 INFO L225 Difference]: With dead ends: 324 [2019-09-09 05:55:00,287 INFO L226 Difference]: Without dead ends: 324 [2019-09-09 05:55:00,288 INFO L628 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-09 05:55:00,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-09 05:55:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 266. [2019-09-09 05:55:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-09 05:55:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 397 transitions. [2019-09-09 05:55:00,294 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 397 transitions. Word has length 105 [2019-09-09 05:55:00,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:00,295 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 397 transitions. [2019-09-09 05:55:00,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 397 transitions. [2019-09-09 05:55:00,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:55:00,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:00,296 INFO L399 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, 1, 1] [2019-09-09 05:55:00,297 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:00,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:00,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1647098540, now seen corresponding path program 1 times [2019-09-09 05:55:00,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:00,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:00,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:00,357 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-09 05:55:00,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:00,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:00,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:00,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:00,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:00,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:00,359 INFO L87 Difference]: Start difference. First operand 266 states and 397 transitions. Second operand 4 states. [2019-09-09 05:55:00,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:00,627 INFO L93 Difference]: Finished difference Result 288 states and 425 transitions. [2019-09-09 05:55:00,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:00,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-09 05:55:00,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:00,630 INFO L225 Difference]: With dead ends: 288 [2019-09-09 05:55:00,630 INFO L226 Difference]: Without dead ends: 288 [2019-09-09 05:55:00,631 INFO L628 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-09 05:55:00,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-09 05:55:00,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2019-09-09 05:55:00,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-09 05:55:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 396 transitions. [2019-09-09 05:55:00,637 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 396 transitions. Word has length 105 [2019-09-09 05:55:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:00,637 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 396 transitions. [2019-09-09 05:55:00,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:00,638 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 396 transitions. [2019-09-09 05:55:00,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-09 05:55:00,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:00,639 INFO L399 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, 1, 1] [2019-09-09 05:55:00,639 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:00,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:00,640 INFO L82 PathProgramCache]: Analyzing trace with hash -315326283, now seen corresponding path program 1 times [2019-09-09 05:55:00,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:00,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:00,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:00,702 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-09 05:55:00,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:00,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:00,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:00,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:00,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:00,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:00,704 INFO L87 Difference]: Start difference. First operand 266 states and 396 transitions. Second operand 4 states. [2019-09-09 05:55:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:01,082 INFO L93 Difference]: Finished difference Result 314 states and 465 transitions. [2019-09-09 05:55:01,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:01,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-09 05:55:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:01,085 INFO L225 Difference]: With dead ends: 314 [2019-09-09 05:55:01,085 INFO L226 Difference]: Without dead ends: 314 [2019-09-09 05:55:01,085 INFO L628 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-09 05:55:01,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-09 05:55:01,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 266. [2019-09-09 05:55:01,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-09 05:55:01,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 395 transitions. [2019-09-09 05:55:01,091 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 395 transitions. Word has length 106 [2019-09-09 05:55:01,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:01,092 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 395 transitions. [2019-09-09 05:55:01,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 395 transitions. [2019-09-09 05:55:01,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-09 05:55:01,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:01,093 INFO L399 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, 1, 1] [2019-09-09 05:55:01,093 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:01,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:01,094 INFO L82 PathProgramCache]: Analyzing trace with hash 245373495, now seen corresponding path program 1 times [2019-09-09 05:55:01,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:01,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:01,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:01,163 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-09 05:55:01,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:01,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:01,163 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:01,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:01,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:01,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:01,164 INFO L87 Difference]: Start difference. First operand 266 states and 395 transitions. Second operand 4 states. [2019-09-09 05:55:01,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:01,416 INFO L93 Difference]: Finished difference Result 278 states and 411 transitions. [2019-09-09 05:55:01,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:01,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-09 05:55:01,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:01,419 INFO L225 Difference]: With dead ends: 278 [2019-09-09 05:55:01,419 INFO L226 Difference]: Without dead ends: 278 [2019-09-09 05:55:01,419 INFO L628 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-09 05:55:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-09 05:55:01,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 266. [2019-09-09 05:55:01,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-09 05:55:01,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 394 transitions. [2019-09-09 05:55:01,426 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 394 transitions. Word has length 106 [2019-09-09 05:55:01,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:01,426 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 394 transitions. [2019-09-09 05:55:01,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:01,426 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 394 transitions. [2019-09-09 05:55:01,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-09 05:55:01,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:01,428 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:01,428 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:01,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:01,428 INFO L82 PathProgramCache]: Analyzing trace with hash -807858597, now seen corresponding path program 1 times [2019-09-09 05:55:01,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:01,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:01,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:01,507 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-09 05:55:01,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:01,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:01,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:01,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:01,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:01,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:01,511 INFO L87 Difference]: Start difference. First operand 266 states and 394 transitions. Second operand 4 states. [2019-09-09 05:55:01,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:01,890 INFO L93 Difference]: Finished difference Result 314 states and 463 transitions. [2019-09-09 05:55:01,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:01,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-09 05:55:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:01,892 INFO L225 Difference]: With dead ends: 314 [2019-09-09 05:55:01,892 INFO L226 Difference]: Without dead ends: 314 [2019-09-09 05:55:01,892 INFO L628 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-09 05:55:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-09 05:55:01,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 266. [2019-09-09 05:55:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-09 05:55:01,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 393 transitions. [2019-09-09 05:55:01,898 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 393 transitions. Word has length 110 [2019-09-09 05:55:01,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:01,898 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 393 transitions. [2019-09-09 05:55:01,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 393 transitions. [2019-09-09 05:55:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-09 05:55:01,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:01,900 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:01,900 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:01,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:01,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1225255203, now seen corresponding path program 1 times [2019-09-09 05:55:01,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:01,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:01,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-09 05:55:01,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:01,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:01,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:01,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:01,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:01,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:01,973 INFO L87 Difference]: Start difference. First operand 266 states and 393 transitions. Second operand 3 states. [2019-09-09 05:55:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:02,042 INFO L93 Difference]: Finished difference Result 505 states and 744 transitions. [2019-09-09 05:55:02,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:02,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-09 05:55:02,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:02,045 INFO L225 Difference]: With dead ends: 505 [2019-09-09 05:55:02,045 INFO L226 Difference]: Without dead ends: 505 [2019-09-09 05:55:02,046 INFO L628 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-09 05:55:02,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-09 05:55:02,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-09-09 05:55:02,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-09 05:55:02,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 744 transitions. [2019-09-09 05:55:02,059 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 744 transitions. Word has length 110 [2019-09-09 05:55:02,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:02,060 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 744 transitions. [2019-09-09 05:55:02,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:02,061 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 744 transitions. [2019-09-09 05:55:02,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-09 05:55:02,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:02,064 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:02,064 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:02,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:02,064 INFO L82 PathProgramCache]: Analyzing trace with hash -875033401, now seen corresponding path program 1 times [2019-09-09 05:55:02,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:02,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:02,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:02,142 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-09 05:55:02,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:02,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:02,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:02,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:02,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:02,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:02,144 INFO L87 Difference]: Start difference. First operand 505 states and 744 transitions. Second operand 3 states. [2019-09-09 05:55:02,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:02,210 INFO L93 Difference]: Finished difference Result 744 states and 1096 transitions. [2019-09-09 05:55:02,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:02,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-09 05:55:02,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:02,214 INFO L225 Difference]: With dead ends: 744 [2019-09-09 05:55:02,214 INFO L226 Difference]: Without dead ends: 744 [2019-09-09 05:55:02,214 INFO L628 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-09 05:55:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-09-09 05:55:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2019-09-09 05:55:02,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-09-09 05:55:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1096 transitions. [2019-09-09 05:55:02,227 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1096 transitions. Word has length 112 [2019-09-09 05:55:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:02,227 INFO L475 AbstractCegarLoop]: Abstraction has 744 states and 1096 transitions. [2019-09-09 05:55:02,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1096 transitions. [2019-09-09 05:55:02,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-09 05:55:02,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:02,230 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:02,230 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:02,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:02,230 INFO L82 PathProgramCache]: Analyzing trace with hash -355360796, now seen corresponding path program 1 times [2019-09-09 05:55:02,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:02,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:02,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:02,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:02,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:02,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:02,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:02,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:02,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:02,312 INFO L87 Difference]: Start difference. First operand 744 states and 1096 transitions. Second operand 4 states. [2019-09-09 05:55:02,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:02,665 INFO L93 Difference]: Finished difference Result 933 states and 1387 transitions. [2019-09-09 05:55:02,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:02,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-09 05:55:02,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:02,674 INFO L225 Difference]: With dead ends: 933 [2019-09-09 05:55:02,674 INFO L226 Difference]: Without dead ends: 933 [2019-09-09 05:55:02,674 INFO L628 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-09 05:55:02,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-09-09 05:55:02,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 828. [2019-09-09 05:55:02,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-09 05:55:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1243 transitions. [2019-09-09 05:55:02,689 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1243 transitions. Word has length 141 [2019-09-09 05:55:02,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:02,689 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1243 transitions. [2019-09-09 05:55:02,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:02,689 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1243 transitions. [2019-09-09 05:55:02,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-09 05:55:02,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:02,692 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:02,692 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:02,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:02,692 INFO L82 PathProgramCache]: Analyzing trace with hash 874990382, now seen corresponding path program 1 times [2019-09-09 05:55:02,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:02,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:02,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:02,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:02,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:02,766 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:02,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:02,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:02,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:02,767 INFO L87 Difference]: Start difference. First operand 828 states and 1243 transitions. Second operand 4 states. [2019-09-09 05:55:03,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:03,099 INFO L93 Difference]: Finished difference Result 933 states and 1384 transitions. [2019-09-09 05:55:03,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:03,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-09 05:55:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:03,106 INFO L225 Difference]: With dead ends: 933 [2019-09-09 05:55:03,106 INFO L226 Difference]: Without dead ends: 933 [2019-09-09 05:55:03,107 INFO L628 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-09 05:55:03,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-09-09 05:55:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 828. [2019-09-09 05:55:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-09 05:55:03,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1240 transitions. [2019-09-09 05:55:03,123 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1240 transitions. Word has length 154 [2019-09-09 05:55:03,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:03,124 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1240 transitions. [2019-09-09 05:55:03,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:03,124 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1240 transitions. [2019-09-09 05:55:03,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:55:03,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:03,127 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:03,127 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:03,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:03,128 INFO L82 PathProgramCache]: Analyzing trace with hash -248624562, now seen corresponding path program 1 times [2019-09-09 05:55:03,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:03,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:03,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:03,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:03,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:03,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:03,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:03,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:03,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:03,281 INFO L87 Difference]: Start difference. First operand 828 states and 1240 transitions. Second operand 4 states. [2019-09-09 05:55:03,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:03,646 INFO L93 Difference]: Finished difference Result 930 states and 1378 transitions. [2019-09-09 05:55:03,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:03,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-09 05:55:03,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:03,650 INFO L225 Difference]: With dead ends: 930 [2019-09-09 05:55:03,650 INFO L226 Difference]: Without dead ends: 930 [2019-09-09 05:55:03,651 INFO L628 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-09 05:55:03,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-09-09 05:55:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 828. [2019-09-09 05:55:03,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-09 05:55:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1237 transitions. [2019-09-09 05:55:03,664 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1237 transitions. Word has length 155 [2019-09-09 05:55:03,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:03,664 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1237 transitions. [2019-09-09 05:55:03,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1237 transitions. [2019-09-09 05:55:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:55:03,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:03,667 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:03,667 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:03,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:03,668 INFO L82 PathProgramCache]: Analyzing trace with hash -316184563, now seen corresponding path program 1 times [2019-09-09 05:55:03,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:03,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:03,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:03,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:03,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:03,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:03,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:03,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:03,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:03,745 INFO L87 Difference]: Start difference. First operand 828 states and 1237 transitions. Second operand 4 states. [2019-09-09 05:55:04,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:04,070 INFO L93 Difference]: Finished difference Result 924 states and 1369 transitions. [2019-09-09 05:55:04,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:04,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-09 05:55:04,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:04,075 INFO L225 Difference]: With dead ends: 924 [2019-09-09 05:55:04,075 INFO L226 Difference]: Without dead ends: 924 [2019-09-09 05:55:04,076 INFO L628 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-09 05:55:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-09-09 05:55:04,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 828. [2019-09-09 05:55:04,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-09 05:55:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1234 transitions. [2019-09-09 05:55:04,093 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1234 transitions. Word has length 155 [2019-09-09 05:55:04,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:04,094 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1234 transitions. [2019-09-09 05:55:04,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:04,094 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1234 transitions. [2019-09-09 05:55:04,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:55:04,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:04,101 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:04,101 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:04,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:04,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1998267733, now seen corresponding path program 1 times [2019-09-09 05:55:04,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:04,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:04,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:04,222 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:04,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:04,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:04,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:04,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:04,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:04,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:04,224 INFO L87 Difference]: Start difference. First operand 828 states and 1234 transitions. Second operand 4 states. [2019-09-09 05:55:04,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:04,570 INFO L93 Difference]: Finished difference Result 924 states and 1366 transitions. [2019-09-09 05:55:04,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:04,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:55:04,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:04,578 INFO L225 Difference]: With dead ends: 924 [2019-09-09 05:55:04,579 INFO L226 Difference]: Without dead ends: 924 [2019-09-09 05:55:04,579 INFO L628 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-09 05:55:04,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-09-09 05:55:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 828. [2019-09-09 05:55:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-09 05:55:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1231 transitions. [2019-09-09 05:55:04,599 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1231 transitions. Word has length 156 [2019-09-09 05:55:04,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:04,599 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1231 transitions. [2019-09-09 05:55:04,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1231 transitions. [2019-09-09 05:55:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-09 05:55:04,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:04,602 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:04,602 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:04,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:04,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1138154762, now seen corresponding path program 1 times [2019-09-09 05:55:04,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:04,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:04,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:04,716 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:04,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:04,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:04,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:04,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:04,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:04,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:04,718 INFO L87 Difference]: Start difference. First operand 828 states and 1231 transitions. Second operand 4 states. [2019-09-09 05:55:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:05,051 INFO L93 Difference]: Finished difference Result 924 states and 1363 transitions. [2019-09-09 05:55:05,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:05,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-09 05:55:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:05,054 INFO L225 Difference]: With dead ends: 924 [2019-09-09 05:55:05,054 INFO L226 Difference]: Without dead ends: 924 [2019-09-09 05:55:05,055 INFO L628 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-09 05:55:05,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-09-09 05:55:05,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 828. [2019-09-09 05:55:05,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-09 05:55:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1228 transitions. [2019-09-09 05:55:05,096 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1228 transitions. Word has length 157 [2019-09-09 05:55:05,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:05,097 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1228 transitions. [2019-09-09 05:55:05,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1228 transitions. [2019-09-09 05:55:05,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:55:05,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:05,099 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:05,099 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:05,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:05,100 INFO L82 PathProgramCache]: Analyzing trace with hash 135942118, now seen corresponding path program 1 times [2019-09-09 05:55:05,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:05,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:05,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:05,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:05,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:05,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:05,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:05,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:05,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:05,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:05,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:05,204 INFO L87 Difference]: Start difference. First operand 828 states and 1228 transitions. Second operand 4 states. [2019-09-09 05:55:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:05,576 INFO L93 Difference]: Finished difference Result 924 states and 1360 transitions. [2019-09-09 05:55:05,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:05,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-09 05:55:05,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:05,582 INFO L225 Difference]: With dead ends: 924 [2019-09-09 05:55:05,582 INFO L226 Difference]: Without dead ends: 924 [2019-09-09 05:55:05,582 INFO L628 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-09 05:55:05,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-09-09 05:55:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 828. [2019-09-09 05:55:05,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-09 05:55:05,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1225 transitions. [2019-09-09 05:55:05,594 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1225 transitions. Word has length 158 [2019-09-09 05:55:05,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:05,595 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1225 transitions. [2019-09-09 05:55:05,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:05,595 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1225 transitions. [2019-09-09 05:55:05,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-09 05:55:05,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:05,597 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:05,598 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:05,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:05,598 INFO L82 PathProgramCache]: Analyzing trace with hash -314940955, now seen corresponding path program 1 times [2019-09-09 05:55:05,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:05,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:05,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:05,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:05,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:05,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:05,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:05,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:05,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:05,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:05,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:05,683 INFO L87 Difference]: Start difference. First operand 828 states and 1225 transitions. Second operand 4 states. [2019-09-09 05:55:06,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:06,133 INFO L93 Difference]: Finished difference Result 894 states and 1321 transitions. [2019-09-09 05:55:06,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:06,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-09 05:55:06,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:06,138 INFO L225 Difference]: With dead ends: 894 [2019-09-09 05:55:06,138 INFO L226 Difference]: Without dead ends: 894 [2019-09-09 05:55:06,138 INFO L628 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-09 05:55:06,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-09-09 05:55:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 828. [2019-09-09 05:55:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-09 05:55:06,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1222 transitions. [2019-09-09 05:55:06,151 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1222 transitions. Word has length 159 [2019-09-09 05:55:06,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:06,151 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1222 transitions. [2019-09-09 05:55:06,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:06,151 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1222 transitions. [2019-09-09 05:55:06,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-09 05:55:06,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:06,154 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1] [2019-09-09 05:55:06,154 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:06,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:06,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1431644277, now seen corresponding path program 1 times [2019-09-09 05:55:06,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:06,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:06,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:06,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:06,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:06,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:06,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:06,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:06,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:06,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:06,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:06,243 INFO L87 Difference]: Start difference. First operand 828 states and 1222 transitions. Second operand 4 states. [2019-09-09 05:55:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:06,582 INFO L93 Difference]: Finished difference Result 894 states and 1318 transitions. [2019-09-09 05:55:06,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:06,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-09 05:55:06,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:06,588 INFO L225 Difference]: With dead ends: 894 [2019-09-09 05:55:06,588 INFO L226 Difference]: Without dead ends: 894 [2019-09-09 05:55:06,588 INFO L628 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-09 05:55:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-09-09 05:55:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 828. [2019-09-09 05:55:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-09 05:55:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1219 transitions. [2019-09-09 05:55:06,601 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1219 transitions. Word has length 163 [2019-09-09 05:55:06,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:06,601 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1219 transitions. [2019-09-09 05:55:06,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:06,602 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1219 transitions. [2019-09-09 05:55:06,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-09 05:55:06,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:06,604 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1] [2019-09-09 05:55:06,604 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:06,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:06,605 INFO L82 PathProgramCache]: Analyzing trace with hash -172312564, now seen corresponding path program 1 times [2019-09-09 05:55:06,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:06,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:06,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:06,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:06,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:06,706 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:06,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:06,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:06,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:06,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:06,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:06,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:06,708 INFO L87 Difference]: Start difference. First operand 828 states and 1219 transitions. Second operand 4 states. [2019-09-09 05:55:07,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:07,111 INFO L93 Difference]: Finished difference Result 879 states and 1294 transitions. [2019-09-09 05:55:07,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:07,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-09 05:55:07,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:07,117 INFO L225 Difference]: With dead ends: 879 [2019-09-09 05:55:07,117 INFO L226 Difference]: Without dead ends: 879 [2019-09-09 05:55:07,119 INFO L628 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-09 05:55:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-09-09 05:55:07,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 828. [2019-09-09 05:55:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-09 05:55:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1216 transitions. [2019-09-09 05:55:07,138 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1216 transitions. Word has length 164 [2019-09-09 05:55:07,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:07,138 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1216 transitions. [2019-09-09 05:55:07,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:07,139 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1216 transitions. [2019-09-09 05:55:07,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-09 05:55:07,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:07,142 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:07,142 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:07,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:07,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1392588597, now seen corresponding path program 1 times [2019-09-09 05:55:07,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:07,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:07,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:07,260 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-09 05:55:07,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:07,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:07,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:07,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:07,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:07,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:07,263 INFO L87 Difference]: Start difference. First operand 828 states and 1216 transitions. Second operand 3 states. [2019-09-09 05:55:07,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:07,348 INFO L93 Difference]: Finished difference Result 1095 states and 1609 transitions. [2019-09-09 05:55:07,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:07,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-09 05:55:07,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:07,354 INFO L225 Difference]: With dead ends: 1095 [2019-09-09 05:55:07,355 INFO L226 Difference]: Without dead ends: 1095 [2019-09-09 05:55:07,355 INFO L628 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-09 05:55:07,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2019-09-09 05:55:07,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1095. [2019-09-09 05:55:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2019-09-09 05:55:07,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1609 transitions. [2019-09-09 05:55:07,378 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1609 transitions. Word has length 166 [2019-09-09 05:55:07,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:07,379 INFO L475 AbstractCegarLoop]: Abstraction has 1095 states and 1609 transitions. [2019-09-09 05:55:07,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:07,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1609 transitions. [2019-09-09 05:55:07,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-09 05:55:07,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:07,383 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:07,384 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:07,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:07,384 INFO L82 PathProgramCache]: Analyzing trace with hash 226717446, now seen corresponding path program 1 times [2019-09-09 05:55:07,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:07,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:07,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:55:07,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:07,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:07,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:07,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:07,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:07,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:07,482 INFO L87 Difference]: Start difference. First operand 1095 states and 1609 transitions. Second operand 3 states. [2019-09-09 05:55:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:07,550 INFO L93 Difference]: Finished difference Result 1362 states and 2003 transitions. [2019-09-09 05:55:07,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:07,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-09 05:55:07,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:07,556 INFO L225 Difference]: With dead ends: 1362 [2019-09-09 05:55:07,557 INFO L226 Difference]: Without dead ends: 1362 [2019-09-09 05:55:07,559 INFO L628 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-09 05:55:07,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2019-09-09 05:55:07,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2019-09-09 05:55:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-09-09 05:55:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2003 transitions. [2019-09-09 05:55:07,579 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 2003 transitions. Word has length 172 [2019-09-09 05:55:07,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:07,579 INFO L475 AbstractCegarLoop]: Abstraction has 1362 states and 2003 transitions. [2019-09-09 05:55:07,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2003 transitions. [2019-09-09 05:55:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-09 05:55:07,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:07,583 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:07,583 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:07,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:07,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2083706138, now seen corresponding path program 1 times [2019-09-09 05:55:07,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:07,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:07,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-09 05:55:07,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:07,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:07,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:07,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:07,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:07,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:07,686 INFO L87 Difference]: Start difference. First operand 1362 states and 2003 transitions. Second operand 3 states. [2019-09-09 05:55:07,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:07,765 INFO L93 Difference]: Finished difference Result 1629 states and 2398 transitions. [2019-09-09 05:55:07,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:07,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-09 05:55:07,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:07,774 INFO L225 Difference]: With dead ends: 1629 [2019-09-09 05:55:07,775 INFO L226 Difference]: Without dead ends: 1629 [2019-09-09 05:55:07,775 INFO L628 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-09 05:55:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-09-09 05:55:07,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2019-09-09 05:55:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1629 states. [2019-09-09 05:55:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2398 transitions. [2019-09-09 05:55:07,804 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2398 transitions. Word has length 204 [2019-09-09 05:55:07,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:07,805 INFO L475 AbstractCegarLoop]: Abstraction has 1629 states and 2398 transitions. [2019-09-09 05:55:07,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:07,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2398 transitions. [2019-09-09 05:55:07,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-09 05:55:07,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:07,810 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:07,811 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:07,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:07,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1039409924, now seen corresponding path program 1 times [2019-09-09 05:55:07,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:07,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:07,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-09 05:55:07,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:07,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:07,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:07,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:07,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:07,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:07,940 INFO L87 Difference]: Start difference. First operand 1629 states and 2398 transitions. Second operand 3 states. [2019-09-09 05:55:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:08,022 INFO L93 Difference]: Finished difference Result 1896 states and 2794 transitions. [2019-09-09 05:55:08,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:08,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-09-09 05:55:08,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:08,047 INFO L225 Difference]: With dead ends: 1896 [2019-09-09 05:55:08,047 INFO L226 Difference]: Without dead ends: 1896 [2019-09-09 05:55:08,048 INFO L628 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-09 05:55:08,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-09-09 05:55:08,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1896. [2019-09-09 05:55:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-09-09 05:55:08,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2794 transitions. [2019-09-09 05:55:08,120 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2794 transitions. Word has length 206 [2019-09-09 05:55:08,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:08,120 INFO L475 AbstractCegarLoop]: Abstraction has 1896 states and 2794 transitions. [2019-09-09 05:55:08,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:08,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2794 transitions. [2019-09-09 05:55:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-09 05:55:08,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:08,125 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:08,125 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:08,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:08,126 INFO L82 PathProgramCache]: Analyzing trace with hash -258662525, now seen corresponding path program 1 times [2019-09-09 05:55:08,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:08,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:08,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-09 05:55:08,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:08,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:08,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:08,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:08,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:08,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:08,242 INFO L87 Difference]: Start difference. First operand 1896 states and 2794 transitions. Second operand 3 states. [2019-09-09 05:55:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:08,319 INFO L93 Difference]: Finished difference Result 2163 states and 3191 transitions. [2019-09-09 05:55:08,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:08,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-09 05:55:08,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:08,325 INFO L225 Difference]: With dead ends: 2163 [2019-09-09 05:55:08,325 INFO L226 Difference]: Without dead ends: 2163 [2019-09-09 05:55:08,326 INFO L628 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-09 05:55:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2019-09-09 05:55:08,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 2163. [2019-09-09 05:55:08,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2163 states. [2019-09-09 05:55:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3191 transitions. [2019-09-09 05:55:08,356 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3191 transitions. Word has length 239 [2019-09-09 05:55:08,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:08,356 INFO L475 AbstractCegarLoop]: Abstraction has 2163 states and 3191 transitions. [2019-09-09 05:55:08,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3191 transitions. [2019-09-09 05:55:08,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-09 05:55:08,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:08,362 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:08,362 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:08,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:08,363 INFO L82 PathProgramCache]: Analyzing trace with hash -445467436, now seen corresponding path program 1 times [2019-09-09 05:55:08,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:08,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:08,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-09 05:55:08,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:08,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:08,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:08,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:08,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:08,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:08,491 INFO L87 Difference]: Start difference. First operand 2163 states and 3191 transitions. Second operand 3 states. [2019-09-09 05:55:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:08,564 INFO L93 Difference]: Finished difference Result 2424 states and 3572 transitions. [2019-09-09 05:55:08,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:08,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-09-09 05:55:08,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:08,572 INFO L225 Difference]: With dead ends: 2424 [2019-09-09 05:55:08,572 INFO L226 Difference]: Without dead ends: 2424 [2019-09-09 05:55:08,572 INFO L628 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-09 05:55:08,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2019-09-09 05:55:08,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2424. [2019-09-09 05:55:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2424 states. [2019-09-09 05:55:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 3572 transitions. [2019-09-09 05:55:08,600 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 3572 transitions. Word has length 274 [2019-09-09 05:55:08,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:08,600 INFO L475 AbstractCegarLoop]: Abstraction has 2424 states and 3572 transitions. [2019-09-09 05:55:08,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:08,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 3572 transitions. [2019-09-09 05:55:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-09 05:55:08,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:08,605 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:08,606 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:08,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:08,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1783136205, now seen corresponding path program 1 times [2019-09-09 05:55:08,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:08,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:08,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:08,789 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2019-09-09 05:55:08,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:08,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:08,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:08,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:08,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:08,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:08,791 INFO L87 Difference]: Start difference. First operand 2424 states and 3572 transitions. Second operand 3 states. [2019-09-09 05:55:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:08,868 INFO L93 Difference]: Finished difference Result 2691 states and 3971 transitions. [2019-09-09 05:55:08,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:08,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-09-09 05:55:08,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:08,876 INFO L225 Difference]: With dead ends: 2691 [2019-09-09 05:55:08,876 INFO L226 Difference]: Without dead ends: 2691 [2019-09-09 05:55:08,876 INFO L628 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-09 05:55:08,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2019-09-09 05:55:08,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 2691. [2019-09-09 05:55:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2691 states. [2019-09-09 05:55:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 3971 transitions. [2019-09-09 05:55:08,908 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 3971 transitions. Word has length 313 [2019-09-09 05:55:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:08,909 INFO L475 AbstractCegarLoop]: Abstraction has 2691 states and 3971 transitions. [2019-09-09 05:55:08,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 3971 transitions. [2019-09-09 05:55:08,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-09-09 05:55:08,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:08,915 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:08,915 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:08,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:08,916 INFO L82 PathProgramCache]: Analyzing trace with hash 855948233, now seen corresponding path program 1 times [2019-09-09 05:55:08,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:08,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:08,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:09,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2019-09-09 05:55:09,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:09,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:09,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:09,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:09,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:09,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:09,085 INFO L87 Difference]: Start difference. First operand 2691 states and 3971 transitions. Second operand 3 states. [2019-09-09 05:55:09,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:09,176 INFO L93 Difference]: Finished difference Result 2958 states and 4371 transitions. [2019-09-09 05:55:09,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:09,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 354 [2019-09-09 05:55:09,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:09,182 INFO L225 Difference]: With dead ends: 2958 [2019-09-09 05:55:09,182 INFO L226 Difference]: Without dead ends: 2958 [2019-09-09 05:55:09,182 INFO L628 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-09 05:55:09,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2019-09-09 05:55:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2958. [2019-09-09 05:55:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2958 states. [2019-09-09 05:55:09,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 4371 transitions. [2019-09-09 05:55:09,219 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 4371 transitions. Word has length 354 [2019-09-09 05:55:09,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:09,219 INFO L475 AbstractCegarLoop]: Abstraction has 2958 states and 4371 transitions. [2019-09-09 05:55:09,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 4371 transitions. [2019-09-09 05:55:09,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-09 05:55:09,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:09,227 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 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-09 05:55:09,227 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:09,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:09,227 INFO L82 PathProgramCache]: Analyzing trace with hash 827999181, now seen corresponding path program 1 times [2019-09-09 05:55:09,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:09,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:09,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:09,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:09,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-09-09 05:55:09,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:09,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:09,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:09,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:09,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:09,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:09,490 INFO L87 Difference]: Start difference. First operand 2958 states and 4371 transitions. Second operand 3 states. [2019-09-09 05:55:09,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:09,565 INFO L93 Difference]: Finished difference Result 3220 states and 4753 transitions. [2019-09-09 05:55:09,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:09,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 397 [2019-09-09 05:55:09,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:09,576 INFO L225 Difference]: With dead ends: 3220 [2019-09-09 05:55:09,576 INFO L226 Difference]: Without dead ends: 3220 [2019-09-09 05:55:09,576 INFO L628 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-09 05:55:09,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3220 states. [2019-09-09 05:55:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3220 to 3220. [2019-09-09 05:55:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3220 states. [2019-09-09 05:55:09,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3220 states to 3220 states and 4753 transitions. [2019-09-09 05:55:09,614 INFO L78 Accepts]: Start accepts. Automaton has 3220 states and 4753 transitions. Word has length 397 [2019-09-09 05:55:09,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:09,615 INFO L475 AbstractCegarLoop]: Abstraction has 3220 states and 4753 transitions. [2019-09-09 05:55:09,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:09,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3220 states and 4753 transitions. [2019-09-09 05:55:09,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-09-09 05:55:09,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:09,626 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:09,626 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:09,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:09,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2140402930, now seen corresponding path program 1 times [2019-09-09 05:55:09,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:09,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:09,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:09,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:09,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:09,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2019-09-09 05:55:09,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:09,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:09,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:09,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:09,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:09,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:09,865 INFO L87 Difference]: Start difference. First operand 3220 states and 4753 transitions. Second operand 3 states. [2019-09-09 05:55:09,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:09,945 INFO L93 Difference]: Finished difference Result 3487 states and 5155 transitions. [2019-09-09 05:55:09,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:09,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-09-09 05:55:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:09,954 INFO L225 Difference]: With dead ends: 3487 [2019-09-09 05:55:09,954 INFO L226 Difference]: Without dead ends: 3487 [2019-09-09 05:55:09,955 INFO L628 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-09 05:55:09,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2019-09-09 05:55:09,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 3487. [2019-09-09 05:55:09,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3487 states. [2019-09-09 05:55:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3487 states to 3487 states and 5155 transitions. [2019-09-09 05:55:09,999 INFO L78 Accepts]: Start accepts. Automaton has 3487 states and 5155 transitions. Word has length 437 [2019-09-09 05:55:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:10,000 INFO L475 AbstractCegarLoop]: Abstraction has 3487 states and 5155 transitions. [2019-09-09 05:55:10,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:10,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3487 states and 5155 transitions. [2019-09-09 05:55:10,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-09-09 05:55:10,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:10,011 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 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, 1, 1, 1, 1, 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-09 05:55:10,011 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:10,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:10,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1282909427, now seen corresponding path program 1 times [2019-09-09 05:55:10,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:10,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:10,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:10,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:10,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2130 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 1772 trivial. 0 not checked. [2019-09-09 05:55:10,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:10,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:10,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:10,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:10,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:10,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:10,357 INFO L87 Difference]: Start difference. First operand 3487 states and 5155 transitions. Second operand 3 states. [2019-09-09 05:55:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:10,438 INFO L93 Difference]: Finished difference Result 3754 states and 5558 transitions. [2019-09-09 05:55:10,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:10,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 479 [2019-09-09 05:55:10,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:10,447 INFO L225 Difference]: With dead ends: 3754 [2019-09-09 05:55:10,448 INFO L226 Difference]: Without dead ends: 3754 [2019-09-09 05:55:10,448 INFO L628 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-09 05:55:10,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2019-09-09 05:55:10,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 3754. [2019-09-09 05:55:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3754 states. [2019-09-09 05:55:10,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3754 states and 5558 transitions. [2019-09-09 05:55:10,498 INFO L78 Accepts]: Start accepts. Automaton has 3754 states and 5558 transitions. Word has length 479 [2019-09-09 05:55:10,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:10,499 INFO L475 AbstractCegarLoop]: Abstraction has 3754 states and 5558 transitions. [2019-09-09 05:55:10,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:10,499 INFO L276 IsEmpty]: Start isEmpty. Operand 3754 states and 5558 transitions. [2019-09-09 05:55:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2019-09-09 05:55:10,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:10,509 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:10,509 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:10,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:10,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1281015599, now seen corresponding path program 1 times [2019-09-09 05:55:10,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:10,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:10,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:10,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:10,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:10,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1047 proven. 0 refuted. 0 times theorem prover too weak. 1481 trivial. 0 not checked. [2019-09-09 05:55:10,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:10,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:10,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:10,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:10,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:10,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:10,942 INFO L87 Difference]: Start difference. First operand 3754 states and 5558 transitions. Second operand 4 states. [2019-09-09 05:55:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:11,421 INFO L93 Difference]: Finished difference Result 5247 states and 7815 transitions. [2019-09-09 05:55:11,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:11,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 523 [2019-09-09 05:55:11,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:11,432 INFO L225 Difference]: With dead ends: 5247 [2019-09-09 05:55:11,432 INFO L226 Difference]: Without dead ends: 5247 [2019-09-09 05:55:11,433 INFO L628 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-09 05:55:11,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5247 states. [2019-09-09 05:55:11,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5247 to 4328. [2019-09-09 05:55:11,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4328 states. [2019-09-09 05:55:11,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4328 states to 4328 states and 6608 transitions. [2019-09-09 05:55:11,492 INFO L78 Accepts]: Start accepts. Automaton has 4328 states and 6608 transitions. Word has length 523 [2019-09-09 05:55:11,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:11,493 INFO L475 AbstractCegarLoop]: Abstraction has 4328 states and 6608 transitions. [2019-09-09 05:55:11,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:11,493 INFO L276 IsEmpty]: Start isEmpty. Operand 4328 states and 6608 transitions. [2019-09-09 05:55:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2019-09-09 05:55:11,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:11,507 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:11,507 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:11,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:11,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1530470707, now seen corresponding path program 1 times [2019-09-09 05:55:11,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:11,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:11,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:11,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:11,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1409 proven. 81 refuted. 0 times theorem prover too weak. 1038 trivial. 0 not checked. [2019-09-09 05:55:12,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:55:12,203 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:55:12,204 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 524 with the following transitions: [2019-09-09 05:55:12,205 INFO L207 CegarAbsIntRunner]: [0], [43], [48], [50], [61], [63], [67], [76], [78], [83], [88], [93], [98], [103], [108], [113], [118], [121], [123], [128], [133], [136], [138], [143], [146], [148], [153], [156], [158], [163], [166], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [213], [218], [221], [223], [228], [231], [233], [238], [241], [312], [315], [323], [325], [328], [336], [341], [343], [345], [350], [353], [361], [363], [365], [368], [372], [375], [404], [407], [415], [425], [427], [430], [441], [443], [453], [455], [458], [466], [492], [495], [503], [508], [511], [519], [522], [525], [533], [535], [538], [546], [548], [551], [553], [556], [558], [561], [569], [574], [576], [578], [583], [586], [588], [591], [599], [604], [606], [609], [611], [614], [622], [625], [629], [650], [684], [686], [698], [701], [702], [714], [722], [723], [724] [2019-09-09 05:55:12,255 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:55:12,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:55:12,315 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:55:12,318 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-09 05:55:12,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:12,322 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:55:12,497 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-09 05:55:12,497 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:55:12,516 INFO L420 sIntCurrentIteration]: We unified 522 AI predicates to 522 [2019-09-09 05:55:12,516 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:55:12,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:55:12,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2019-09-09 05:55:12,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:12,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-09 05:55:12,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-09 05:55:12,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:55:12,522 INFO L87 Difference]: Start difference. First operand 4328 states and 6608 transitions. Second operand 2 states. [2019-09-09 05:55:12,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:12,522 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-09 05:55:12,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-09 05:55:12,522 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 523 [2019-09-09 05:55:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:12,523 INFO L225 Difference]: With dead ends: 2 [2019-09-09 05:55:12,523 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:55:12,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:55:12,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:55:12,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:55:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:55:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:55:12,524 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 523 [2019-09-09 05:55:12,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:12,524 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:55:12,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-09 05:55:12,524 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:55:12,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:55:12,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:55:12 BoogieIcfgContainer [2019-09-09 05:55:12,531 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:55:12,535 INFO L168 Benchmark]: Toolchain (without parser) took 30113.83 ms. Allocated memory was 143.1 MB in the beginning and 705.7 MB in the end (delta: 562.6 MB). Free memory was 88.9 MB in the beginning and 351.4 MB in the end (delta: -262.4 MB). Peak memory consumption was 300.1 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:12,537 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 143.1 MB. Free memory was 109.2 MB in the beginning and 109.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:55:12,537 INFO L168 Benchmark]: CACSL2BoogieTranslator took 885.26 ms. Allocated memory was 143.1 MB in the beginning and 203.4 MB in the end (delta: 60.3 MB). Free memory was 88.7 MB in the beginning and 161.4 MB in the end (delta: -72.6 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:12,538 INFO L168 Benchmark]: Boogie Preprocessor took 255.24 ms. Allocated memory is still 203.4 MB. Free memory was 161.4 MB in the beginning and 153.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:12,540 INFO L168 Benchmark]: RCFGBuilder took 1747.81 ms. Allocated memory was 203.4 MB in the beginning and 234.4 MB in the end (delta: 30.9 MB). Free memory was 153.4 MB in the beginning and 170.2 MB in the end (delta: -16.8 MB). Peak memory consumption was 76.5 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:12,547 INFO L168 Benchmark]: TraceAbstraction took 27221.37 ms. Allocated memory was 234.4 MB in the beginning and 705.7 MB in the end (delta: 471.3 MB). Free memory was 170.2 MB in the beginning and 351.4 MB in the end (delta: -181.2 MB). Peak memory consumption was 290.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:12,557 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 143.1 MB. Free memory was 109.2 MB in the beginning and 109.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 885.26 ms. Allocated memory was 143.1 MB in the beginning and 203.4 MB in the end (delta: 60.3 MB). Free memory was 88.7 MB in the beginning and 161.4 MB in the end (delta: -72.6 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 255.24 ms. Allocated memory is still 203.4 MB. Free memory was 161.4 MB in the beginning and 153.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1747.81 ms. Allocated memory was 203.4 MB in the beginning and 234.4 MB in the end (delta: 30.9 MB). Free memory was 153.4 MB in the beginning and 170.2 MB in the end (delta: -16.8 MB). Peak memory consumption was 76.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27221.37 ms. Allocated memory was 234.4 MB in the beginning and 705.7 MB in the end (delta: 471.3 MB). Free memory was 170.2 MB in the beginning and 351.4 MB in the end (delta: -181.2 MB). Peak memory consumption was 290.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1754]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 192 locations, 1 error locations. SAFE Result, 27.1s OverallTime, 61 OverallIterations, 15 TraceHistogramMax, 17.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13721 SDtfs, 4817 SDslu, 17613 SDs, 0 SdLazy, 9653 SolverSat, 640 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 842 GetRequests, 656 SyntacticMatches, 37 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4328occurred in iteration=60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.160919540229885 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 61 MinimizatonAttempts, 2807 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 9152 NumberOfCodeBlocks, 9152 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 9091 ConstructedInterpolants, 0 QuantifiedInterpolants, 4084195 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 61 InterpolantComputations, 60 PerfectInterpolantSequences, 18425/18506 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...