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.10.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:38,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:38,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:38,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:38,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:38,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:38,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:38,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:38,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:38,413 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:38,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:38,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:38,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:38,417 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:38,418 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:38,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:38,420 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:38,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:38,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:38,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:38,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:38,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:38,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:38,429 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:38,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:38,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:38,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:38,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:38,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:38,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:38,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:38,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:38,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:38,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:38,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:38,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:38,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:38,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:38,439 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:38,440 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:38,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:38,442 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:27:38,457 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:38,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:38,458 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:38,458 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:38,459 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:38,459 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:38,459 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:38,459 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:38,460 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:38,460 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:38,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:38,461 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:38,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:38,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:38,462 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:38,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:38,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:38,462 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:38,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:38,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:38,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:38,463 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:38,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:38,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:38,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:38,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:38,464 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:38,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:38,465 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:38,465 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:38,494 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:38,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:38,512 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:38,514 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:38,514 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:38,515 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.10.i.cil-2.c [2019-09-20 13:27:38,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1b25927c/4245fae5a3b34ca3a5d3d25913795060/FLAGf46640d22 [2019-09-20 13:27:39,268 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:39,269 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.10.i.cil-2.c [2019-09-20 13:27:39,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1b25927c/4245fae5a3b34ca3a5d3d25913795060/FLAGf46640d22 [2019-09-20 13:27:39,390 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1b25927c/4245fae5a3b34ca3a5d3d25913795060 [2019-09-20 13:27:39,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:39,412 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:39,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:39,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:39,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:39,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:39" (1/1) ... [2019-09-20 13:27:39,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1461b8e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:39, skipping insertion in model container [2019-09-20 13:27:39,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:39" (1/1) ... [2019-09-20 13:27:39,437 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:39,519 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:40,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:40,151 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:40,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:40,387 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:40,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40 WrapperNode [2019-09-20 13:27:40,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:40,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:40,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:40,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:40,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40" (1/1) ... [2019-09-20 13:27:40,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40" (1/1) ... [2019-09-20 13:27:40,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40" (1/1) ... [2019-09-20 13:27:40,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40" (1/1) ... [2019-09-20 13:27:40,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40" (1/1) ... [2019-09-20 13:27:40,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40" (1/1) ... [2019-09-20 13:27:40,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40" (1/1) ... [2019-09-20 13:27:40,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:40,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:40,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:40,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:40,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:40,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:40,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:40,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:27:40,675 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:27:40,675 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:40,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:27:40,676 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:40,676 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:40,676 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:40,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:40,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:40,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:40,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:40,680 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:40,680 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:27:40,681 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:40,681 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:27:40,681 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:27:40,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:40,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:40,682 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:40,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:40,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:40,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:40,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:40,683 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:40,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:40,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:40,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:40,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:40,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:40,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:40,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:40,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:40,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:40,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:41,154 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:42,087 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:27:42,087 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:27:42,121 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:42,121 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:42,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:42 BoogieIcfgContainer [2019-09-20 13:27:42,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:42,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:42,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:42,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:42,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:39" (1/3) ... [2019-09-20 13:27:42,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c563885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:42, skipping insertion in model container [2019-09-20 13:27:42,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40" (2/3) ... [2019-09-20 13:27:42,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c563885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:42, skipping insertion in model container [2019-09-20 13:27:42,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:42" (3/3) ... [2019-09-20 13:27:42,135 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-2.c [2019-09-20 13:27:42,148 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:42,162 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:42,184 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:42,221 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:42,222 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:42,222 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:42,222 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:42,222 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:42,222 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:42,223 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:42,223 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:42,252 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-09-20 13:27:42,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-20 13:27:42,270 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:42,271 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:42,276 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:42,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:42,282 INFO L82 PathProgramCache]: Analyzing trace with hash 345716245, now seen corresponding path program 1 times [2019-09-20 13:27:42,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:42,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:42,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:42,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:42,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:42,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:42,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:42,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:42,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:42,704 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 4 states. [2019-09-20 13:27:43,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:43,171 INFO L93 Difference]: Finished difference Result 187 states and 304 transitions. [2019-09-20 13:27:43,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:43,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-09-20 13:27:43,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:43,200 INFO L225 Difference]: With dead ends: 187 [2019-09-20 13:27:43,200 INFO L226 Difference]: Without dead ends: 166 [2019-09-20 13:27:43,204 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:43,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-20 13:27:43,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2019-09-20 13:27:43,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-20 13:27:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 226 transitions. [2019-09-20 13:27:43,291 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 226 transitions. Word has length 47 [2019-09-20 13:27:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:43,291 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 226 transitions. [2019-09-20 13:27:43,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:43,292 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 226 transitions. [2019-09-20 13:27:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 13:27:43,297 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:43,299 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:43,299 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:43,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:43,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1955407513, now seen corresponding path program 1 times [2019-09-20 13:27:43,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:43,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:43,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:43,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:43,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:43,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:43,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:43,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:43,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:43,509 INFO L87 Difference]: Start difference. First operand 149 states and 226 transitions. Second operand 4 states. [2019-09-20 13:27:43,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:43,941 INFO L93 Difference]: Finished difference Result 166 states and 246 transitions. [2019-09-20 13:27:43,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:43,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-09-20 13:27:43,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:43,944 INFO L225 Difference]: With dead ends: 166 [2019-09-20 13:27:43,945 INFO L226 Difference]: Without dead ends: 166 [2019-09-20 13:27:43,946 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:43,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-20 13:27:43,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2019-09-20 13:27:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-20 13:27:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 225 transitions. [2019-09-20 13:27:43,956 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 225 transitions. Word has length 60 [2019-09-20 13:27:43,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:43,957 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 225 transitions. [2019-09-20 13:27:43,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:43,957 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 225 transitions. [2019-09-20 13:27:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-20 13:27:43,959 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:43,960 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:43,960 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:43,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:43,961 INFO L82 PathProgramCache]: Analyzing trace with hash -68451969, now seen corresponding path program 1 times [2019-09-20 13:27:43,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:43,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:43,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:44,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:44,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:44,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:44,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:44,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:44,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:44,068 INFO L87 Difference]: Start difference. First operand 149 states and 225 transitions. Second operand 4 states. [2019-09-20 13:27:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:44,392 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2019-09-20 13:27:44,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:44,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-09-20 13:27:44,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:44,395 INFO L225 Difference]: With dead ends: 165 [2019-09-20 13:27:44,395 INFO L226 Difference]: Without dead ends: 165 [2019-09-20 13:27:44,396 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:44,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-20 13:27:44,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2019-09-20 13:27:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-20 13:27:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2019-09-20 13:27:44,405 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 61 [2019-09-20 13:27:44,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:44,406 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2019-09-20 13:27:44,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:44,406 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2019-09-20 13:27:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-20 13:27:44,408 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:44,408 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:44,409 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:44,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:44,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1072073965, now seen corresponding path program 1 times [2019-09-20 13:27:44,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:44,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:44,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:44,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:44,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:44,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:27:44,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:44,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:27:44,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:27:44,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:44,530 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand 5 states. [2019-09-20 13:27:45,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:45,024 INFO L93 Difference]: Finished difference Result 170 states and 252 transitions. [2019-09-20 13:27:45,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:45,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-20 13:27:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:45,026 INFO L225 Difference]: With dead ends: 170 [2019-09-20 13:27:45,026 INFO L226 Difference]: Without dead ends: 170 [2019-09-20 13:27:45,027 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:27:45,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-20 13:27:45,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-09-20 13:27:45,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-20 13:27:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 251 transitions. [2019-09-20 13:27:45,036 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 251 transitions. Word has length 61 [2019-09-20 13:27:45,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:45,036 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 251 transitions. [2019-09-20 13:27:45,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:27:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 251 transitions. [2019-09-20 13:27:45,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-20 13:27:45,038 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:45,039 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:45,039 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:45,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:45,039 INFO L82 PathProgramCache]: Analyzing trace with hash 958204619, now seen corresponding path program 1 times [2019-09-20 13:27:45,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:45,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:45,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:45,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:45,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:45,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:45,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:45,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:45,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:45,118 INFO L87 Difference]: Start difference. First operand 169 states and 251 transitions. Second operand 4 states. [2019-09-20 13:27:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:45,453 INFO L93 Difference]: Finished difference Result 184 states and 268 transitions. [2019-09-20 13:27:45,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:45,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-09-20 13:27:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:45,455 INFO L225 Difference]: With dead ends: 184 [2019-09-20 13:27:45,455 INFO L226 Difference]: Without dead ends: 184 [2019-09-20 13:27:45,455 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:45,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-20 13:27:45,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 169. [2019-09-20 13:27:45,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-20 13:27:45,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 250 transitions. [2019-09-20 13:27:45,462 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 250 transitions. Word has length 61 [2019-09-20 13:27:45,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:45,463 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 250 transitions. [2019-09-20 13:27:45,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:45,463 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 250 transitions. [2019-09-20 13:27:45,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-20 13:27:45,464 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:45,465 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:45,466 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:45,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:45,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1678734262, now seen corresponding path program 1 times [2019-09-20 13:27:45,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:45,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:45,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:45,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:45,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:45,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:45,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:45,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:45,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:45,577 INFO L87 Difference]: Start difference. First operand 169 states and 250 transitions. Second operand 4 states. [2019-09-20 13:27:45,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:45,864 INFO L93 Difference]: Finished difference Result 182 states and 265 transitions. [2019-09-20 13:27:45,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:45,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-09-20 13:27:45,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:45,869 INFO L225 Difference]: With dead ends: 182 [2019-09-20 13:27:45,869 INFO L226 Difference]: Without dead ends: 182 [2019-09-20 13:27:45,869 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:45,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-20 13:27:45,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 169. [2019-09-20 13:27:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-20 13:27:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 249 transitions. [2019-09-20 13:27:45,877 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 249 transitions. Word has length 61 [2019-09-20 13:27:45,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:45,877 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 249 transitions. [2019-09-20 13:27:45,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:45,878 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 249 transitions. [2019-09-20 13:27:45,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:27:45,881 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:45,882 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:45,882 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:45,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:45,882 INFO L82 PathProgramCache]: Analyzing trace with hash -636130140, now seen corresponding path program 1 times [2019-09-20 13:27:45,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:45,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:45,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:46,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:46,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:46,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:46,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:46,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:46,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:46,028 INFO L87 Difference]: Start difference. First operand 169 states and 249 transitions. Second operand 4 states. [2019-09-20 13:27:46,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:46,313 INFO L93 Difference]: Finished difference Result 182 states and 264 transitions. [2019-09-20 13:27:46,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:46,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-20 13:27:46,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:46,315 INFO L225 Difference]: With dead ends: 182 [2019-09-20 13:27:46,315 INFO L226 Difference]: Without dead ends: 182 [2019-09-20 13:27:46,316 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:46,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-20 13:27:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 169. [2019-09-20 13:27:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-20 13:27:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 248 transitions. [2019-09-20 13:27:46,320 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 248 transitions. Word has length 62 [2019-09-20 13:27:46,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:46,321 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 248 transitions. [2019-09-20 13:27:46,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 248 transitions. [2019-09-20 13:27:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:46,322 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:46,322 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:46,322 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:46,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:46,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1324278791, now seen corresponding path program 1 times [2019-09-20 13:27:46,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:46,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:46,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:46,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:46,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:46,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:46,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:46,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:46,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:46,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:46,379 INFO L87 Difference]: Start difference. First operand 169 states and 248 transitions. Second operand 4 states. [2019-09-20 13:27:46,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:46,646 INFO L93 Difference]: Finished difference Result 182 states and 263 transitions. [2019-09-20 13:27:46,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:46,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:27:46,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:46,648 INFO L225 Difference]: With dead ends: 182 [2019-09-20 13:27:46,649 INFO L226 Difference]: Without dead ends: 182 [2019-09-20 13:27:46,649 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:46,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-20 13:27:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 169. [2019-09-20 13:27:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-20 13:27:46,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 247 transitions. [2019-09-20 13:27:46,655 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 247 transitions. Word has length 63 [2019-09-20 13:27:46,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:46,655 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 247 transitions. [2019-09-20 13:27:46,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 247 transitions. [2019-09-20 13:27:46,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:46,657 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:46,657 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:46,657 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:46,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:46,657 INFO L82 PathProgramCache]: Analyzing trace with hash 345644319, now seen corresponding path program 1 times [2019-09-20 13:27:46,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:46,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:46,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:46,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:46,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:46,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:46,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:46,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:46,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:46,741 INFO L87 Difference]: Start difference. First operand 169 states and 247 transitions. Second operand 4 states. [2019-09-20 13:27:47,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:47,026 INFO L93 Difference]: Finished difference Result 182 states and 262 transitions. [2019-09-20 13:27:47,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:47,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:47,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:47,028 INFO L225 Difference]: With dead ends: 182 [2019-09-20 13:27:47,028 INFO L226 Difference]: Without dead ends: 182 [2019-09-20 13:27:47,029 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:47,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-20 13:27:47,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 169. [2019-09-20 13:27:47,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-20 13:27:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 246 transitions. [2019-09-20 13:27:47,039 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 246 transitions. Word has length 64 [2019-09-20 13:27:47,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:47,040 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 246 transitions. [2019-09-20 13:27:47,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:47,047 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 246 transitions. [2019-09-20 13:27:47,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:47,049 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:47,050 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:47,050 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:47,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:47,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1491452098, now seen corresponding path program 1 times [2019-09-20 13:27:47,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:47,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:47,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:47,157 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:47,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:47,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:47,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:47,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:47,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:47,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:47,158 INFO L87 Difference]: Start difference. First operand 169 states and 246 transitions. Second operand 4 states. [2019-09-20 13:27:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:47,441 INFO L93 Difference]: Finished difference Result 211 states and 308 transitions. [2019-09-20 13:27:47,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:47,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:47,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:47,448 INFO L225 Difference]: With dead ends: 211 [2019-09-20 13:27:47,448 INFO L226 Difference]: Without dead ends: 211 [2019-09-20 13:27:47,449 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:47,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-20 13:27:47,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 191. [2019-09-20 13:27:47,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-20 13:27:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 283 transitions. [2019-09-20 13:27:47,455 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 283 transitions. Word has length 64 [2019-09-20 13:27:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:47,455 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 283 transitions. [2019-09-20 13:27:47,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 283 transitions. [2019-09-20 13:27:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:47,456 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:47,457 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:47,457 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:47,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:47,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1549022430, now seen corresponding path program 1 times [2019-09-20 13:27:47,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:47,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:47,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:47,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:47,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:47,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:47,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:47,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:47,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:47,510 INFO L87 Difference]: Start difference. First operand 191 states and 283 transitions. Second operand 4 states. [2019-09-20 13:27:47,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:47,744 INFO L93 Difference]: Finished difference Result 194 states and 286 transitions. [2019-09-20 13:27:47,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:47,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:47,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:47,746 INFO L225 Difference]: With dead ends: 194 [2019-09-20 13:27:47,746 INFO L226 Difference]: Without dead ends: 194 [2019-09-20 13:27:47,747 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:47,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-20 13:27:47,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-09-20 13:27:47,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-20 13:27:47,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 282 transitions. [2019-09-20 13:27:47,752 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 282 transitions. Word has length 65 [2019-09-20 13:27:47,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:47,753 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 282 transitions. [2019-09-20 13:27:47,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:47,753 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 282 transitions. [2019-09-20 13:27:47,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:27:47,754 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:47,754 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:47,754 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:47,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:47,755 INFO L82 PathProgramCache]: Analyzing trace with hash 938457822, now seen corresponding path program 1 times [2019-09-20 13:27:47,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:47,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:47,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:47,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:47,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:47,822 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:47,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:47,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:47,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:47,824 INFO L87 Difference]: Start difference. First operand 191 states and 282 transitions. Second operand 4 states. [2019-09-20 13:27:48,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:48,123 INFO L93 Difference]: Finished difference Result 211 states and 306 transitions. [2019-09-20 13:27:48,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:48,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:27:48,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:48,125 INFO L225 Difference]: With dead ends: 211 [2019-09-20 13:27:48,126 INFO L226 Difference]: Without dead ends: 211 [2019-09-20 13:27:48,127 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:48,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-20 13:27:48,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 191. [2019-09-20 13:27:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-20 13:27:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 281 transitions. [2019-09-20 13:27:48,133 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 281 transitions. Word has length 77 [2019-09-20 13:27:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:48,134 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 281 transitions. [2019-09-20 13:27:48,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:48,134 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 281 transitions. [2019-09-20 13:27:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:48,135 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:48,135 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:48,136 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:48,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:48,136 INFO L82 PathProgramCache]: Analyzing trace with hash 473716788, now seen corresponding path program 1 times [2019-09-20 13:27:48,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:48,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:48,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:48,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:48,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:48,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:48,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:48,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:48,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:48,195 INFO L87 Difference]: Start difference. First operand 191 states and 281 transitions. Second operand 4 states. [2019-09-20 13:27:48,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:48,522 INFO L93 Difference]: Finished difference Result 210 states and 304 transitions. [2019-09-20 13:27:48,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:48,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:48,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:48,524 INFO L225 Difference]: With dead ends: 210 [2019-09-20 13:27:48,524 INFO L226 Difference]: Without dead ends: 210 [2019-09-20 13:27:48,525 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:48,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-20 13:27:48,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 191. [2019-09-20 13:27:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-20 13:27:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 280 transitions. [2019-09-20 13:27:48,532 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 280 transitions. Word has length 78 [2019-09-20 13:27:48,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:48,532 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 280 transitions. [2019-09-20 13:27:48,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:48,532 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 280 transitions. [2019-09-20 13:27:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:48,534 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:48,534 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:48,534 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:48,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:48,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2131745203, now seen corresponding path program 1 times [2019-09-20 13:27:48,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:48,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:48,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:48,617 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:48,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:48,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:48,618 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:48,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:48,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:48,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:48,619 INFO L87 Difference]: Start difference. First operand 191 states and 280 transitions. Second operand 4 states. [2019-09-20 13:27:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:48,915 INFO L93 Difference]: Finished difference Result 208 states and 301 transitions. [2019-09-20 13:27:48,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:48,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:48,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:48,917 INFO L225 Difference]: With dead ends: 208 [2019-09-20 13:27:48,917 INFO L226 Difference]: Without dead ends: 208 [2019-09-20 13:27:48,917 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:48,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-20 13:27:48,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-09-20 13:27:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-20 13:27:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 279 transitions. [2019-09-20 13:27:48,924 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 279 transitions. Word has length 78 [2019-09-20 13:27:48,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:48,924 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 279 transitions. [2019-09-20 13:27:48,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:48,924 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 279 transitions. [2019-09-20 13:27:48,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:48,925 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:48,926 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:48,926 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:48,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:48,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1524616283, now seen corresponding path program 1 times [2019-09-20 13:27:48,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:48,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:48,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:49,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:49,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:49,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:49,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:49,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:49,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,013 INFO L87 Difference]: Start difference. First operand 191 states and 279 transitions. Second operand 4 states. [2019-09-20 13:27:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,306 INFO L93 Difference]: Finished difference Result 208 states and 300 transitions. [2019-09-20 13:27:49,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:49,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:49,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,308 INFO L225 Difference]: With dead ends: 208 [2019-09-20 13:27:49,308 INFO L226 Difference]: Without dead ends: 208 [2019-09-20 13:27:49,309 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-20 13:27:49,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-09-20 13:27:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-20 13:27:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 278 transitions. [2019-09-20 13:27:49,315 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 278 transitions. Word has length 79 [2019-09-20 13:27:49,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:49,315 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 278 transitions. [2019-09-20 13:27:49,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 278 transitions. [2019-09-20 13:27:49,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:49,316 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:49,316 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:49,317 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:49,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:49,317 INFO L82 PathProgramCache]: Analyzing trace with hash -412058832, now seen corresponding path program 1 times [2019-09-20 13:27:49,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:49,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:49,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:49,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:49,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:49,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:49,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:49,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:49,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,379 INFO L87 Difference]: Start difference. First operand 191 states and 278 transitions. Second operand 4 states. [2019-09-20 13:27:49,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,643 INFO L93 Difference]: Finished difference Result 208 states and 299 transitions. [2019-09-20 13:27:49,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:49,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:49,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,645 INFO L225 Difference]: With dead ends: 208 [2019-09-20 13:27:49,645 INFO L226 Difference]: Without dead ends: 208 [2019-09-20 13:27:49,645 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-20 13:27:49,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-09-20 13:27:49,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-20 13:27:49,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 277 transitions. [2019-09-20 13:27:49,651 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 277 transitions. Word has length 80 [2019-09-20 13:27:49,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:49,651 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 277 transitions. [2019-09-20 13:27:49,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 277 transitions. [2019-09-20 13:27:49,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:49,652 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:49,652 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:49,653 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:49,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:49,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1941214442, now seen corresponding path program 1 times [2019-09-20 13:27:49,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:49,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:49,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:49,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:49,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:49,702 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:49,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:49,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:49,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,703 INFO L87 Difference]: Start difference. First operand 191 states and 277 transitions. Second operand 4 states. [2019-09-20 13:27:50,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:50,034 INFO L93 Difference]: Finished difference Result 208 states and 298 transitions. [2019-09-20 13:27:50,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:50,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:50,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:50,037 INFO L225 Difference]: With dead ends: 208 [2019-09-20 13:27:50,037 INFO L226 Difference]: Without dead ends: 208 [2019-09-20 13:27:50,038 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:50,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-20 13:27:50,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-09-20 13:27:50,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-20 13:27:50,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 276 transitions. [2019-09-20 13:27:50,045 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 276 transitions. Word has length 81 [2019-09-20 13:27:50,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:50,046 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 276 transitions. [2019-09-20 13:27:50,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:50,046 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 276 transitions. [2019-09-20 13:27:50,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:27:50,048 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:50,048 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:50,049 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:50,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:50,049 INFO L82 PathProgramCache]: Analyzing trace with hash 572800011, now seen corresponding path program 1 times [2019-09-20 13:27:50,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:50,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:50,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:50,130 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:50,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:50,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:50,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:50,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:50,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:50,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:50,132 INFO L87 Difference]: Start difference. First operand 191 states and 276 transitions. Second operand 4 states. [2019-09-20 13:27:50,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:50,543 INFO L93 Difference]: Finished difference Result 198 states and 285 transitions. [2019-09-20 13:27:50,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:50,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:27:50,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:50,545 INFO L225 Difference]: With dead ends: 198 [2019-09-20 13:27:50,545 INFO L226 Difference]: Without dead ends: 198 [2019-09-20 13:27:50,546 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:50,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-20 13:27:50,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2019-09-20 13:27:50,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-20 13:27:50,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 275 transitions. [2019-09-20 13:27:50,552 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 275 transitions. Word has length 82 [2019-09-20 13:27:50,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:50,552 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 275 transitions. [2019-09-20 13:27:50,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 275 transitions. [2019-09-20 13:27:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-20 13:27:50,554 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:50,554 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:50,555 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:50,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:50,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1238796643, now seen corresponding path program 1 times [2019-09-20 13:27:50,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:50,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:50,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:50,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:50,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:50,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:50,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:50,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:50,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:50,671 INFO L87 Difference]: Start difference. First operand 191 states and 275 transitions. Second operand 4 states. [2019-09-20 13:27:51,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:51,127 INFO L93 Difference]: Finished difference Result 295 states and 432 transitions. [2019-09-20 13:27:51,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:51,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-20 13:27:51,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:51,130 INFO L225 Difference]: With dead ends: 295 [2019-09-20 13:27:51,130 INFO L226 Difference]: Without dead ends: 295 [2019-09-20 13:27:51,131 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:51,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-20 13:27:51,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 232. [2019-09-20 13:27:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-20 13:27:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 348 transitions. [2019-09-20 13:27:51,139 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 348 transitions. Word has length 86 [2019-09-20 13:27:51,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:51,139 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 348 transitions. [2019-09-20 13:27:51,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:51,140 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 348 transitions. [2019-09-20 13:27:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-20 13:27:51,141 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:51,141 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:51,141 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:51,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash -606570523, now seen corresponding path program 1 times [2019-09-20 13:27:51,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:51,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:51,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:51,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:51,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:51,208 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:51,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:51,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:51,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:51,209 INFO L87 Difference]: Start difference. First operand 232 states and 348 transitions. Second operand 4 states. [2019-09-20 13:27:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:51,568 INFO L93 Difference]: Finished difference Result 280 states and 419 transitions. [2019-09-20 13:27:51,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:51,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-20 13:27:51,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:51,572 INFO L225 Difference]: With dead ends: 280 [2019-09-20 13:27:51,572 INFO L226 Difference]: Without dead ends: 280 [2019-09-20 13:27:51,572 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-20 13:27:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2019-09-20 13:27:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:51,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 389 transitions. [2019-09-20 13:27:51,583 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 389 transitions. Word has length 86 [2019-09-20 13:27:51,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:51,583 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 389 transitions. [2019-09-20 13:27:51,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:51,584 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 389 transitions. [2019-09-20 13:27:51,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-20 13:27:51,586 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:51,586 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:51,586 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:51,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:51,587 INFO L82 PathProgramCache]: Analyzing trace with hash -258512513, now seen corresponding path program 1 times [2019-09-20 13:27:51,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:51,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:51,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:51,674 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:51,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:51,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:51,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:51,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:51,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:51,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:51,676 INFO L87 Difference]: Start difference. First operand 256 states and 389 transitions. Second operand 4 states. [2019-09-20 13:27:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:52,128 INFO L93 Difference]: Finished difference Result 313 states and 465 transitions. [2019-09-20 13:27:52,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:52,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-20 13:27:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:52,131 INFO L225 Difference]: With dead ends: 313 [2019-09-20 13:27:52,131 INFO L226 Difference]: Without dead ends: 313 [2019-09-20 13:27:52,132 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:52,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-20 13:27:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 257. [2019-09-20 13:27:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-20 13:27:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 390 transitions. [2019-09-20 13:27:52,139 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 390 transitions. Word has length 87 [2019-09-20 13:27:52,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:52,139 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 390 transitions. [2019-09-20 13:27:52,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 390 transitions. [2019-09-20 13:27:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-20 13:27:52,141 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:52,141 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:52,142 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:52,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:52,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1475750695, now seen corresponding path program 1 times [2019-09-20 13:27:52,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:52,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:52,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:52,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:52,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:52,207 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:52,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:52,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:52,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:52,208 INFO L87 Difference]: Start difference. First operand 257 states and 390 transitions. Second operand 4 states. [2019-09-20 13:27:52,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:52,630 INFO L93 Difference]: Finished difference Result 313 states and 464 transitions. [2019-09-20 13:27:52,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:52,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-09-20 13:27:52,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:52,633 INFO L225 Difference]: With dead ends: 313 [2019-09-20 13:27:52,634 INFO L226 Difference]: Without dead ends: 313 [2019-09-20 13:27:52,634 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:52,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-20 13:27:52,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 257. [2019-09-20 13:27:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-20 13:27:52,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 389 transitions. [2019-09-20 13:27:52,642 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 389 transitions. Word has length 99 [2019-09-20 13:27:52,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:52,642 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 389 transitions. [2019-09-20 13:27:52,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:52,642 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 389 transitions. [2019-09-20 13:27:52,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-20 13:27:52,644 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:52,644 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:52,644 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:52,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:52,645 INFO L82 PathProgramCache]: Analyzing trace with hash 62589335, now seen corresponding path program 1 times [2019-09-20 13:27:52,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:52,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:52,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:52,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:52,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:52,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:52,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:52,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:52,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:52,770 INFO L87 Difference]: Start difference. First operand 257 states and 389 transitions. Second operand 4 states. [2019-09-20 13:27:53,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:53,136 INFO L93 Difference]: Finished difference Result 281 states and 418 transitions. [2019-09-20 13:27:53,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:53,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-09-20 13:27:53,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:53,140 INFO L225 Difference]: With dead ends: 281 [2019-09-20 13:27:53,140 INFO L226 Difference]: Without dead ends: 281 [2019-09-20 13:27:53,141 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:53,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-20 13:27:53,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 257. [2019-09-20 13:27:53,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-20 13:27:53,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 388 transitions. [2019-09-20 13:27:53,149 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 388 transitions. Word has length 99 [2019-09-20 13:27:53,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:53,150 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 388 transitions. [2019-09-20 13:27:53,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:53,150 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 388 transitions. [2019-09-20 13:27:53,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-20 13:27:53,151 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:53,151 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:53,151 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:53,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:53,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1352303207, now seen corresponding path program 1 times [2019-09-20 13:27:53,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:53,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:53,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:53,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:53,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:53,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:53,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:53,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:53,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:53,231 INFO L87 Difference]: Start difference. First operand 257 states and 388 transitions. Second operand 4 states. [2019-09-20 13:27:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:53,681 INFO L93 Difference]: Finished difference Result 312 states and 461 transitions. [2019-09-20 13:27:53,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:53,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-20 13:27:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:53,684 INFO L225 Difference]: With dead ends: 312 [2019-09-20 13:27:53,684 INFO L226 Difference]: Without dead ends: 312 [2019-09-20 13:27:53,685 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:53,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-09-20 13:27:53,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 257. [2019-09-20 13:27:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-20 13:27:53,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 387 transitions. [2019-09-20 13:27:53,694 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 387 transitions. Word has length 100 [2019-09-20 13:27:53,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:53,695 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 387 transitions. [2019-09-20 13:27:53,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:53,695 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 387 transitions. [2019-09-20 13:27:53,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-20 13:27:53,696 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:53,696 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:53,697 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:53,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:53,699 INFO L82 PathProgramCache]: Analyzing trace with hash 305725208, now seen corresponding path program 1 times [2019-09-20 13:27:53,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:53,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:53,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:53,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:53,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:53,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:53,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:53,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:53,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:53,817 INFO L87 Difference]: Start difference. First operand 257 states and 387 transitions. Second operand 4 states. [2019-09-20 13:27:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:54,264 INFO L93 Difference]: Finished difference Result 310 states and 458 transitions. [2019-09-20 13:27:54,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:54,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-20 13:27:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:54,267 INFO L225 Difference]: With dead ends: 310 [2019-09-20 13:27:54,267 INFO L226 Difference]: Without dead ends: 310 [2019-09-20 13:27:54,268 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:54,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-20 13:27:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 257. [2019-09-20 13:27:54,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-20 13:27:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 386 transitions. [2019-09-20 13:27:54,275 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 386 transitions. Word has length 100 [2019-09-20 13:27:54,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:54,275 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 386 transitions. [2019-09-20 13:27:54,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:54,276 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 386 transitions. [2019-09-20 13:27:54,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-20 13:27:54,277 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:54,277 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:54,277 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:54,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:54,278 INFO L82 PathProgramCache]: Analyzing trace with hash -908402533, now seen corresponding path program 1 times [2019-09-20 13:27:54,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:54,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:54,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:54,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:54,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:54,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:54,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:54,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:54,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:54,345 INFO L87 Difference]: Start difference. First operand 257 states and 386 transitions. Second operand 4 states. [2019-09-20 13:27:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:54,714 INFO L93 Difference]: Finished difference Result 280 states and 414 transitions. [2019-09-20 13:27:54,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:54,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-20 13:27:54,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:54,717 INFO L225 Difference]: With dead ends: 280 [2019-09-20 13:27:54,718 INFO L226 Difference]: Without dead ends: 280 [2019-09-20 13:27:54,718 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:54,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-20 13:27:54,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 257. [2019-09-20 13:27:54,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-20 13:27:54,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 385 transitions. [2019-09-20 13:27:54,728 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 385 transitions. Word has length 100 [2019-09-20 13:27:54,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:54,729 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 385 transitions. [2019-09-20 13:27:54,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:54,729 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 385 transitions. [2019-09-20 13:27:54,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-20 13:27:54,731 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:54,732 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:54,732 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:54,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:54,733 INFO L82 PathProgramCache]: Analyzing trace with hash 749625882, now seen corresponding path program 1 times [2019-09-20 13:27:54,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:54,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:54,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:54,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:54,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:54,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:54,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:54,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:54,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:54,865 INFO L87 Difference]: Start difference. First operand 257 states and 385 transitions. Second operand 4 states. [2019-09-20 13:27:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:55,312 INFO L93 Difference]: Finished difference Result 278 states and 411 transitions. [2019-09-20 13:27:55,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:55,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-20 13:27:55,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:55,315 INFO L225 Difference]: With dead ends: 278 [2019-09-20 13:27:55,315 INFO L226 Difference]: Without dead ends: 278 [2019-09-20 13:27:55,316 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:55,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-20 13:27:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-09-20 13:27:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-20 13:27:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 384 transitions. [2019-09-20 13:27:55,325 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 384 transitions. Word has length 100 [2019-09-20 13:27:55,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:55,326 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 384 transitions. [2019-09-20 13:27:55,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:55,326 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 384 transitions. [2019-09-20 13:27:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:27:55,328 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:55,328 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:55,329 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:55,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:55,329 INFO L82 PathProgramCache]: Analyzing trace with hash 752571286, now seen corresponding path program 1 times [2019-09-20 13:27:55,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:55,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:55,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:55,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:55,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:55,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:55,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:55,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:55,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:55,408 INFO L87 Difference]: Start difference. First operand 257 states and 384 transitions. Second operand 4 states. [2019-09-20 13:27:55,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:55,847 INFO L93 Difference]: Finished difference Result 310 states and 455 transitions. [2019-09-20 13:27:55,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:55,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:27:55,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:55,849 INFO L225 Difference]: With dead ends: 310 [2019-09-20 13:27:55,850 INFO L226 Difference]: Without dead ends: 310 [2019-09-20 13:27:55,850 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:55,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-20 13:27:55,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 257. [2019-09-20 13:27:55,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-20 13:27:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 383 transitions. [2019-09-20 13:27:55,857 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 383 transitions. Word has length 101 [2019-09-20 13:27:55,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:55,858 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 383 transitions. [2019-09-20 13:27:55,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:55,858 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 383 transitions. [2019-09-20 13:27:55,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:27:55,859 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:55,859 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:55,860 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:55,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:55,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1628590292, now seen corresponding path program 1 times [2019-09-20 13:27:55,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:55,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:55,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:55,920 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:55,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:55,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:55,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:55,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:55,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:55,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:55,923 INFO L87 Difference]: Start difference. First operand 257 states and 383 transitions. Second operand 4 states. [2019-09-20 13:27:56,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:56,272 INFO L93 Difference]: Finished difference Result 278 states and 409 transitions. [2019-09-20 13:27:56,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:56,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:27:56,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:56,274 INFO L225 Difference]: With dead ends: 278 [2019-09-20 13:27:56,274 INFO L226 Difference]: Without dead ends: 278 [2019-09-20 13:27:56,275 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:56,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-20 13:27:56,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-09-20 13:27:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-20 13:27:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 382 transitions. [2019-09-20 13:27:56,285 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 382 transitions. Word has length 101 [2019-09-20 13:27:56,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:56,286 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 382 transitions. [2019-09-20 13:27:56,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:56,286 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 382 transitions. [2019-09-20 13:27:56,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:27:56,287 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:56,288 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:56,288 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:56,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:56,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1424350037, now seen corresponding path program 1 times [2019-09-20 13:27:56,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:56,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:56,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:56,353 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:56,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:56,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:56,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:56,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:56,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:56,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:56,355 INFO L87 Difference]: Start difference. First operand 257 states and 382 transitions. Second operand 4 states. [2019-09-20 13:27:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:56,797 INFO L93 Difference]: Finished difference Result 310 states and 453 transitions. [2019-09-20 13:27:56,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:56,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:27:56,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:56,800 INFO L225 Difference]: With dead ends: 310 [2019-09-20 13:27:56,800 INFO L226 Difference]: Without dead ends: 310 [2019-09-20 13:27:56,800 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-20 13:27:56,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 257. [2019-09-20 13:27:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-20 13:27:56,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 381 transitions. [2019-09-20 13:27:56,807 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 381 transitions. Word has length 102 [2019-09-20 13:27:56,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:56,807 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 381 transitions. [2019-09-20 13:27:56,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:56,808 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 381 transitions. [2019-09-20 13:27:56,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:27:56,809 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:56,809 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:56,810 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:56,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:56,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1483831849, now seen corresponding path program 1 times [2019-09-20 13:27:56,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:56,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:56,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:56,875 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:56,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:56,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:56,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:56,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:56,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:56,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:56,877 INFO L87 Difference]: Start difference. First operand 257 states and 381 transitions. Second operand 4 states. [2019-09-20 13:27:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:57,181 INFO L93 Difference]: Finished difference Result 278 states and 407 transitions. [2019-09-20 13:27:57,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:57,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:27:57,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:57,183 INFO L225 Difference]: With dead ends: 278 [2019-09-20 13:27:57,184 INFO L226 Difference]: Without dead ends: 278 [2019-09-20 13:27:57,184 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:57,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-20 13:27:57,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-09-20 13:27:57,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-20 13:27:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 380 transitions. [2019-09-20 13:27:57,191 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 380 transitions. Word has length 102 [2019-09-20 13:27:57,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:57,191 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 380 transitions. [2019-09-20 13:27:57,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 380 transitions. [2019-09-20 13:27:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:57,193 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:57,193 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:57,194 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:57,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:57,194 INFO L82 PathProgramCache]: Analyzing trace with hash -847114351, now seen corresponding path program 1 times [2019-09-20 13:27:57,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:57,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:57,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:57,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:57,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:57,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:57,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:57,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:57,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:57,281 INFO L87 Difference]: Start difference. First operand 257 states and 380 transitions. Second operand 4 states. [2019-09-20 13:27:57,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:57,711 INFO L93 Difference]: Finished difference Result 310 states and 451 transitions. [2019-09-20 13:27:57,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:57,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:57,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:57,714 INFO L225 Difference]: With dead ends: 310 [2019-09-20 13:27:57,714 INFO L226 Difference]: Without dead ends: 310 [2019-09-20 13:27:57,714 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:57,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-20 13:27:57,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 257. [2019-09-20 13:27:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-20 13:27:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 379 transitions. [2019-09-20 13:27:57,721 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 379 transitions. Word has length 103 [2019-09-20 13:27:57,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:57,722 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 379 transitions. [2019-09-20 13:27:57,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:57,722 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 379 transitions. [2019-09-20 13:27:57,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:57,724 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:57,724 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:57,724 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:57,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:57,725 INFO L82 PathProgramCache]: Analyzing trace with hash -806439601, now seen corresponding path program 1 times [2019-09-20 13:27:57,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:57,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:57,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:57,831 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:57,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:57,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:57,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:57,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:57,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:57,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:57,834 INFO L87 Difference]: Start difference. First operand 257 states and 379 transitions. Second operand 4 states. [2019-09-20 13:27:58,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:58,120 INFO L93 Difference]: Finished difference Result 278 states and 405 transitions. [2019-09-20 13:27:58,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:58,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:58,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:58,122 INFO L225 Difference]: With dead ends: 278 [2019-09-20 13:27:58,122 INFO L226 Difference]: Without dead ends: 278 [2019-09-20 13:27:58,122 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:58,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-20 13:27:58,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-09-20 13:27:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-20 13:27:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 378 transitions. [2019-09-20 13:27:58,127 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 378 transitions. Word has length 103 [2019-09-20 13:27:58,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:58,127 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 378 transitions. [2019-09-20 13:27:58,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:58,128 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2019-09-20 13:27:58,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:58,129 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:58,129 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:58,129 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:58,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:58,129 INFO L82 PathProgramCache]: Analyzing trace with hash 130164464, now seen corresponding path program 1 times [2019-09-20 13:27:58,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:58,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:58,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:58,194 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:58,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:58,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:58,195 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:58,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:58,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:58,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:58,196 INFO L87 Difference]: Start difference. First operand 257 states and 378 transitions. Second operand 4 states. [2019-09-20 13:27:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:58,551 INFO L93 Difference]: Finished difference Result 300 states and 437 transitions. [2019-09-20 13:27:58,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:58,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:58,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:58,554 INFO L225 Difference]: With dead ends: 300 [2019-09-20 13:27:58,554 INFO L226 Difference]: Without dead ends: 300 [2019-09-20 13:27:58,560 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:58,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-20 13:27:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 257. [2019-09-20 13:27:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-20 13:27:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 377 transitions. [2019-09-20 13:27:58,567 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 377 transitions. Word has length 104 [2019-09-20 13:27:58,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:58,567 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 377 transitions. [2019-09-20 13:27:58,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 377 transitions. [2019-09-20 13:27:58,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:58,569 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:58,569 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:58,569 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:58,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:58,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1391081714, now seen corresponding path program 1 times [2019-09-20 13:27:58,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:58,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:58,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:58,628 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:58,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:58,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:58,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:58,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:58,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:58,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:58,630 INFO L87 Difference]: Start difference. First operand 257 states and 377 transitions. Second operand 4 states. [2019-09-20 13:27:58,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:58,879 INFO L93 Difference]: Finished difference Result 268 states and 391 transitions. [2019-09-20 13:27:58,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:58,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:58,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:58,882 INFO L225 Difference]: With dead ends: 268 [2019-09-20 13:27:58,882 INFO L226 Difference]: Without dead ends: 268 [2019-09-20 13:27:58,882 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:58,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-09-20 13:27:58,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 257. [2019-09-20 13:27:58,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-20 13:27:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 376 transitions. [2019-09-20 13:27:58,888 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 376 transitions. Word has length 104 [2019-09-20 13:27:58,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:58,889 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 376 transitions. [2019-09-20 13:27:58,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:58,889 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 376 transitions. [2019-09-20 13:27:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:27:58,891 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:58,891 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:58,891 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:58,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:58,892 INFO L82 PathProgramCache]: Analyzing trace with hash 156613212, now seen corresponding path program 1 times [2019-09-20 13:27:58,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:58,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:58,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:58,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:58,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:58,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:58,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:58,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:58,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:58,960 INFO L87 Difference]: Start difference. First operand 257 states and 376 transitions. Second operand 4 states. [2019-09-20 13:27:59,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:59,303 INFO L93 Difference]: Finished difference Result 300 states and 435 transitions. [2019-09-20 13:27:59,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:59,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-20 13:27:59,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:59,306 INFO L225 Difference]: With dead ends: 300 [2019-09-20 13:27:59,306 INFO L226 Difference]: Without dead ends: 300 [2019-09-20 13:27:59,306 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:59,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-20 13:27:59,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 257. [2019-09-20 13:27:59,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-20 13:27:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 375 transitions. [2019-09-20 13:27:59,314 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 375 transitions. Word has length 108 [2019-09-20 13:27:59,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:59,314 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 375 transitions. [2019-09-20 13:27:59,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 375 transitions. [2019-09-20 13:27:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:27:59,316 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:59,316 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:59,316 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:59,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2118187870, now seen corresponding path program 1 times [2019-09-20 13:27:59,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:59,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:59,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:59,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:59,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:59,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:59,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:59,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:59,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:59,399 INFO L87 Difference]: Start difference. First operand 257 states and 375 transitions. Second operand 4 states. [2019-09-20 13:27:59,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:59,706 INFO L93 Difference]: Finished difference Result 309 states and 453 transitions. [2019-09-20 13:27:59,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:59,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-20 13:27:59,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:59,709 INFO L225 Difference]: With dead ends: 309 [2019-09-20 13:27:59,709 INFO L226 Difference]: Without dead ends: 309 [2019-09-20 13:27:59,709 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:59,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-20 13:27:59,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2019-09-20 13:27:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-20 13:27:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 420 transitions. [2019-09-20 13:27:59,718 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 420 transitions. Word has length 108 [2019-09-20 13:27:59,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:59,720 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 420 transitions. [2019-09-20 13:27:59,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:59,720 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 420 transitions. [2019-09-20 13:27:59,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-20 13:27:59,721 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:59,721 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:59,722 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:59,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:59,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1678357372, now seen corresponding path program 1 times [2019-09-20 13:27:59,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:59,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:59,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:59,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:59,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:59,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:59,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:59,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:59,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:59,810 INFO L87 Difference]: Start difference. First operand 283 states and 420 transitions. Second operand 4 states. [2019-09-20 13:28:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:00,194 INFO L93 Difference]: Finished difference Result 326 states and 479 transitions. [2019-09-20 13:28:00,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:00,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-20 13:28:00,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:00,196 INFO L225 Difference]: With dead ends: 326 [2019-09-20 13:28:00,196 INFO L226 Difference]: Without dead ends: 326 [2019-09-20 13:28:00,196 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-20 13:28:00,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 283. [2019-09-20 13:28:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-20 13:28:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 419 transitions. [2019-09-20 13:28:00,200 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 419 transitions. Word has length 111 [2019-09-20 13:28:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:00,200 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 419 transitions. [2019-09-20 13:28:00,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 419 transitions. [2019-09-20 13:28:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-20 13:28:00,201 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:00,201 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:00,202 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:00,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:00,202 INFO L82 PathProgramCache]: Analyzing trace with hash 707236731, now seen corresponding path program 1 times [2019-09-20 13:28:00,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:00,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:00,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:00,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:00,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:00,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:00,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:00,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:00,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:00,273 INFO L87 Difference]: Start difference. First operand 283 states and 419 transitions. Second operand 4 states. [2019-09-20 13:28:00,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:00,611 INFO L93 Difference]: Finished difference Result 318 states and 465 transitions. [2019-09-20 13:28:00,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:00,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-20 13:28:00,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:00,614 INFO L225 Difference]: With dead ends: 318 [2019-09-20 13:28:00,614 INFO L226 Difference]: Without dead ends: 318 [2019-09-20 13:28:00,614 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-20 13:28:00,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 283. [2019-09-20 13:28:00,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-20 13:28:00,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 418 transitions. [2019-09-20 13:28:00,621 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 418 transitions. Word has length 112 [2019-09-20 13:28:00,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:00,621 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 418 transitions. [2019-09-20 13:28:00,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:00,621 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 418 transitions. [2019-09-20 13:28:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-20 13:28:00,622 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:00,623 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:00,623 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:00,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:00,623 INFO L82 PathProgramCache]: Analyzing trace with hash -2062157930, now seen corresponding path program 1 times [2019-09-20 13:28:00,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:00,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:00,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:00,701 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:00,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:00,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:00,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:00,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:00,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:00,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:00,703 INFO L87 Difference]: Start difference. First operand 283 states and 418 transitions. Second operand 4 states. [2019-09-20 13:28:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:01,054 INFO L93 Difference]: Finished difference Result 318 states and 464 transitions. [2019-09-20 13:28:01,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:01,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-20 13:28:01,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:01,057 INFO L225 Difference]: With dead ends: 318 [2019-09-20 13:28:01,057 INFO L226 Difference]: Without dead ends: 318 [2019-09-20 13:28:01,057 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:01,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-20 13:28:01,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 283. [2019-09-20 13:28:01,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-20 13:28:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 417 transitions. [2019-09-20 13:28:01,063 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 417 transitions. Word has length 113 [2019-09-20 13:28:01,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:01,063 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 417 transitions. [2019-09-20 13:28:01,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:01,063 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 417 transitions. [2019-09-20 13:28:01,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-20 13:28:01,064 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:01,065 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:01,065 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:01,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:01,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1080843729, now seen corresponding path program 1 times [2019-09-20 13:28:01,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:01,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:01,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:01,142 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:01,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:01,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:01,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:01,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:01,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:01,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:01,143 INFO L87 Difference]: Start difference. First operand 283 states and 417 transitions. Second operand 4 states. [2019-09-20 13:28:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:01,475 INFO L93 Difference]: Finished difference Result 318 states and 463 transitions. [2019-09-20 13:28:01,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:01,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-20 13:28:01,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:01,478 INFO L225 Difference]: With dead ends: 318 [2019-09-20 13:28:01,478 INFO L226 Difference]: Without dead ends: 318 [2019-09-20 13:28:01,478 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:01,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-20 13:28:01,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 283. [2019-09-20 13:28:01,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-20 13:28:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 416 transitions. [2019-09-20 13:28:01,483 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 416 transitions. Word has length 114 [2019-09-20 13:28:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:01,484 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 416 transitions. [2019-09-20 13:28:01,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2019-09-20 13:28:01,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-20 13:28:01,485 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:01,485 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:01,485 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:01,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:01,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1376624843, now seen corresponding path program 1 times [2019-09-20 13:28:01,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:01,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:01,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:01,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:01,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:01,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:01,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:01,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:01,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:01,554 INFO L87 Difference]: Start difference. First operand 283 states and 416 transitions. Second operand 4 states. [2019-09-20 13:28:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:01,873 INFO L93 Difference]: Finished difference Result 316 states and 460 transitions. [2019-09-20 13:28:01,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:01,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-20 13:28:01,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:01,877 INFO L225 Difference]: With dead ends: 316 [2019-09-20 13:28:01,877 INFO L226 Difference]: Without dead ends: 316 [2019-09-20 13:28:01,877 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:01,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-20 13:28:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 283. [2019-09-20 13:28:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-20 13:28:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 415 transitions. [2019-09-20 13:28:01,883 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 415 transitions. Word has length 114 [2019-09-20 13:28:01,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:01,884 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 415 transitions. [2019-09-20 13:28:01,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 415 transitions. [2019-09-20 13:28:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-20 13:28:01,885 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:01,885 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:01,886 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:01,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:01,886 INFO L82 PathProgramCache]: Analyzing trace with hash 102551762, now seen corresponding path program 1 times [2019-09-20 13:28:01,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:01,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:01,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:01,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:01,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:01,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:01,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:01,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:01,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:01,966 INFO L87 Difference]: Start difference. First operand 283 states and 415 transitions. Second operand 4 states. [2019-09-20 13:28:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:02,356 INFO L93 Difference]: Finished difference Result 314 states and 456 transitions. [2019-09-20 13:28:02,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:02,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-20 13:28:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:02,359 INFO L225 Difference]: With dead ends: 314 [2019-09-20 13:28:02,359 INFO L226 Difference]: Without dead ends: 314 [2019-09-20 13:28:02,360 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:02,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-20 13:28:02,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 283. [2019-09-20 13:28:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-20 13:28:02,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 414 transitions. [2019-09-20 13:28:02,367 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 414 transitions. Word has length 115 [2019-09-20 13:28:02,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:02,368 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 414 transitions. [2019-09-20 13:28:02,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:02,368 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 414 transitions. [2019-09-20 13:28:02,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-20 13:28:02,369 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:02,369 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:02,369 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:02,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:02,370 INFO L82 PathProgramCache]: Analyzing trace with hash -713422860, now seen corresponding path program 1 times [2019-09-20 13:28:02,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:02,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:02,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:02,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:02,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:02,458 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:02,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:02,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:02,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:02,459 INFO L87 Difference]: Start difference. First operand 283 states and 414 transitions. Second operand 4 states. [2019-09-20 13:28:02,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:02,875 INFO L93 Difference]: Finished difference Result 311 states and 451 transitions. [2019-09-20 13:28:02,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:02,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-20 13:28:02,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:02,878 INFO L225 Difference]: With dead ends: 311 [2019-09-20 13:28:02,879 INFO L226 Difference]: Without dead ends: 311 [2019-09-20 13:28:02,879 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:02,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-20 13:28:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 283. [2019-09-20 13:28:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-20 13:28:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 413 transitions. [2019-09-20 13:28:02,889 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 413 transitions. Word has length 115 [2019-09-20 13:28:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:02,890 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 413 transitions. [2019-09-20 13:28:02,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:02,890 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 413 transitions. [2019-09-20 13:28:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-20 13:28:02,892 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:02,892 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:02,892 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:02,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:02,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1417236522, now seen corresponding path program 1 times [2019-09-20 13:28:02,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:02,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:02,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:02,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:02,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:02,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:02,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:02,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:02,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:02,997 INFO L87 Difference]: Start difference. First operand 283 states and 413 transitions. Second operand 4 states. [2019-09-20 13:28:03,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:03,356 INFO L93 Difference]: Finished difference Result 311 states and 450 transitions. [2019-09-20 13:28:03,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:03,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-20 13:28:03,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:03,358 INFO L225 Difference]: With dead ends: 311 [2019-09-20 13:28:03,358 INFO L226 Difference]: Without dead ends: 311 [2019-09-20 13:28:03,359 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:03,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-20 13:28:03,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 283. [2019-09-20 13:28:03,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-20 13:28:03,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 412 transitions. [2019-09-20 13:28:03,364 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 412 transitions. Word has length 117 [2019-09-20 13:28:03,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:03,365 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 412 transitions. [2019-09-20 13:28:03,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 412 transitions. [2019-09-20 13:28:03,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-20 13:28:03,366 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:03,366 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:03,367 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:03,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:03,367 INFO L82 PathProgramCache]: Analyzing trace with hash 419052122, now seen corresponding path program 1 times [2019-09-20 13:28:03,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:03,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:03,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:03,441 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:03,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:03,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:03,442 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:03,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:03,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:03,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:03,443 INFO L87 Difference]: Start difference. First operand 283 states and 412 transitions. Second operand 4 states. [2019-09-20 13:28:03,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:03,758 INFO L93 Difference]: Finished difference Result 307 states and 444 transitions. [2019-09-20 13:28:03,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:03,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-09-20 13:28:03,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:03,761 INFO L225 Difference]: With dead ends: 307 [2019-09-20 13:28:03,761 INFO L226 Difference]: Without dead ends: 307 [2019-09-20 13:28:03,762 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:03,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-20 13:28:03,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2019-09-20 13:28:03,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-20 13:28:03,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 411 transitions. [2019-09-20 13:28:03,767 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 411 transitions. Word has length 118 [2019-09-20 13:28:03,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:03,768 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 411 transitions. [2019-09-20 13:28:03,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:03,768 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 411 transitions. [2019-09-20 13:28:03,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-20 13:28:03,769 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:03,769 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:03,769 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:03,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:03,770 INFO L82 PathProgramCache]: Analyzing trace with hash 875589163, now seen corresponding path program 1 times [2019-09-20 13:28:03,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:03,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:03,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:03,841 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:03,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:03,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:03,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:03,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:03,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:03,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:03,842 INFO L87 Difference]: Start difference. First operand 283 states and 411 transitions. Second operand 4 states. [2019-09-20 13:28:04,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:04,179 INFO L93 Difference]: Finished difference Result 307 states and 443 transitions. [2019-09-20 13:28:04,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:04,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-09-20 13:28:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:04,182 INFO L225 Difference]: With dead ends: 307 [2019-09-20 13:28:04,182 INFO L226 Difference]: Without dead ends: 307 [2019-09-20 13:28:04,183 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:04,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-20 13:28:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2019-09-20 13:28:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-20 13:28:04,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 410 transitions. [2019-09-20 13:28:04,188 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 410 transitions. Word has length 118 [2019-09-20 13:28:04,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:04,189 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 410 transitions. [2019-09-20 13:28:04,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 410 transitions. [2019-09-20 13:28:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-20 13:28:04,190 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:04,190 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:04,191 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:04,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:04,191 INFO L82 PathProgramCache]: Analyzing trace with hash -404439161, now seen corresponding path program 1 times [2019-09-20 13:28:04,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:04,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:04,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:04,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:04,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:04,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:04,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:04,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:04,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:04,273 INFO L87 Difference]: Start difference. First operand 283 states and 410 transitions. Second operand 4 states. [2019-09-20 13:28:04,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:04,600 INFO L93 Difference]: Finished difference Result 305 states and 440 transitions. [2019-09-20 13:28:04,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:04,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-09-20 13:28:04,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:04,605 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:28:04,605 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:28:04,605 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:04,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:28:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 283. [2019-09-20 13:28:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-20 13:28:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 409 transitions. [2019-09-20 13:28:04,611 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 409 transitions. Word has length 119 [2019-09-20 13:28:04,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:04,611 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 409 transitions. [2019-09-20 13:28:04,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:04,612 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 409 transitions. [2019-09-20 13:28:04,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-20 13:28:04,613 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:04,613 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:04,613 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:04,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:04,613 INFO L82 PathProgramCache]: Analyzing trace with hash -2036770522, now seen corresponding path program 1 times [2019-09-20 13:28:04,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:04,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:04,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:04,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:04,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:04,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:04,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:04,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:04,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:04,687 INFO L87 Difference]: Start difference. First operand 283 states and 409 transitions. Second operand 4 states. [2019-09-20 13:28:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:04,992 INFO L93 Difference]: Finished difference Result 305 states and 439 transitions. [2019-09-20 13:28:04,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:04,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-20 13:28:04,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:04,995 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:28:04,996 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:28:04,996 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:04,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:28:05,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 283. [2019-09-20 13:28:05,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-20 13:28:05,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 408 transitions. [2019-09-20 13:28:05,001 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 408 transitions. Word has length 120 [2019-09-20 13:28:05,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:05,002 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 408 transitions. [2019-09-20 13:28:05,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:05,002 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 408 transitions. [2019-09-20 13:28:05,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-20 13:28:05,003 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:05,003 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:05,003 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:05,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:05,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1858777374, now seen corresponding path program 1 times [2019-09-20 13:28:05,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:05,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:05,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:05,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:05,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:05,087 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:05,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:05,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:05,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:05,088 INFO L87 Difference]: Start difference. First operand 283 states and 408 transitions. Second operand 4 states. [2019-09-20 13:28:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:05,440 INFO L93 Difference]: Finished difference Result 303 states and 436 transitions. [2019-09-20 13:28:05,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:05,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-20 13:28:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:05,443 INFO L225 Difference]: With dead ends: 303 [2019-09-20 13:28:05,443 INFO L226 Difference]: Without dead ends: 303 [2019-09-20 13:28:05,443 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:05,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-20 13:28:05,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 283. [2019-09-20 13:28:05,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-20 13:28:05,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 407 transitions. [2019-09-20 13:28:05,449 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 407 transitions. Word has length 121 [2019-09-20 13:28:05,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:05,449 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 407 transitions. [2019-09-20 13:28:05,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:05,449 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 407 transitions. [2019-09-20 13:28:05,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-20 13:28:05,450 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:05,451 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:05,451 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:05,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:05,451 INFO L82 PathProgramCache]: Analyzing trace with hash -900484418, now seen corresponding path program 1 times [2019-09-20 13:28:05,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:05,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:05,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:05,516 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-20 13:28:05,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:05,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:05,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:05,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:05,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:05,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:05,518 INFO L87 Difference]: Start difference. First operand 283 states and 407 transitions. Second operand 4 states. [2019-09-20 13:28:05,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:05,910 INFO L93 Difference]: Finished difference Result 354 states and 516 transitions. [2019-09-20 13:28:05,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:05,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-20 13:28:05,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:05,914 INFO L225 Difference]: With dead ends: 354 [2019-09-20 13:28:05,914 INFO L226 Difference]: Without dead ends: 354 [2019-09-20 13:28:05,914 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:05,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-20 13:28:05,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 315. [2019-09-20 13:28:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-20 13:28:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 464 transitions. [2019-09-20 13:28:05,920 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 464 transitions. Word has length 121 [2019-09-20 13:28:05,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:05,920 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 464 transitions. [2019-09-20 13:28:05,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 464 transitions. [2019-09-20 13:28:05,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-20 13:28:05,921 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:05,922 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:05,922 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:05,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:05,922 INFO L82 PathProgramCache]: Analyzing trace with hash -698917804, now seen corresponding path program 1 times [2019-09-20 13:28:05,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:05,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:05,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:05,995 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-20 13:28:05,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:05,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:05,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:05,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:05,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:05,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:05,997 INFO L87 Difference]: Start difference. First operand 315 states and 464 transitions. Second operand 4 states. [2019-09-20 13:28:06,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:06,448 INFO L93 Difference]: Finished difference Result 417 states and 619 transitions. [2019-09-20 13:28:06,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:06,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-20 13:28:06,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:06,450 INFO L225 Difference]: With dead ends: 417 [2019-09-20 13:28:06,450 INFO L226 Difference]: Without dead ends: 417 [2019-09-20 13:28:06,451 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:06,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-09-20 13:28:06,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 354. [2019-09-20 13:28:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-09-20 13:28:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 535 transitions. [2019-09-20 13:28:06,456 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 535 transitions. Word has length 122 [2019-09-20 13:28:06,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:06,457 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 535 transitions. [2019-09-20 13:28:06,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:06,457 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 535 transitions. [2019-09-20 13:28:06,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-20 13:28:06,458 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:06,458 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:06,459 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:06,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:06,459 INFO L82 PathProgramCache]: Analyzing trace with hash -467317701, now seen corresponding path program 1 times [2019-09-20 13:28:06,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:06,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:06,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:06,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:06,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:06,525 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:06,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:06,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:06,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:06,526 INFO L87 Difference]: Start difference. First operand 354 states and 535 transitions. Second operand 4 states. [2019-09-20 13:28:06,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:06,829 INFO L93 Difference]: Finished difference Result 380 states and 567 transitions. [2019-09-20 13:28:06,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:06,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-20 13:28:06,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:06,831 INFO L225 Difference]: With dead ends: 380 [2019-09-20 13:28:06,832 INFO L226 Difference]: Without dead ends: 380 [2019-09-20 13:28:06,832 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:06,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-20 13:28:06,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 354. [2019-09-20 13:28:06,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-09-20 13:28:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 534 transitions. [2019-09-20 13:28:06,837 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 534 transitions. Word has length 123 [2019-09-20 13:28:06,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:06,838 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 534 transitions. [2019-09-20 13:28:06,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:06,838 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 534 transitions. [2019-09-20 13:28:06,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-20 13:28:06,839 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:06,840 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:06,840 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:06,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:06,840 INFO L82 PathProgramCache]: Analyzing trace with hash -198118226, now seen corresponding path program 1 times [2019-09-20 13:28:06,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:06,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:06,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:06,914 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-20 13:28:06,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:06,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:06,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:06,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:06,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:06,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:06,916 INFO L87 Difference]: Start difference. First operand 354 states and 534 transitions. Second operand 4 states. [2019-09-20 13:28:07,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,340 INFO L93 Difference]: Finished difference Result 411 states and 610 transitions. [2019-09-20 13:28:07,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-20 13:28:07,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,342 INFO L225 Difference]: With dead ends: 411 [2019-09-20 13:28:07,342 INFO L226 Difference]: Without dead ends: 411 [2019-09-20 13:28:07,343 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:07,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-09-20 13:28:07,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 353. [2019-09-20 13:28:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-20 13:28:07,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 533 transitions. [2019-09-20 13:28:07,352 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 533 transitions. Word has length 123 [2019-09-20 13:28:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,353 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 533 transitions. [2019-09-20 13:28:07,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,353 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 533 transitions. [2019-09-20 13:28:07,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-20 13:28:07,357 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,358 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:07,358 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2032470192, now seen corresponding path program 1 times [2019-09-20 13:28:07,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,431 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:07,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,432 INFO L87 Difference]: Start difference. First operand 353 states and 533 transitions. Second operand 4 states. [2019-09-20 13:28:07,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,763 INFO L93 Difference]: Finished difference Result 379 states and 565 transitions. [2019-09-20 13:28:07,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-20 13:28:07,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,766 INFO L225 Difference]: With dead ends: 379 [2019-09-20 13:28:07,766 INFO L226 Difference]: Without dead ends: 379 [2019-09-20 13:28:07,767 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-09-20 13:28:07,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2019-09-20 13:28:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-20 13:28:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 532 transitions. [2019-09-20 13:28:07,773 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 532 transitions. Word has length 124 [2019-09-20 13:28:07,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,774 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 532 transitions. [2019-09-20 13:28:07,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 532 transitions. [2019-09-20 13:28:07,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-20 13:28:07,775 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,775 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:07,776 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,776 INFO L82 PathProgramCache]: Analyzing trace with hash -634359050, now seen corresponding path program 1 times [2019-09-20 13:28:07,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:07,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,848 INFO L87 Difference]: Start difference. First operand 353 states and 532 transitions. Second operand 4 states. [2019-09-20 13:28:08,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,197 INFO L93 Difference]: Finished difference Result 379 states and 564 transitions. [2019-09-20 13:28:08,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-20 13:28:08,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,199 INFO L225 Difference]: With dead ends: 379 [2019-09-20 13:28:08,199 INFO L226 Difference]: Without dead ends: 379 [2019-09-20 13:28:08,199 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:08,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-09-20 13:28:08,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2019-09-20 13:28:08,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-20 13:28:08,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 531 transitions. [2019-09-20 13:28:08,206 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 531 transitions. Word has length 125 [2019-09-20 13:28:08,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,207 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 531 transitions. [2019-09-20 13:28:08,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,207 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 531 transitions. [2019-09-20 13:28:08,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-20 13:28:08,209 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,210 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:08,210 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1864355797, now seen corresponding path program 1 times [2019-09-20 13:28:08,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,311 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:08,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,313 INFO L87 Difference]: Start difference. First operand 353 states and 531 transitions. Second operand 4 states. [2019-09-20 13:28:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,584 INFO L93 Difference]: Finished difference Result 369 states and 551 transitions. [2019-09-20 13:28:08,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-20 13:28:08,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,587 INFO L225 Difference]: With dead ends: 369 [2019-09-20 13:28:08,587 INFO L226 Difference]: Without dead ends: 369 [2019-09-20 13:28:08,587 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:08,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-20 13:28:08,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 353. [2019-09-20 13:28:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-20 13:28:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 530 transitions. [2019-09-20 13:28:08,595 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 530 transitions. Word has length 126 [2019-09-20 13:28:08,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,595 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 530 transitions. [2019-09-20 13:28:08,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,596 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 530 transitions. [2019-09-20 13:28:08,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-20 13:28:08,597 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,597 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:08,597 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1536585999, now seen corresponding path program 1 times [2019-09-20 13:28:08,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,664 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:08,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,666 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,667 INFO L87 Difference]: Start difference. First operand 353 states and 530 transitions. Second operand 4 states. [2019-09-20 13:28:09,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,161 INFO L93 Difference]: Finished difference Result 455 states and 685 transitions. [2019-09-20 13:28:09,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-20 13:28:09,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,164 INFO L225 Difference]: With dead ends: 455 [2019-09-20 13:28:09,165 INFO L226 Difference]: Without dead ends: 455 [2019-09-20 13:28:09,165 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-20 13:28:09,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 392. [2019-09-20 13:28:09,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-20 13:28:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 601 transitions. [2019-09-20 13:28:09,172 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 601 transitions. Word has length 127 [2019-09-20 13:28:09,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,172 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 601 transitions. [2019-09-20 13:28:09,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,172 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 601 transitions. [2019-09-20 13:28:09,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-20 13:28:09,174 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,174 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:09,174 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,175 INFO L82 PathProgramCache]: Analyzing trace with hash -396028495, now seen corresponding path program 1 times [2019-09-20 13:28:09,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:09,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,264 INFO L87 Difference]: Start difference. First operand 392 states and 601 transitions. Second operand 4 states. [2019-09-20 13:28:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,696 INFO L93 Difference]: Finished difference Result 449 states and 677 transitions. [2019-09-20 13:28:09,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-20 13:28:09,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,700 INFO L225 Difference]: With dead ends: 449 [2019-09-20 13:28:09,700 INFO L226 Difference]: Without dead ends: 449 [2019-09-20 13:28:09,700 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:09,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-20 13:28:09,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 353. [2019-09-20 13:28:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-20 13:28:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 530 transitions. [2019-09-20 13:28:09,705 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 530 transitions. Word has length 128 [2019-09-20 13:28:09,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,705 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 530 transitions. [2019-09-20 13:28:09,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,706 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 530 transitions. [2019-09-20 13:28:09,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-20 13:28:09,707 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,707 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:09,707 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1470901809, now seen corresponding path program 1 times [2019-09-20 13:28:09,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,797 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:09,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,798 INFO L87 Difference]: Start difference. First operand 353 states and 530 transitions. Second operand 4 states. [2019-09-20 13:28:10,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,110 INFO L93 Difference]: Finished difference Result 368 states and 549 transitions. [2019-09-20 13:28:10,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-20 13:28:10,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,112 INFO L225 Difference]: With dead ends: 368 [2019-09-20 13:28:10,112 INFO L226 Difference]: Without dead ends: 368 [2019-09-20 13:28:10,113 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:10,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-20 13:28:10,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 356. [2019-09-20 13:28:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-20 13:28:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 533 transitions. [2019-09-20 13:28:10,118 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 533 transitions. Word has length 129 [2019-09-20 13:28:10,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,118 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 533 transitions. [2019-09-20 13:28:10,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 533 transitions. [2019-09-20 13:28:10,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-20 13:28:10,120 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,120 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:10,120 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1910445861, now seen corresponding path program 1 times [2019-09-20 13:28:10,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,183 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-20 13:28:10,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,186 INFO L87 Difference]: Start difference. First operand 356 states and 533 transitions. Second operand 4 states.