java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_srvr.blast.14.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:54:42,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:54:42,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:54:42,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:54:42,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:54:42,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:54:42,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:54:42,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:54:42,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:54:42,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:54:42,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:54:42,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:54:42,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:54:42,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:54:42,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:54:42,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:54:42,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:54:42,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:54:42,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:54:42,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:54:42,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:54:42,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:54:42,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:54:42,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:54:42,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:54:42,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:54:42,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:54:42,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:54:42,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:54:42,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:54:42,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:54:42,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:54:42,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:54:42,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:54:42,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:54:42,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:54:42,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:54:42,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:54:42,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:54:42,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:54:42,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:54:42,446 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:54:42,473 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:54:42,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:54:42,474 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:54:42,475 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:54:42,475 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:54:42,475 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:54:42,476 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:54:42,476 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:54:42,476 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:54:42,476 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:54:42,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:54:42,479 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:54:42,479 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:54:42,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:54:42,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:54:42,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:54:42,480 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:54:42,481 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:54:42,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:54:42,481 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:54:42,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:54:42,482 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:54:42,482 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:54:42,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:54:42,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:54:42,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:54:42,483 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:54:42,483 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:54:42,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:54:42,483 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:54:42,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:54:42,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:54:42,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:54:42,566 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:54:42,567 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:54:42,568 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.14.i.cil-2.c [2019-09-09 05:54:42,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/610998143/d10f0120c38645278e8fe92244e312d4/FLAGd5faaad87 [2019-09-09 05:54:43,232 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:54:43,232 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.14.i.cil-2.c [2019-09-09 05:54:43,264 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/610998143/d10f0120c38645278e8fe92244e312d4/FLAGd5faaad87 [2019-09-09 05:54:43,458 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/610998143/d10f0120c38645278e8fe92244e312d4 [2019-09-09 05:54:43,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:54:43,469 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:54:43,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:54:43,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:54:43,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:54:43,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:54:43" (1/1) ... [2019-09-09 05:54:43,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fff1b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:43, skipping insertion in model container [2019-09-09 05:54:43,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:54:43" (1/1) ... [2019-09-09 05:54:43,486 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:54:43,567 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:54:44,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:54:44,194 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:54:44,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:54:44,515 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:54:44,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:44 WrapperNode [2019-09-09 05:54:44,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:54:44,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:54:44,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:54:44,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:54:44,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:44" (1/1) ... [2019-09-09 05:54:44,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:44" (1/1) ... [2019-09-09 05:54:44,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:44" (1/1) ... [2019-09-09 05:54:44,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:44" (1/1) ... [2019-09-09 05:54:44,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:44" (1/1) ... [2019-09-09 05:54:44,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:44" (1/1) ... [2019-09-09 05:54:44,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:44" (1/1) ... [2019-09-09 05:54:44,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:54:44,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:54:44,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:54:44,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:54:44,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:54:44,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:54:44,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:54:44,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-09 05:54:44,787 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-09 05:54:44,787 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:54:44,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:54:44,787 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-09 05:54:44,787 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-09 05:54:44,788 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-09 05:54:44,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:54:44,788 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-09 05:54:44,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:54:44,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:54:44,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:54:44,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:54:44,791 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-09 05:54:44,791 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-09 05:54:44,791 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-09 05:54:44,791 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:54:44,791 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-09 05:54:44,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-09 05:54:44,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-09 05:54:44,792 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:54:44,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-09 05:54:44,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-09 05:54:44,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-09 05:54:44,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-09 05:54:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-09 05:54:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-09 05:54:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:54:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-09 05:54:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-09 05:54:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-09 05:54:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:54:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-09 05:54:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-09 05:54:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-09 05:54:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-09 05:54:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-09 05:54:45,255 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:54:46,027 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-09 05:54:46,027 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-09 05:54:46,051 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:54:46,051 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:54:46,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:54:46 BoogieIcfgContainer [2019-09-09 05:54:46,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:54:46,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:54:46,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:54:46,059 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:54:46,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:54:43" (1/3) ... [2019-09-09 05:54:46,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9a24f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:54:46, skipping insertion in model container [2019-09-09 05:54:46,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:44" (2/3) ... [2019-09-09 05:54:46,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9a24f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:54:46, skipping insertion in model container [2019-09-09 05:54:46,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:54:46" (3/3) ... [2019-09-09 05:54:46,063 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14.i.cil-2.c [2019-09-09 05:54:46,074 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:54:46,084 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:54:46,101 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:54:46,130 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:54:46,130 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:54:46,131 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:54:46,131 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:54:46,131 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:54:46,131 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:54:46,131 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:54:46,131 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:54:46,152 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2019-09-09 05:54:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-09 05:54:46,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:46,168 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:46,171 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:46,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:46,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1106429626, now seen corresponding path program 1 times [2019-09-09 05:54:46,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:46,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:46,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:46,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:46,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:46,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:46,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:46,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:46,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:46,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:46,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:46,639 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 4 states. [2019-09-09 05:54:47,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:47,134 INFO L93 Difference]: Finished difference Result 195 states and 320 transitions. [2019-09-09 05:54:47,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:47,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-09-09 05:54:47,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:47,159 INFO L225 Difference]: With dead ends: 195 [2019-09-09 05:54:47,159 INFO L226 Difference]: Without dead ends: 174 [2019-09-09 05:54:47,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:47,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-09 05:54:47,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2019-09-09 05:54:47,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-09 05:54:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 242 transitions. [2019-09-09 05:54:47,241 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 242 transitions. Word has length 48 [2019-09-09 05:54:47,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:47,242 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 242 transitions. [2019-09-09 05:54:47,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:47,243 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 242 transitions. [2019-09-09 05:54:47,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-09 05:54:47,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:47,249 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:47,250 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:47,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:47,250 INFO L82 PathProgramCache]: Analyzing trace with hash 2020467317, now seen corresponding path program 1 times [2019-09-09 05:54:47,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:47,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:47,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:47,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:47,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:47,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:47,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:47,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:47,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:47,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:47,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:47,403 INFO L87 Difference]: Start difference. First operand 157 states and 242 transitions. Second operand 4 states. [2019-09-09 05:54:47,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:47,762 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2019-09-09 05:54:47,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:47,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-09-09 05:54:47,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:47,764 INFO L225 Difference]: With dead ends: 174 [2019-09-09 05:54:47,765 INFO L226 Difference]: Without dead ends: 174 [2019-09-09 05:54:47,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:47,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-09 05:54:47,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2019-09-09 05:54:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-09 05:54:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 241 transitions. [2019-09-09 05:54:47,777 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 241 transitions. Word has length 61 [2019-09-09 05:54:47,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:47,778 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 241 transitions. [2019-09-09 05:54:47,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:47,778 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 241 transitions. [2019-09-09 05:54:47,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:54:47,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:47,781 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:47,781 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:47,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:47,782 INFO L82 PathProgramCache]: Analyzing trace with hash 181445729, now seen corresponding path program 1 times [2019-09-09 05:54:47,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:47,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:47,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:47,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:47,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:47,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:47,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:47,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:47,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:47,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:47,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:47,856 INFO L87 Difference]: Start difference. First operand 157 states and 241 transitions. Second operand 4 states. [2019-09-09 05:54:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:48,179 INFO L93 Difference]: Finished difference Result 173 states and 260 transitions. [2019-09-09 05:54:48,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:48,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-09 05:54:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:48,182 INFO L225 Difference]: With dead ends: 173 [2019-09-09 05:54:48,182 INFO L226 Difference]: Without dead ends: 173 [2019-09-09 05:54:48,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:48,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-09 05:54:48,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 157. [2019-09-09 05:54:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-09 05:54:48,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 240 transitions. [2019-09-09 05:54:48,193 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 240 transitions. Word has length 62 [2019-09-09 05:54:48,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:48,193 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 240 transitions. [2019-09-09 05:54:48,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:48,194 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 240 transitions. [2019-09-09 05:54:48,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:54:48,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:48,196 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:48,197 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:48,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:48,197 INFO L82 PathProgramCache]: Analyzing trace with hash -866065075, now seen corresponding path program 1 times [2019-09-09 05:54:48,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:48,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:48,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:48,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:48,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:48,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:48,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:54:48,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:48,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:54:48,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:54:48,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:48,279 INFO L87 Difference]: Start difference. First operand 157 states and 240 transitions. Second operand 5 states. [2019-09-09 05:54:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:48,759 INFO L93 Difference]: Finished difference Result 178 states and 268 transitions. [2019-09-09 05:54:48,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:54:48,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-09-09 05:54:48,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:48,762 INFO L225 Difference]: With dead ends: 178 [2019-09-09 05:54:48,762 INFO L226 Difference]: Without dead ends: 178 [2019-09-09 05:54:48,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:54:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-09 05:54:48,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-09-09 05:54:48,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-09 05:54:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 267 transitions. [2019-09-09 05:54:48,773 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 267 transitions. Word has length 62 [2019-09-09 05:54:48,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:48,773 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 267 transitions. [2019-09-09 05:54:48,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:54:48,773 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2019-09-09 05:54:48,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:54:48,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:48,776 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:48,776 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:48,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:48,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1943028885, now seen corresponding path program 1 times [2019-09-09 05:54:48,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:48,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:48,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:48,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:48,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:48,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:48,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:48,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:48,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:48,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:48,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:48,907 INFO L87 Difference]: Start difference. First operand 177 states and 267 transitions. Second operand 4 states. [2019-09-09 05:54:49,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:49,203 INFO L93 Difference]: Finished difference Result 192 states and 284 transitions. [2019-09-09 05:54:49,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:49,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-09 05:54:49,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:49,209 INFO L225 Difference]: With dead ends: 192 [2019-09-09 05:54:49,211 INFO L226 Difference]: Without dead ends: 192 [2019-09-09 05:54:49,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:49,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-09 05:54:49,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 177. [2019-09-09 05:54:49,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-09 05:54:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 266 transitions. [2019-09-09 05:54:49,227 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 266 transitions. Word has length 62 [2019-09-09 05:54:49,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:49,227 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 266 transitions. [2019-09-09 05:54:49,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 266 transitions. [2019-09-09 05:54:49,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:54:49,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:49,234 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:49,234 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:49,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:49,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1802302198, now seen corresponding path program 1 times [2019-09-09 05:54:49,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:49,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:49,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:49,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:49,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:49,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:49,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:49,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:49,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:49,327 INFO L87 Difference]: Start difference. First operand 177 states and 266 transitions. Second operand 4 states. [2019-09-09 05:54:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:49,593 INFO L93 Difference]: Finished difference Result 190 states and 281 transitions. [2019-09-09 05:54:49,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:49,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-09 05:54:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:49,595 INFO L225 Difference]: With dead ends: 190 [2019-09-09 05:54:49,596 INFO L226 Difference]: Without dead ends: 190 [2019-09-09 05:54:49,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:49,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-09 05:54:49,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 177. [2019-09-09 05:54:49,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-09 05:54:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 265 transitions. [2019-09-09 05:54:49,603 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 265 transitions. Word has length 62 [2019-09-09 05:54:49,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:49,603 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 265 transitions. [2019-09-09 05:54:49,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:49,603 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 265 transitions. [2019-09-09 05:54:49,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:54:49,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:49,605 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:49,605 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:49,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:49,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1995085656, now seen corresponding path program 1 times [2019-09-09 05:54:49,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:49,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:49,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:49,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:49,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:49,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:49,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:49,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:49,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:49,671 INFO L87 Difference]: Start difference. First operand 177 states and 265 transitions. Second operand 4 states. [2019-09-09 05:54:49,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:49,951 INFO L93 Difference]: Finished difference Result 190 states and 280 transitions. [2019-09-09 05:54:49,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:49,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:54:49,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:49,953 INFO L225 Difference]: With dead ends: 190 [2019-09-09 05:54:49,954 INFO L226 Difference]: Without dead ends: 190 [2019-09-09 05:54:49,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:49,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-09 05:54:49,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 177. [2019-09-09 05:54:49,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-09 05:54:49,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 264 transitions. [2019-09-09 05:54:49,961 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 264 transitions. Word has length 63 [2019-09-09 05:54:49,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:49,961 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 264 transitions. [2019-09-09 05:54:49,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 264 transitions. [2019-09-09 05:54:49,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:54:49,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:49,965 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:49,965 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:49,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:49,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1190608295, now seen corresponding path program 1 times [2019-09-09 05:54:49,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:49,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:49,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:50,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:50,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:50,023 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:50,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:50,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:50,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:50,024 INFO L87 Difference]: Start difference. First operand 177 states and 264 transitions. Second operand 4 states. [2019-09-09 05:54:50,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:50,362 INFO L93 Difference]: Finished difference Result 190 states and 279 transitions. [2019-09-09 05:54:50,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:50,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-09 05:54:50,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:50,369 INFO L225 Difference]: With dead ends: 190 [2019-09-09 05:54:50,369 INFO L226 Difference]: Without dead ends: 190 [2019-09-09 05:54:50,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:50,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-09 05:54:50,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 177. [2019-09-09 05:54:50,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-09 05:54:50,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 263 transitions. [2019-09-09 05:54:50,375 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 263 transitions. Word has length 64 [2019-09-09 05:54:50,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:50,376 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 263 transitions. [2019-09-09 05:54:50,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 263 transitions. [2019-09-09 05:54:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:54:50,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:50,378 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:50,378 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:50,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:50,379 INFO L82 PathProgramCache]: Analyzing trace with hash 101889725, now seen corresponding path program 1 times [2019-09-09 05:54:50,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:50,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:50,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:50,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:50,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:50,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:50,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:50,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:50,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:50,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:50,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:50,482 INFO L87 Difference]: Start difference. First operand 177 states and 263 transitions. Second operand 4 states. [2019-09-09 05:54:50,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:50,764 INFO L93 Difference]: Finished difference Result 190 states and 278 transitions. [2019-09-09 05:54:50,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:50,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-09 05:54:50,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:50,766 INFO L225 Difference]: With dead ends: 190 [2019-09-09 05:54:50,766 INFO L226 Difference]: Without dead ends: 190 [2019-09-09 05:54:50,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:50,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-09 05:54:50,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 177. [2019-09-09 05:54:50,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-09 05:54:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 262 transitions. [2019-09-09 05:54:50,773 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 262 transitions. Word has length 65 [2019-09-09 05:54:50,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:50,773 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 262 transitions. [2019-09-09 05:54:50,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:50,773 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 262 transitions. [2019-09-09 05:54:50,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:54:50,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:50,775 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:50,775 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:50,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:50,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1013524354, now seen corresponding path program 1 times [2019-09-09 05:54:50,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:50,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:50,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:50,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:50,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:50,866 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:50,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:50,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:50,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:50,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:50,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:50,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:50,868 INFO L87 Difference]: Start difference. First operand 177 states and 262 transitions. Second operand 4 states. [2019-09-09 05:54:51,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:51,180 INFO L93 Difference]: Finished difference Result 219 states and 324 transitions. [2019-09-09 05:54:51,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:51,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-09 05:54:51,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:51,183 INFO L225 Difference]: With dead ends: 219 [2019-09-09 05:54:51,183 INFO L226 Difference]: Without dead ends: 219 [2019-09-09 05:54:51,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:51,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-09 05:54:51,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2019-09-09 05:54:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-09 05:54:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 299 transitions. [2019-09-09 05:54:51,190 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 299 transitions. Word has length 65 [2019-09-09 05:54:51,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:51,190 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 299 transitions. [2019-09-09 05:54:51,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 299 transitions. [2019-09-09 05:54:51,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-09 05:54:51,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:51,192 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:51,192 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:51,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:51,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1515581922, now seen corresponding path program 1 times [2019-09-09 05:54:51,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:51,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:51,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:51,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:51,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:51,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:51,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:51,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:51,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:51,253 INFO L87 Difference]: Start difference. First operand 199 states and 299 transitions. Second operand 4 states. [2019-09-09 05:54:51,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:51,508 INFO L93 Difference]: Finished difference Result 202 states and 302 transitions. [2019-09-09 05:54:51,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:51,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-09 05:54:51,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:51,510 INFO L225 Difference]: With dead ends: 202 [2019-09-09 05:54:51,510 INFO L226 Difference]: Without dead ends: 202 [2019-09-09 05:54:51,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:51,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-09 05:54:51,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2019-09-09 05:54:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-09 05:54:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 298 transitions. [2019-09-09 05:54:51,520 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 298 transitions. Word has length 66 [2019-09-09 05:54:51,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:51,520 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 298 transitions. [2019-09-09 05:54:51,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:51,521 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 298 transitions. [2019-09-09 05:54:51,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-09 05:54:51,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:51,522 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:51,522 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:51,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:51,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1769721649, now seen corresponding path program 1 times [2019-09-09 05:54:51,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:51,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:51,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:51,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:51,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:51,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:51,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:51,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:51,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:51,598 INFO L87 Difference]: Start difference. First operand 199 states and 298 transitions. Second operand 4 states. [2019-09-09 05:54:51,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:51,925 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2019-09-09 05:54:51,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:51,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-09 05:54:51,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:51,927 INFO L225 Difference]: With dead ends: 219 [2019-09-09 05:54:51,928 INFO L226 Difference]: Without dead ends: 219 [2019-09-09 05:54:51,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-09 05:54:51,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2019-09-09 05:54:51,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-09 05:54:51,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 297 transitions. [2019-09-09 05:54:51,936 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 297 transitions. Word has length 78 [2019-09-09 05:54:51,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:51,937 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 297 transitions. [2019-09-09 05:54:51,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 297 transitions. [2019-09-09 05:54:51,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:54:51,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:51,939 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:51,939 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:51,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:51,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1535119527, now seen corresponding path program 1 times [2019-09-09 05:54:51,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:51,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:51,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:52,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:52,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:52,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:52,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:52,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:52,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:52,012 INFO L87 Difference]: Start difference. First operand 199 states and 297 transitions. Second operand 4 states. [2019-09-09 05:54:52,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:52,346 INFO L93 Difference]: Finished difference Result 218 states and 320 transitions. [2019-09-09 05:54:52,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:52,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-09 05:54:52,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:52,348 INFO L225 Difference]: With dead ends: 218 [2019-09-09 05:54:52,348 INFO L226 Difference]: Without dead ends: 218 [2019-09-09 05:54:52,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:52,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-09 05:54:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 199. [2019-09-09 05:54:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-09 05:54:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 296 transitions. [2019-09-09 05:54:52,354 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 296 transitions. Word has length 79 [2019-09-09 05:54:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:52,356 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 296 transitions. [2019-09-09 05:54:52,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 296 transitions. [2019-09-09 05:54:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:54:52,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:52,357 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:52,357 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:52,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:52,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1675846214, now seen corresponding path program 1 times [2019-09-09 05:54:52,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:52,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:52,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:52,427 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:52,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:52,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:52,428 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:52,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:52,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:52,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:52,429 INFO L87 Difference]: Start difference. First operand 199 states and 296 transitions. Second operand 4 states. [2019-09-09 05:54:52,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:52,774 INFO L93 Difference]: Finished difference Result 216 states and 317 transitions. [2019-09-09 05:54:52,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:52,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-09 05:54:52,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:52,776 INFO L225 Difference]: With dead ends: 216 [2019-09-09 05:54:52,777 INFO L226 Difference]: Without dead ends: 216 [2019-09-09 05:54:52,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:52,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-09 05:54:52,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2019-09-09 05:54:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-09 05:54:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 295 transitions. [2019-09-09 05:54:52,783 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 295 transitions. Word has length 79 [2019-09-09 05:54:52,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:52,784 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 295 transitions. [2019-09-09 05:54:52,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 295 transitions. [2019-09-09 05:54:52,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:54:52,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:52,785 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:52,785 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:52,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:52,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1546667284, now seen corresponding path program 1 times [2019-09-09 05:54:52,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:52,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:52,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:52,858 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:52,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:52,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:52,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:52,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:52,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:52,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:52,860 INFO L87 Difference]: Start difference. First operand 199 states and 295 transitions. Second operand 4 states. [2019-09-09 05:54:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:53,138 INFO L93 Difference]: Finished difference Result 216 states and 316 transitions. [2019-09-09 05:54:53,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:53,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:54:53,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:53,140 INFO L225 Difference]: With dead ends: 216 [2019-09-09 05:54:53,140 INFO L226 Difference]: Without dead ends: 216 [2019-09-09 05:54:53,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:53,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-09 05:54:53,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2019-09-09 05:54:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-09 05:54:53,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 294 transitions. [2019-09-09 05:54:53,146 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 294 transitions. Word has length 80 [2019-09-09 05:54:53,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:53,147 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 294 transitions. [2019-09-09 05:54:53,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 294 transitions. [2019-09-09 05:54:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 05:54:53,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:53,148 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:53,148 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:53,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:53,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2088291357, now seen corresponding path program 1 times [2019-09-09 05:54:53,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:53,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:53,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:53,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:53,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:53,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:53,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:53,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:53,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:53,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:53,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:53,216 INFO L87 Difference]: Start difference. First operand 199 states and 294 transitions. Second operand 4 states. [2019-09-09 05:54:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:53,544 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2019-09-09 05:54:53,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:53,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-09 05:54:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:53,547 INFO L225 Difference]: With dead ends: 216 [2019-09-09 05:54:53,547 INFO L226 Difference]: Without dead ends: 216 [2019-09-09 05:54:53,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-09 05:54:53,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2019-09-09 05:54:53,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-09 05:54:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 293 transitions. [2019-09-09 05:54:53,555 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 293 transitions. Word has length 81 [2019-09-09 05:54:53,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:53,556 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 293 transitions. [2019-09-09 05:54:53,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:53,556 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 293 transitions. [2019-09-09 05:54:53,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-09 05:54:53,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:53,557 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:53,558 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:53,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:53,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1331436167, now seen corresponding path program 1 times [2019-09-09 05:54:53,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:53,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:53,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:53,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:53,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:53,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:53,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:53,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:53,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:53,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:53,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:53,628 INFO L87 Difference]: Start difference. First operand 199 states and 293 transitions. Second operand 4 states. [2019-09-09 05:54:53,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:53,919 INFO L93 Difference]: Finished difference Result 216 states and 314 transitions. [2019-09-09 05:54:53,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:53,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-09 05:54:53,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:53,922 INFO L225 Difference]: With dead ends: 216 [2019-09-09 05:54:53,922 INFO L226 Difference]: Without dead ends: 216 [2019-09-09 05:54:53,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:53,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-09 05:54:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2019-09-09 05:54:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-09 05:54:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 292 transitions. [2019-09-09 05:54:53,951 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 292 transitions. Word has length 82 [2019-09-09 05:54:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:53,951 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 292 transitions. [2019-09-09 05:54:53,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:53,952 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 292 transitions. [2019-09-09 05:54:53,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-09 05:54:53,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:53,953 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:53,953 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:53,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:53,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1295955682, now seen corresponding path program 1 times [2019-09-09 05:54:53,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:53,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:53,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:53,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:53,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:54,014 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:54,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:54,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:54,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:54,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:54,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:54,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:54,016 INFO L87 Difference]: Start difference. First operand 199 states and 292 transitions. Second operand 4 states. [2019-09-09 05:54:54,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:54,323 INFO L93 Difference]: Finished difference Result 206 states and 301 transitions. [2019-09-09 05:54:54,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:54,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-09 05:54:54,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:54,327 INFO L225 Difference]: With dead ends: 206 [2019-09-09 05:54:54,327 INFO L226 Difference]: Without dead ends: 206 [2019-09-09 05:54:54,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-09 05:54:54,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 199. [2019-09-09 05:54:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-09 05:54:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 291 transitions. [2019-09-09 05:54:54,334 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 291 transitions. Word has length 83 [2019-09-09 05:54:54,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:54,334 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 291 transitions. [2019-09-09 05:54:54,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:54,335 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 291 transitions. [2019-09-09 05:54:54,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-09 05:54:54,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:54,337 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:54,337 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:54,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:54,338 INFO L82 PathProgramCache]: Analyzing trace with hash -738982646, now seen corresponding path program 1 times [2019-09-09 05:54:54,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:54,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:54,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:54,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:54,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:54,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:54,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:54,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:54,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:54,487 INFO L87 Difference]: Start difference. First operand 199 states and 291 transitions. Second operand 4 states. [2019-09-09 05:54:54,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:54,905 INFO L93 Difference]: Finished difference Result 309 states and 460 transitions. [2019-09-09 05:54:54,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:54,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-09 05:54:54,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:54,908 INFO L225 Difference]: With dead ends: 309 [2019-09-09 05:54:54,908 INFO L226 Difference]: Without dead ends: 309 [2019-09-09 05:54:54,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-09 05:54:54,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 240. [2019-09-09 05:54:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-09 05:54:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 364 transitions. [2019-09-09 05:54:54,915 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 364 transitions. Word has length 87 [2019-09-09 05:54:54,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:54,916 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 364 transitions. [2019-09-09 05:54:54,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:54,916 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 364 transitions. [2019-09-09 05:54:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-09 05:54:54,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:54,917 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:54,918 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:54,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:54,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2110789944, now seen corresponding path program 1 times [2019-09-09 05:54:54,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:54,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:54,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:54,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:54,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:54,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:54,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:54,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:54,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:54,990 INFO L87 Difference]: Start difference. First operand 240 states and 364 transitions. Second operand 4 states. [2019-09-09 05:54:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:55,333 INFO L93 Difference]: Finished difference Result 289 states and 437 transitions. [2019-09-09 05:54:55,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:55,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-09 05:54:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:55,335 INFO L225 Difference]: With dead ends: 289 [2019-09-09 05:54:55,336 INFO L226 Difference]: Without dead ends: 289 [2019-09-09 05:54:55,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:55,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-09-09 05:54:55,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 264. [2019-09-09 05:54:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-09 05:54:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 405 transitions. [2019-09-09 05:54:55,344 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 405 transitions. Word has length 87 [2019-09-09 05:54:55,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:55,344 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 405 transitions. [2019-09-09 05:54:55,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:55,345 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 405 transitions. [2019-09-09 05:54:55,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-09 05:54:55,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:55,346 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:55,346 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:55,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:55,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1673898258, now seen corresponding path program 1 times [2019-09-09 05:54:55,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:55,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:55,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:55,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:55,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:55,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:55,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:55,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:55,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:55,439 INFO L87 Difference]: Start difference. First operand 264 states and 405 transitions. Second operand 4 states. [2019-09-09 05:54:55,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:55,910 INFO L93 Difference]: Finished difference Result 326 states and 491 transitions. [2019-09-09 05:54:55,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:55,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-09 05:54:55,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:55,912 INFO L225 Difference]: With dead ends: 326 [2019-09-09 05:54:55,913 INFO L226 Difference]: Without dead ends: 326 [2019-09-09 05:54:55,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-09 05:54:55,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 265. [2019-09-09 05:54:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-09 05:54:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 406 transitions. [2019-09-09 05:54:55,921 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 406 transitions. Word has length 88 [2019-09-09 05:54:55,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:55,922 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 406 transitions. [2019-09-09 05:54:55,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:55,922 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 406 transitions. [2019-09-09 05:54:55,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-09 05:54:55,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:55,924 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:55,924 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:55,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:55,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1009804837, now seen corresponding path program 1 times [2019-09-09 05:54:55,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:55,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:55,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:56,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:56,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:56,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:56,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:56,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:56,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:56,038 INFO L87 Difference]: Start difference. First operand 265 states and 406 transitions. Second operand 4 states. [2019-09-09 05:54:56,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:56,461 INFO L93 Difference]: Finished difference Result 326 states and 490 transitions. [2019-09-09 05:54:56,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:56,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-09 05:54:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:56,465 INFO L225 Difference]: With dead ends: 326 [2019-09-09 05:54:56,465 INFO L226 Difference]: Without dead ends: 326 [2019-09-09 05:54:56,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:56,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-09 05:54:56,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 265. [2019-09-09 05:54:56,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-09 05:54:56,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 405 transitions. [2019-09-09 05:54:56,472 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 405 transitions. Word has length 100 [2019-09-09 05:54:56,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:56,473 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 405 transitions. [2019-09-09 05:54:56,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:56,473 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 405 transitions. [2019-09-09 05:54:56,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-09 05:54:56,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:56,475 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:56,475 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:56,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:56,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1453705511, now seen corresponding path program 1 times [2019-09-09 05:54:56,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:56,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:56,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:56,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:56,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:56,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:56,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:56,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:56,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:56,541 INFO L87 Difference]: Start difference. First operand 265 states and 405 transitions. Second operand 4 states. [2019-09-09 05:54:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:56,891 INFO L93 Difference]: Finished difference Result 290 states and 436 transitions. [2019-09-09 05:54:56,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:56,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-09 05:54:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:56,893 INFO L225 Difference]: With dead ends: 290 [2019-09-09 05:54:56,894 INFO L226 Difference]: Without dead ends: 290 [2019-09-09 05:54:56,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:56,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-09 05:54:56,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 265. [2019-09-09 05:54:56,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-09 05:54:56,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 404 transitions. [2019-09-09 05:54:56,901 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 404 transitions. Word has length 100 [2019-09-09 05:54:56,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:56,901 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 404 transitions. [2019-09-09 05:54:56,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:56,902 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 404 transitions. [2019-09-09 05:54:56,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:54:56,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:56,903 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:56,903 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:56,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:56,904 INFO L82 PathProgramCache]: Analyzing trace with hash 677263077, now seen corresponding path program 1 times [2019-09-09 05:54:56,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:56,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:56,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:56,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:56,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:56,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:56,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:56,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:56,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:56,985 INFO L87 Difference]: Start difference. First operand 265 states and 404 transitions. Second operand 4 states. [2019-09-09 05:54:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:57,514 INFO L93 Difference]: Finished difference Result 325 states and 487 transitions. [2019-09-09 05:54:57,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:57,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-09 05:54:57,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:57,517 INFO L225 Difference]: With dead ends: 325 [2019-09-09 05:54:57,518 INFO L226 Difference]: Without dead ends: 325 [2019-09-09 05:54:57,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:57,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-09 05:54:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 265. [2019-09-09 05:54:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-09 05:54:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 403 transitions. [2019-09-09 05:54:57,526 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 403 transitions. Word has length 101 [2019-09-09 05:54:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:57,526 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 403 transitions. [2019-09-09 05:54:57,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 403 transitions. [2019-09-09 05:54:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:54:57,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:57,528 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:57,528 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:57,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:57,529 INFO L82 PathProgramCache]: Analyzing trace with hash 536536390, now seen corresponding path program 1 times [2019-09-09 05:54:57,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:57,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:57,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:57,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:57,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:57,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:57,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:57,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:57,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:57,618 INFO L87 Difference]: Start difference. First operand 265 states and 403 transitions. Second operand 4 states. [2019-09-09 05:54:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:58,024 INFO L93 Difference]: Finished difference Result 323 states and 484 transitions. [2019-09-09 05:54:58,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:58,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-09 05:54:58,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:58,027 INFO L225 Difference]: With dead ends: 323 [2019-09-09 05:54:58,028 INFO L226 Difference]: Without dead ends: 323 [2019-09-09 05:54:58,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:58,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-09 05:54:58,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 265. [2019-09-09 05:54:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-09 05:54:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 402 transitions. [2019-09-09 05:54:58,038 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 402 transitions. Word has length 101 [2019-09-09 05:54:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:58,038 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 402 transitions. [2019-09-09 05:54:58,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 402 transitions. [2019-09-09 05:54:58,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:54:58,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:58,041 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:58,041 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:58,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:58,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1553282083, now seen corresponding path program 1 times [2019-09-09 05:54:58,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:58,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:58,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:58,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:58,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:58,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:58,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:58,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:58,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:58,152 INFO L87 Difference]: Start difference. First operand 265 states and 402 transitions. Second operand 4 states. [2019-09-09 05:54:58,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:58,433 INFO L93 Difference]: Finished difference Result 289 states and 432 transitions. [2019-09-09 05:54:58,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:58,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-09 05:54:58,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:58,440 INFO L225 Difference]: With dead ends: 289 [2019-09-09 05:54:58,440 INFO L226 Difference]: Without dead ends: 289 [2019-09-09 05:54:58,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:58,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-09-09 05:54:58,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 265. [2019-09-09 05:54:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-09 05:54:58,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 401 transitions. [2019-09-09 05:54:58,447 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 401 transitions. Word has length 101 [2019-09-09 05:54:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:58,447 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 401 transitions. [2019-09-09 05:54:58,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:58,448 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 401 transitions. [2019-09-09 05:54:58,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:54:58,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:58,449 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:58,449 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:58,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:58,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1412555396, now seen corresponding path program 1 times [2019-09-09 05:54:58,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:58,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:58,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:58,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:58,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:58,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:58,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:58,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:58,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:58,511 INFO L87 Difference]: Start difference. First operand 265 states and 401 transitions. Second operand 4 states. [2019-09-09 05:54:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:58,810 INFO L93 Difference]: Finished difference Result 287 states and 429 transitions. [2019-09-09 05:54:58,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:58,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-09 05:54:58,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:58,813 INFO L225 Difference]: With dead ends: 287 [2019-09-09 05:54:58,813 INFO L226 Difference]: Without dead ends: 287 [2019-09-09 05:54:58,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-09 05:54:58,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2019-09-09 05:54:58,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-09 05:54:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 400 transitions. [2019-09-09 05:54:58,819 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 400 transitions. Word has length 101 [2019-09-09 05:54:58,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:58,820 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 400 transitions. [2019-09-09 05:54:58,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 400 transitions. [2019-09-09 05:54:58,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:54:58,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:58,821 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:58,821 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:58,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:58,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1411051272, now seen corresponding path program 1 times [2019-09-09 05:54:58,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:58,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:58,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:58,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:58,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:58,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:58,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:58,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:58,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:58,874 INFO L87 Difference]: Start difference. First operand 265 states and 400 transitions. Second operand 4 states. [2019-09-09 05:54:59,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:59,293 INFO L93 Difference]: Finished difference Result 323 states and 481 transitions. [2019-09-09 05:54:59,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:59,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:54:59,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:59,296 INFO L225 Difference]: With dead ends: 323 [2019-09-09 05:54:59,296 INFO L226 Difference]: Without dead ends: 323 [2019-09-09 05:54:59,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:59,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-09 05:54:59,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 265. [2019-09-09 05:54:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-09 05:54:59,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 399 transitions. [2019-09-09 05:54:59,303 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 399 transitions. Word has length 102 [2019-09-09 05:54:59,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:59,304 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 399 transitions. [2019-09-09 05:54:59,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 399 transitions. [2019-09-09 05:54:59,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:54:59,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:59,305 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:59,306 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:59,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:59,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1497130614, now seen corresponding path program 1 times [2019-09-09 05:54:59,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:59,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:59,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:59,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:59,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:59,366 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:59,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:59,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:59,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:59,367 INFO L87 Difference]: Start difference. First operand 265 states and 399 transitions. Second operand 4 states. [2019-09-09 05:54:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:59,648 INFO L93 Difference]: Finished difference Result 287 states and 427 transitions. [2019-09-09 05:54:59,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:59,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:54:59,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:59,652 INFO L225 Difference]: With dead ends: 287 [2019-09-09 05:54:59,652 INFO L226 Difference]: Without dead ends: 287 [2019-09-09 05:54:59,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:59,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-09 05:54:59,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2019-09-09 05:54:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-09 05:54:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 398 transitions. [2019-09-09 05:54:59,662 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 398 transitions. Word has length 102 [2019-09-09 05:54:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:59,662 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 398 transitions. [2019-09-09 05:54:59,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:59,663 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 398 transitions. [2019-09-09 05:54:59,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:54:59,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:59,664 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:59,664 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:59,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:59,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2115805015, now seen corresponding path program 1 times [2019-09-09 05:54:59,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:59,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:59,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:59,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:59,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:59,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:59,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:59,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:59,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:59,740 INFO L87 Difference]: Start difference. First operand 265 states and 398 transitions. Second operand 4 states. [2019-09-09 05:55:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:00,156 INFO L93 Difference]: Finished difference Result 323 states and 479 transitions. [2019-09-09 05:55:00,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:00,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:55:00,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:00,159 INFO L225 Difference]: With dead ends: 323 [2019-09-09 05:55:00,159 INFO L226 Difference]: Without dead ends: 323 [2019-09-09 05:55:00,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-09 05:55:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 265. [2019-09-09 05:55:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-09 05:55:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 397 transitions. [2019-09-09 05:55:00,168 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 397 transitions. Word has length 103 [2019-09-09 05:55:00,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:00,168 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 397 transitions. [2019-09-09 05:55:00,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 397 transitions. [2019-09-09 05:55:00,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:55:00,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:00,170 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:00,170 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:00,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:00,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2075130265, now seen corresponding path program 1 times [2019-09-09 05:55:00,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:00,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:00,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:00,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:00,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:00,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:00,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:00,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:00,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:00,275 INFO L87 Difference]: Start difference. First operand 265 states and 397 transitions. Second operand 4 states. [2019-09-09 05:55:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:00,563 INFO L93 Difference]: Finished difference Result 287 states and 425 transitions. [2019-09-09 05:55:00,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:00,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:55:00,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:00,566 INFO L225 Difference]: With dead ends: 287 [2019-09-09 05:55:00,566 INFO L226 Difference]: Without dead ends: 287 [2019-09-09 05:55:00,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:00,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-09 05:55:00,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2019-09-09 05:55:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-09 05:55:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 396 transitions. [2019-09-09 05:55:00,575 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 396 transitions. Word has length 103 [2019-09-09 05:55:00,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:00,576 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 396 transitions. [2019-09-09 05:55:00,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:00,576 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 396 transitions. [2019-09-09 05:55:00,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:55:00,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:00,577 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:00,577 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:00,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:00,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1485562477, now seen corresponding path program 1 times [2019-09-09 05:55:00,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:00,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:00,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:00,646 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:00,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:00,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:00,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:00,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:00,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:00,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:00,648 INFO L87 Difference]: Start difference. First operand 265 states and 396 transitions. Second operand 4 states. [2019-09-09 05:55:01,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:01,041 INFO L93 Difference]: Finished difference Result 323 states and 477 transitions. [2019-09-09 05:55:01,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:01,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:55:01,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:01,044 INFO L225 Difference]: With dead ends: 323 [2019-09-09 05:55:01,044 INFO L226 Difference]: Without dead ends: 323 [2019-09-09 05:55:01,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:01,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-09 05:55:01,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 265. [2019-09-09 05:55:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-09 05:55:01,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 395 transitions. [2019-09-09 05:55:01,050 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 395 transitions. Word has length 104 [2019-09-09 05:55:01,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:01,050 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 395 transitions. [2019-09-09 05:55:01,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:01,050 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 395 transitions. [2019-09-09 05:55:01,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:55:01,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:01,052 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:01,052 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:01,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:01,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1548487569, now seen corresponding path program 1 times [2019-09-09 05:55:01,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:01,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:01,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:01,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:01,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:01,121 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:01,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:01,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:01,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:01,122 INFO L87 Difference]: Start difference. First operand 265 states and 395 transitions. Second operand 4 states. [2019-09-09 05:55:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:01,405 INFO L93 Difference]: Finished difference Result 287 states and 423 transitions. [2019-09-09 05:55:01,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:01,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:55:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:01,408 INFO L225 Difference]: With dead ends: 287 [2019-09-09 05:55:01,408 INFO L226 Difference]: Without dead ends: 287 [2019-09-09 05:55:01,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:01,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-09 05:55:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2019-09-09 05:55:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-09 05:55:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 394 transitions. [2019-09-09 05:55:01,414 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 394 transitions. Word has length 104 [2019-09-09 05:55:01,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:01,415 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 394 transitions. [2019-09-09 05:55:01,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 394 transitions. [2019-09-09 05:55:01,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:55:01,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:01,416 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:01,417 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:01,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:01,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1571399570, now seen corresponding path program 1 times [2019-09-09 05:55:01,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:01,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:01,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:01,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:01,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:01,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:01,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:01,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:01,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:01,504 INFO L87 Difference]: Start difference. First operand 265 states and 394 transitions. Second operand 4 states. [2019-09-09 05:55:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:01,877 INFO L93 Difference]: Finished difference Result 313 states and 463 transitions. [2019-09-09 05:55:01,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:01,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-09 05:55:01,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:01,880 INFO L225 Difference]: With dead ends: 313 [2019-09-09 05:55:01,880 INFO L226 Difference]: Without dead ends: 313 [2019-09-09 05:55:01,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:01,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-09 05:55:01,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 265. [2019-09-09 05:55:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-09 05:55:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 393 transitions. [2019-09-09 05:55:01,885 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 393 transitions. Word has length 105 [2019-09-09 05:55:01,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:01,886 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 393 transitions. [2019-09-09 05:55:01,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 393 transitions. [2019-09-09 05:55:01,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:55:01,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:01,887 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:01,888 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:01,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:01,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1137670484, now seen corresponding path program 1 times [2019-09-09 05:55:01,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:01,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:01,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:01,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:01,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:01,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:01,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:01,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:01,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:01,952 INFO L87 Difference]: Start difference. First operand 265 states and 393 transitions. Second operand 4 states. [2019-09-09 05:55:02,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:02,233 INFO L93 Difference]: Finished difference Result 277 states and 409 transitions. [2019-09-09 05:55:02,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:02,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-09 05:55:02,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:02,235 INFO L225 Difference]: With dead ends: 277 [2019-09-09 05:55:02,236 INFO L226 Difference]: Without dead ends: 277 [2019-09-09 05:55:02,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-09 05:55:02,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 265. [2019-09-09 05:55:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-09 05:55:02,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 392 transitions. [2019-09-09 05:55:02,241 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 392 transitions. Word has length 105 [2019-09-09 05:55:02,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:02,242 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 392 transitions. [2019-09-09 05:55:02,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 392 transitions. [2019-09-09 05:55:02,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-09 05:55:02,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:02,243 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:02,244 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:02,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:02,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1490379256, now seen corresponding path program 1 times [2019-09-09 05:55:02,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:02,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:02,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:02,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:02,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:02,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:02,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:02,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:02,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:02,337 INFO L87 Difference]: Start difference. First operand 265 states and 392 transitions. Second operand 4 states. [2019-09-09 05:55:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:02,721 INFO L93 Difference]: Finished difference Result 313 states and 461 transitions. [2019-09-09 05:55:02,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:02,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-09 05:55:02,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:02,724 INFO L225 Difference]: With dead ends: 313 [2019-09-09 05:55:02,724 INFO L226 Difference]: Without dead ends: 313 [2019-09-09 05:55:02,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:02,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-09 05:55:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 265. [2019-09-09 05:55:02,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-09 05:55:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 391 transitions. [2019-09-09 05:55:02,730 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 391 transitions. Word has length 109 [2019-09-09 05:55:02,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:02,731 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 391 transitions. [2019-09-09 05:55:02,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:02,731 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 391 transitions. [2019-09-09 05:55:02,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-09 05:55:02,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:02,732 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:02,732 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:02,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:02,733 INFO L82 PathProgramCache]: Analyzing trace with hash -811107002, now seen corresponding path program 1 times [2019-09-09 05:55:02,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:02,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:02,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:02,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:02,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:02,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:02,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:02,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:02,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:02,802 INFO L87 Difference]: Start difference. First operand 265 states and 391 transitions. Second operand 4 states. [2019-09-09 05:55:03,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:03,163 INFO L93 Difference]: Finished difference Result 318 states and 471 transitions. [2019-09-09 05:55:03,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:03,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-09 05:55:03,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:03,165 INFO L225 Difference]: With dead ends: 318 [2019-09-09 05:55:03,165 INFO L226 Difference]: Without dead ends: 318 [2019-09-09 05:55:03,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:03,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-09 05:55:03,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 291. [2019-09-09 05:55:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-09 05:55:03,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 436 transitions. [2019-09-09 05:55:03,171 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 436 transitions. Word has length 109 [2019-09-09 05:55:03,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:03,171 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 436 transitions. [2019-09-09 05:55:03,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 436 transitions. [2019-09-09 05:55:03,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-09 05:55:03,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:03,172 INFO L399 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, 1] [2019-09-09 05:55:03,173 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:03,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:03,173 INFO L82 PathProgramCache]: Analyzing trace with hash 276441320, now seen corresponding path program 1 times [2019-09-09 05:55:03,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:03,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:03,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:03,244 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-09 05:55:03,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:03,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:03,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:03,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:03,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:03,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:03,246 INFO L87 Difference]: Start difference. First operand 291 states and 436 transitions. Second operand 4 states. [2019-09-09 05:55:03,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:03,628 INFO L93 Difference]: Finished difference Result 339 states and 505 transitions. [2019-09-09 05:55:03,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:03,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-09 05:55:03,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:03,631 INFO L225 Difference]: With dead ends: 339 [2019-09-09 05:55:03,631 INFO L226 Difference]: Without dead ends: 339 [2019-09-09 05:55:03,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:03,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-09 05:55:03,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 291. [2019-09-09 05:55:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-09 05:55:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 435 transitions. [2019-09-09 05:55:03,637 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 435 transitions. Word has length 112 [2019-09-09 05:55:03,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:03,638 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 435 transitions. [2019-09-09 05:55:03,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:03,638 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2019-09-09 05:55:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-09 05:55:03,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:03,639 INFO L399 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, 1] [2019-09-09 05:55:03,640 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:03,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:03,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2133224009, now seen corresponding path program 1 times [2019-09-09 05:55:03,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:03,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:03,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:03,727 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-09 05:55:03,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:03,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:03,728 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:03,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:03,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:03,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:03,730 INFO L87 Difference]: Start difference. First operand 291 states and 435 transitions. Second operand 4 states. [2019-09-09 05:55:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:04,089 INFO L93 Difference]: Finished difference Result 331 states and 491 transitions. [2019-09-09 05:55:04,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:04,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-09 05:55:04,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:04,091 INFO L225 Difference]: With dead ends: 331 [2019-09-09 05:55:04,091 INFO L226 Difference]: Without dead ends: 331 [2019-09-09 05:55:04,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-09 05:55:04,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2019-09-09 05:55:04,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-09 05:55:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 434 transitions. [2019-09-09 05:55:04,098 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 434 transitions. Word has length 113 [2019-09-09 05:55:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:04,098 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 434 transitions. [2019-09-09 05:55:04,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:04,098 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 434 transitions. [2019-09-09 05:55:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-09 05:55:04,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:04,100 INFO L399 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, 1] [2019-09-09 05:55:04,100 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:04,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:04,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1030634824, now seen corresponding path program 1 times [2019-09-09 05:55:04,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:04,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:04,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:04,167 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-09 05:55:04,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:04,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:04,168 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:04,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:04,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:04,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:04,169 INFO L87 Difference]: Start difference. First operand 291 states and 434 transitions. Second operand 4 states. [2019-09-09 05:55:04,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:04,495 INFO L93 Difference]: Finished difference Result 331 states and 490 transitions. [2019-09-09 05:55:04,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:04,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-09 05:55:04,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:04,498 INFO L225 Difference]: With dead ends: 331 [2019-09-09 05:55:04,499 INFO L226 Difference]: Without dead ends: 331 [2019-09-09 05:55:04,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:04,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-09 05:55:04,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2019-09-09 05:55:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-09 05:55:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 433 transitions. [2019-09-09 05:55:04,505 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 433 transitions. Word has length 114 [2019-09-09 05:55:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:04,506 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 433 transitions. [2019-09-09 05:55:04,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 433 transitions. [2019-09-09 05:55:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-09 05:55:04,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:04,508 INFO L399 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, 1] [2019-09-09 05:55:04,508 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:04,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:04,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1294274259, now seen corresponding path program 1 times [2019-09-09 05:55:04,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:04,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:04,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:04,597 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-09 05:55:04,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:04,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:04,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:04,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:04,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:04,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:04,599 INFO L87 Difference]: Start difference. First operand 291 states and 433 transitions. Second operand 4 states. [2019-09-09 05:55:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:04,999 INFO L93 Difference]: Finished difference Result 331 states and 489 transitions. [2019-09-09 05:55:04,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:04,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-09 05:55:04,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:05,001 INFO L225 Difference]: With dead ends: 331 [2019-09-09 05:55:05,001 INFO L226 Difference]: Without dead ends: 331 [2019-09-09 05:55:05,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-09 05:55:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2019-09-09 05:55:05,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-09 05:55:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 432 transitions. [2019-09-09 05:55:05,007 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 432 transitions. Word has length 115 [2019-09-09 05:55:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:05,007 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 432 transitions. [2019-09-09 05:55:05,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 432 transitions. [2019-09-09 05:55:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-09 05:55:05,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:05,009 INFO L399 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, 1] [2019-09-09 05:55:05,009 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:05,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:05,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1775596791, now seen corresponding path program 1 times [2019-09-09 05:55:05,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:05,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:05,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:05,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:05,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:05,077 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-09 05:55:05,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:05,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:05,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:05,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:05,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:05,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:05,079 INFO L87 Difference]: Start difference. First operand 291 states and 432 transitions. Second operand 4 states. [2019-09-09 05:55:05,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:05,417 INFO L93 Difference]: Finished difference Result 329 states and 486 transitions. [2019-09-09 05:55:05,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:05,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-09 05:55:05,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:05,419 INFO L225 Difference]: With dead ends: 329 [2019-09-09 05:55:05,419 INFO L226 Difference]: Without dead ends: 329 [2019-09-09 05:55:05,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:05,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-09-09 05:55:05,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 291. [2019-09-09 05:55:05,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-09 05:55:05,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 431 transitions. [2019-09-09 05:55:05,424 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 431 transitions. Word has length 115 [2019-09-09 05:55:05,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:05,425 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 431 transitions. [2019-09-09 05:55:05,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:05,425 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 431 transitions. [2019-09-09 05:55:05,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-09 05:55:05,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:05,426 INFO L399 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, 1] [2019-09-09 05:55:05,426 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:05,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:05,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1729140110, now seen corresponding path program 1 times [2019-09-09 05:55:05,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:05,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:05,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:05,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:05,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:05,504 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-09 05:55:05,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:05,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:05,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:05,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:05,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:05,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:05,505 INFO L87 Difference]: Start difference. First operand 291 states and 431 transitions. Second operand 4 states. [2019-09-09 05:55:05,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:05,826 INFO L93 Difference]: Finished difference Result 327 states and 482 transitions. [2019-09-09 05:55:05,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:05,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-09 05:55:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:05,829 INFO L225 Difference]: With dead ends: 327 [2019-09-09 05:55:05,830 INFO L226 Difference]: Without dead ends: 327 [2019-09-09 05:55:05,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:05,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-09 05:55:05,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 291. [2019-09-09 05:55:05,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-09 05:55:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 430 transitions. [2019-09-09 05:55:05,835 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 430 transitions. Word has length 116 [2019-09-09 05:55:05,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:05,836 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 430 transitions. [2019-09-09 05:55:05,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:05,836 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 430 transitions. [2019-09-09 05:55:05,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-09 05:55:05,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:05,837 INFO L399 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, 1] [2019-09-09 05:55:05,837 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:05,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:05,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1157338966, now seen corresponding path program 1 times [2019-09-09 05:55:05,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:05,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:05,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:05,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:05,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:05,913 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-09 05:55:05,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:05,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:05,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:05,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:05,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:05,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:05,915 INFO L87 Difference]: Start difference. First operand 291 states and 430 transitions. Second operand 4 states. [2019-09-09 05:55:06,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:06,231 INFO L93 Difference]: Finished difference Result 324 states and 477 transitions. [2019-09-09 05:55:06,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:06,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-09 05:55:06,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:06,233 INFO L225 Difference]: With dead ends: 324 [2019-09-09 05:55:06,233 INFO L226 Difference]: Without dead ends: 324 [2019-09-09 05:55:06,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:06,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-09 05:55:06,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 291. [2019-09-09 05:55:06,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-09 05:55:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 429 transitions. [2019-09-09 05:55:06,239 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 429 transitions. Word has length 116 [2019-09-09 05:55:06,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:06,239 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 429 transitions. [2019-09-09 05:55:06,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 429 transitions. [2019-09-09 05:55:06,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-09 05:55:06,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:06,241 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:06,241 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:06,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1621463217, now seen corresponding path program 1 times [2019-09-09 05:55:06,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:06,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:06,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:06,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:06,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:06,315 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-09 05:55:06,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:06,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:06,316 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:06,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:06,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:06,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:06,317 INFO L87 Difference]: Start difference. First operand 291 states and 429 transitions. Second operand 4 states. [2019-09-09 05:55:06,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:06,645 INFO L93 Difference]: Finished difference Result 324 states and 476 transitions. [2019-09-09 05:55:06,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:06,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-09-09 05:55:06,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:06,648 INFO L225 Difference]: With dead ends: 324 [2019-09-09 05:55:06,648 INFO L226 Difference]: Without dead ends: 324 [2019-09-09 05:55:06,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:06,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-09 05:55:06,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 291. [2019-09-09 05:55:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-09 05:55:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 428 transitions. [2019-09-09 05:55:06,654 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 428 transitions. Word has length 119 [2019-09-09 05:55:06,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:06,654 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 428 transitions. [2019-09-09 05:55:06,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:06,654 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 428 transitions. [2019-09-09 05:55:06,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-09 05:55:06,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:06,655 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:06,656 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:06,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:06,656 INFO L82 PathProgramCache]: Analyzing trace with hash 435271861, now seen corresponding path program 1 times [2019-09-09 05:55:06,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:06,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:06,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:06,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:06,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:06,736 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-09 05:55:06,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:06,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:06,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:06,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:06,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:06,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:06,738 INFO L87 Difference]: Start difference. First operand 291 states and 428 transitions. Second operand 4 states. [2019-09-09 05:55:07,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:07,116 INFO L93 Difference]: Finished difference Result 318 states and 466 transitions. [2019-09-09 05:55:07,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:07,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-09 05:55:07,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:07,119 INFO L225 Difference]: With dead ends: 318 [2019-09-09 05:55:07,119 INFO L226 Difference]: Without dead ends: 318 [2019-09-09 05:55:07,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-09 05:55:07,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 291. [2019-09-09 05:55:07,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-09 05:55:07,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 427 transitions. [2019-09-09 05:55:07,124 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 427 transitions. Word has length 120 [2019-09-09 05:55:07,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:07,124 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 427 transitions. [2019-09-09 05:55:07,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:07,124 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 427 transitions. [2019-09-09 05:55:07,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-09 05:55:07,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:07,125 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:07,126 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:07,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:07,126 INFO L82 PathProgramCache]: Analyzing trace with hash -407228904, now seen corresponding path program 1 times [2019-09-09 05:55:07,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:07,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:07,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:07,203 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-09 05:55:07,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:07,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:07,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:07,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:07,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:07,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:07,204 INFO L87 Difference]: Start difference. First operand 291 states and 427 transitions. Second operand 4 states. [2019-09-09 05:55:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:07,498 INFO L93 Difference]: Finished difference Result 318 states and 465 transitions. [2019-09-09 05:55:07,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:07,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-09 05:55:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:07,502 INFO L225 Difference]: With dead ends: 318 [2019-09-09 05:55:07,502 INFO L226 Difference]: Without dead ends: 318 [2019-09-09 05:55:07,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:07,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-09 05:55:07,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 291. [2019-09-09 05:55:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-09 05:55:07,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 426 transitions. [2019-09-09 05:55:07,507 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 426 transitions. Word has length 120 [2019-09-09 05:55:07,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:07,507 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 426 transitions. [2019-09-09 05:55:07,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:07,507 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 426 transitions. [2019-09-09 05:55:07,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-09 05:55:07,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:07,508 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:07,509 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:07,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:07,509 INFO L82 PathProgramCache]: Analyzing trace with hash -147572236, now seen corresponding path program 1 times [2019-09-09 05:55:07,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:07,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:07,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:07,587 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-09 05:55:07,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:07,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:07,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:07,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:07,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:07,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:07,589 INFO L87 Difference]: Start difference. First operand 291 states and 426 transitions. Second operand 4 states. [2019-09-09 05:55:07,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:07,994 INFO L93 Difference]: Finished difference Result 315 states and 460 transitions. [2019-09-09 05:55:07,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:07,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-09 05:55:07,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:07,997 INFO L225 Difference]: With dead ends: 315 [2019-09-09 05:55:07,997 INFO L226 Difference]: Without dead ends: 315 [2019-09-09 05:55:07,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:07,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-09 05:55:08,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 291. [2019-09-09 05:55:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-09 05:55:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 425 transitions. [2019-09-09 05:55:08,005 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 425 transitions. Word has length 121 [2019-09-09 05:55:08,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:08,005 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 425 transitions. [2019-09-09 05:55:08,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:08,006 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2019-09-09 05:55:08,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-09 05:55:08,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:08,007 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:08,007 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:08,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:08,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1045845024, now seen corresponding path program 1 times [2019-09-09 05:55:08,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:08,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:08,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:08,095 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-09 05:55:08,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:08,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:08,096 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:08,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:08,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:08,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:08,097 INFO L87 Difference]: Start difference. First operand 291 states and 425 transitions. Second operand 4 states. [2019-09-09 05:55:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:08,405 INFO L93 Difference]: Finished difference Result 315 states and 459 transitions. [2019-09-09 05:55:08,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:08,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-09 05:55:08,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:08,408 INFO L225 Difference]: With dead ends: 315 [2019-09-09 05:55:08,408 INFO L226 Difference]: Without dead ends: 315 [2019-09-09 05:55:08,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-09 05:55:08,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 291. [2019-09-09 05:55:08,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-09 05:55:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 424 transitions. [2019-09-09 05:55:08,413 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 424 transitions. Word has length 122 [2019-09-09 05:55:08,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:08,413 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 424 transitions. [2019-09-09 05:55:08,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:08,413 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 424 transitions. [2019-09-09 05:55:08,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-09 05:55:08,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:08,414 INFO L399 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, 1] [2019-09-09 05:55:08,415 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:08,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:08,415 INFO L82 PathProgramCache]: Analyzing trace with hash 31141737, now seen corresponding path program 1 times [2019-09-09 05:55:08,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:08,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:08,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:08,492 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-09 05:55:08,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:08,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:08,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:08,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:08,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:08,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:08,494 INFO L87 Difference]: Start difference. First operand 291 states and 424 transitions. Second operand 4 states. [2019-09-09 05:55:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:08,881 INFO L93 Difference]: Finished difference Result 363 states and 535 transitions. [2019-09-09 05:55:08,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:08,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-09 05:55:08,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:08,883 INFO L225 Difference]: With dead ends: 363 [2019-09-09 05:55:08,883 INFO L226 Difference]: Without dead ends: 363 [2019-09-09 05:55:08,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:08,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-09 05:55:08,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 323. [2019-09-09 05:55:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-09-09 05:55:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 481 transitions. [2019-09-09 05:55:08,888 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 481 transitions. Word has length 122 [2019-09-09 05:55:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:08,889 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 481 transitions. [2019-09-09 05:55:08,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 481 transitions. [2019-09-09 05:55:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-09 05:55:08,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:08,890 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:08,891 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:08,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:08,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2047960092, now seen corresponding path program 1 times [2019-09-09 05:55:08,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:08,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:08,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:08,967 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-09 05:55:08,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:08,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:08,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:08,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:08,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:08,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:08,969 INFO L87 Difference]: Start difference. First operand 323 states and 481 transitions. Second operand 4 states. [2019-09-09 05:55:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:09,294 INFO L93 Difference]: Finished difference Result 344 states and 511 transitions. [2019-09-09 05:55:09,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:09,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-09 05:55:09,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:09,299 INFO L225 Difference]: With dead ends: 344 [2019-09-09 05:55:09,299 INFO L226 Difference]: Without dead ends: 344 [2019-09-09 05:55:09,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-09-09 05:55:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 323. [2019-09-09 05:55:09,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-09-09 05:55:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 480 transitions. [2019-09-09 05:55:09,308 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 480 transitions. Word has length 123 [2019-09-09 05:55:09,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:09,308 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 480 transitions. [2019-09-09 05:55:09,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 480 transitions. [2019-09-09 05:55:09,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-09 05:55:09,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:09,312 INFO L399 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-09 05:55:09,312 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:09,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:09,314 INFO L82 PathProgramCache]: Analyzing trace with hash 403478049, now seen corresponding path program 1 times [2019-09-09 05:55:09,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:09,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:09,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:09,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:09,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:09,456 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-09 05:55:09,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:09,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:09,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:09,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:09,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:09,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:09,458 INFO L87 Difference]: Start difference. First operand 323 states and 480 transitions. Second operand 4 states. [2019-09-09 05:55:09,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:09,888 INFO L93 Difference]: Finished difference Result 431 states and 647 transitions. [2019-09-09 05:55:09,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:09,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-09 05:55:09,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:09,891 INFO L225 Difference]: With dead ends: 431 [2019-09-09 05:55:09,891 INFO L226 Difference]: Without dead ends: 431 [2019-09-09 05:55:09,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:09,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-09-09 05:55:09,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 362. [2019-09-09 05:55:09,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-09 05:55:09,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 551 transitions. [2019-09-09 05:55:09,897 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 551 transitions. Word has length 123 [2019-09-09 05:55:09,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:09,898 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 551 transitions. [2019-09-09 05:55:09,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:09,898 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 551 transitions. [2019-09-09 05:55:09,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-09 05:55:09,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:09,899 INFO L399 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, 1] [2019-09-09 05:55:09,899 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:09,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:09,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1513649996, now seen corresponding path program 1 times [2019-09-09 05:55:09,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:09,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:09,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:09,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:09,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:09,974 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-09 05:55:09,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:09,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:09,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:09,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:09,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:09,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:09,976 INFO L87 Difference]: Start difference. First operand 362 states and 551 transitions. Second operand 4 states. [2019-09-09 05:55:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:10,347 INFO L93 Difference]: Finished difference Result 389 states and 585 transitions. [2019-09-09 05:55:10,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:10,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-09 05:55:10,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:10,349 INFO L225 Difference]: With dead ends: 389 [2019-09-09 05:55:10,349 INFO L226 Difference]: Without dead ends: 389 [2019-09-09 05:55:10,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:10,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-09-09 05:55:10,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 362. [2019-09-09 05:55:10,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-09 05:55:10,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 550 transitions. [2019-09-09 05:55:10,354 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 550 transitions. Word has length 124 [2019-09-09 05:55:10,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:10,355 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 550 transitions. [2019-09-09 05:55:10,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:10,355 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 550 transitions. [2019-09-09 05:55:10,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-09 05:55:10,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:10,356 INFO L399 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, 1] [2019-09-09 05:55:10,356 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:10,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:10,356 INFO L82 PathProgramCache]: Analyzing trace with hash -617355081, now seen corresponding path program 1 times [2019-09-09 05:55:10,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:10,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:10,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:10,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:10,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:10,446 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-09 05:55:10,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:10,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:10,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:10,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:10,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:10,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:10,448 INFO L87 Difference]: Start difference. First operand 362 states and 550 transitions. Second operand 4 states. [2019-09-09 05:55:10,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:10,861 INFO L93 Difference]: Finished difference Result 424 states and 636 transitions. [2019-09-09 05:55:10,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:10,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-09 05:55:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:10,865 INFO L225 Difference]: With dead ends: 424 [2019-09-09 05:55:10,865 INFO L226 Difference]: Without dead ends: 424 [2019-09-09 05:55:10,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:10,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-09 05:55:10,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 361. [2019-09-09 05:55:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-09 05:55:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 549 transitions. [2019-09-09 05:55:10,870 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 549 transitions. Word has length 124 [2019-09-09 05:55:10,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:10,870 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 549 transitions. [2019-09-09 05:55:10,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 549 transitions. [2019-09-09 05:55:10,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-09 05:55:10,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:10,872 INFO L399 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, 1] [2019-09-09 05:55:10,872 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:10,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:10,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1064755429, now seen corresponding path program 1 times [2019-09-09 05:55:10,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:10,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:10,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:10,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:10,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:10,939 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-09 05:55:10,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:10,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:10,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:10,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:10,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:10,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:10,940 INFO L87 Difference]: Start difference. First operand 361 states and 549 transitions. Second operand 4 states. [2019-09-09 05:55:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:11,236 INFO L93 Difference]: Finished difference Result 388 states and 583 transitions. [2019-09-09 05:55:11,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:11,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-09 05:55:11,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:11,238 INFO L225 Difference]: With dead ends: 388 [2019-09-09 05:55:11,238 INFO L226 Difference]: Without dead ends: 388 [2019-09-09 05:55:11,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:11,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-09-09 05:55:11,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 361. [2019-09-09 05:55:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-09 05:55:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 548 transitions. [2019-09-09 05:55:11,244 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 548 transitions. Word has length 125 [2019-09-09 05:55:11,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:11,244 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 548 transitions. [2019-09-09 05:55:11,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 548 transitions. [2019-09-09 05:55:11,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-09 05:55:11,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:11,245 INFO L399 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, 1] [2019-09-09 05:55:11,245 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:11,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:11,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1298688433, now seen corresponding path program 1 times [2019-09-09 05:55:11,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:11,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:11,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:11,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:11,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:11,307 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-09 05:55:11,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:11,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:11,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:11,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:11,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:11,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:11,308 INFO L87 Difference]: Start difference. First operand 361 states and 548 transitions. Second operand 4 states. [2019-09-09 05:55:11,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:11,609 INFO L93 Difference]: Finished difference Result 388 states and 582 transitions. [2019-09-09 05:55:11,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:11,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-09 05:55:11,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:11,611 INFO L225 Difference]: With dead ends: 388 [2019-09-09 05:55:11,612 INFO L226 Difference]: Without dead ends: 388 [2019-09-09 05:55:11,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:11,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-09-09 05:55:11,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 361. [2019-09-09 05:55:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-09 05:55:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 547 transitions. [2019-09-09 05:55:11,617 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 547 transitions. Word has length 126 [2019-09-09 05:55:11,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:11,617 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 547 transitions. [2019-09-09 05:55:11,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 547 transitions. [2019-09-09 05:55:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-09 05:55:11,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:11,618 INFO L399 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, 1] [2019-09-09 05:55:11,619 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:11,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:11,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1225439658, now seen corresponding path program 1 times [2019-09-09 05:55:11,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:11,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:11,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:11,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:11,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:11,677 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-09 05:55:11,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:11,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:11,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:11,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:11,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:11,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:11,678 INFO L87 Difference]: Start difference. First operand 361 states and 547 transitions. Second operand 4 states. [2019-09-09 05:55:11,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:11,963 INFO L93 Difference]: Finished difference Result 378 states and 569 transitions. [2019-09-09 05:55:11,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:11,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-09 05:55:11,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:11,971 INFO L225 Difference]: With dead ends: 378 [2019-09-09 05:55:11,971 INFO L226 Difference]: Without dead ends: 378 [2019-09-09 05:55:11,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:11,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-09 05:55:11,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 361. [2019-09-09 05:55:11,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-09 05:55:11,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 546 transitions. [2019-09-09 05:55:11,976 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 546 transitions. Word has length 127 [2019-09-09 05:55:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:11,976 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 546 transitions. [2019-09-09 05:55:11,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:11,976 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 546 transitions. [2019-09-09 05:55:11,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-09 05:55:11,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:11,977 INFO L399 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] [2019-09-09 05:55:11,978 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:11,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:11,978 INFO L82 PathProgramCache]: Analyzing trace with hash 2082154556, now seen corresponding path program 1 times [2019-09-09 05:55:11,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:11,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:11,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:11,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:11,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:12,048 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-09 05:55:12,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:12,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:12,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:12,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:12,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:12,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:12,050 INFO L87 Difference]: Start difference. First operand 361 states and 546 transitions. Second operand 3 states. [2019-09-09 05:55:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:12,150 INFO L93 Difference]: Finished difference Result 693 states and 1047 transitions. [2019-09-09 05:55:12,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:12,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-09 05:55:12,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:12,154 INFO L225 Difference]: With dead ends: 693 [2019-09-09 05:55:12,154 INFO L226 Difference]: Without dead ends: 693 [2019-09-09 05:55:12,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:12,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2019-09-09 05:55:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 691. [2019-09-09 05:55:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-09-09 05:55:12,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1046 transitions. [2019-09-09 05:55:12,167 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1046 transitions. Word has length 128 [2019-09-09 05:55:12,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:12,167 INFO L475 AbstractCegarLoop]: Abstraction has 691 states and 1046 transitions. [2019-09-09 05:55:12,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:12,167 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1046 transitions. [2019-09-09 05:55:12,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-09 05:55:12,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:12,169 INFO L399 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-09 05:55:12,169 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:12,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:12,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2048871508, now seen corresponding path program 1 times [2019-09-09 05:55:12,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:12,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:12,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:12,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:12,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:12,252 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-09 05:55:12,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:12,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:12,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:12,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:12,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:12,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:12,253 INFO L87 Difference]: Start difference. First operand 691 states and 1046 transitions. Second operand 4 states. [2019-09-09 05:55:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:12,696 INFO L93 Difference]: Finished difference Result 903 states and 1368 transitions. [2019-09-09 05:55:12,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:12,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-09 05:55:12,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:12,701 INFO L225 Difference]: With dead ends: 903 [2019-09-09 05:55:12,701 INFO L226 Difference]: Without dead ends: 903 [2019-09-09 05:55:12,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:12,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-09-09 05:55:12,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 769. [2019-09-09 05:55:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-09-09 05:55:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1188 transitions. [2019-09-09 05:55:12,709 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1188 transitions. Word has length 129 [2019-09-09 05:55:12,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:12,709 INFO L475 AbstractCegarLoop]: Abstraction has 769 states and 1188 transitions. [2019-09-09 05:55:12,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1188 transitions. [2019-09-09 05:55:12,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-09 05:55:12,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:12,711 INFO L399 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, 1, 1] [2019-09-09 05:55:12,711 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:12,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:12,711 INFO L82 PathProgramCache]: Analyzing trace with hash 669219980, now seen corresponding path program 1 times [2019-09-09 05:55:12,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:12,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:12,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:12,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:12,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:12,775 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-09 05:55:12,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:12,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:12,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:12,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:12,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:12,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:12,776 INFO L87 Difference]: Start difference. First operand 769 states and 1188 transitions. Second operand 4 states. [2019-09-09 05:55:13,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:13,213 INFO L93 Difference]: Finished difference Result 893 states and 1354 transitions. [2019-09-09 05:55:13,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:13,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-09 05:55:13,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:13,218 INFO L225 Difference]: With dead ends: 893 [2019-09-09 05:55:13,218 INFO L226 Difference]: Without dead ends: 893 [2019-09-09 05:55:13,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:13,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-09-09 05:55:13,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 691. [2019-09-09 05:55:13,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-09-09 05:55:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1046 transitions. [2019-09-09 05:55:13,226 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1046 transitions. Word has length 130 [2019-09-09 05:55:13,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:13,227 INFO L475 AbstractCegarLoop]: Abstraction has 691 states and 1046 transitions. [2019-09-09 05:55:13,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1046 transitions. [2019-09-09 05:55:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-09 05:55:13,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:13,228 INFO L399 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, 1, 1] [2019-09-09 05:55:13,228 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:13,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:13,229 INFO L82 PathProgramCache]: Analyzing trace with hash 428482225, now seen corresponding path program 1 times [2019-09-09 05:55:13,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:13,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:13,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:13,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:13,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:13,305 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-09 05:55:13,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:13,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:13,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:13,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:13,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:13,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:13,307 INFO L87 Difference]: Start difference. First operand 691 states and 1046 transitions. Second operand 4 states. [2019-09-09 05:55:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:13,601 INFO L93 Difference]: Finished difference Result 723 states and 1088 transitions. [2019-09-09 05:55:13,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:13,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-09 05:55:13,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:13,604 INFO L225 Difference]: With dead ends: 723 [2019-09-09 05:55:13,604 INFO L226 Difference]: Without dead ends: 723 [2019-09-09 05:55:13,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:13,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-09-09 05:55:13,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 697. [2019-09-09 05:55:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-09 05:55:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1052 transitions. [2019-09-09 05:55:13,612 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1052 transitions. Word has length 131 [2019-09-09 05:55:13,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:13,612 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 1052 transitions. [2019-09-09 05:55:13,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:13,612 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1052 transitions. [2019-09-09 05:55:13,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-09 05:55:13,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:13,614 INFO L399 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, 1] [2019-09-09 05:55:13,614 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:13,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:13,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1591466697, now seen corresponding path program 1 times [2019-09-09 05:55:13,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:13,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:13,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:13,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:13,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:13,674 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-09 05:55:13,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:13,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:13,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:13,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:13,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:13,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:13,675 INFO L87 Difference]: Start difference. First operand 697 states and 1052 transitions. Second operand 4 states. [2019-09-09 05:55:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:13,962 INFO L93 Difference]: Finished difference Result 731 states and 1096 transitions. [2019-09-09 05:55:13,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:13,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-09-09 05:55:13,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:13,966 INFO L225 Difference]: With dead ends: 731 [2019-09-09 05:55:13,967 INFO L226 Difference]: Without dead ends: 731 [2019-09-09 05:55:13,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:13,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-09-09 05:55:13,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 697. [2019-09-09 05:55:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-09 05:55:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1050 transitions. [2019-09-09 05:55:13,974 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1050 transitions. Word has length 137 [2019-09-09 05:55:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:13,974 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 1050 transitions. [2019-09-09 05:55:13,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1050 transitions. [2019-09-09 05:55:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-09 05:55:13,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:13,975 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:13,975 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:13,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:13,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1339157233, now seen corresponding path program 1 times [2019-09-09 05:55:13,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:13,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:13,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:13,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:13,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:14,044 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:14,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:14,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:14,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:14,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:14,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:14,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:14,046 INFO L87 Difference]: Start difference. First operand 697 states and 1050 transitions. Second operand 4 states. [2019-09-09 05:55:14,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:14,426 INFO L93 Difference]: Finished difference Result 823 states and 1244 transitions. [2019-09-09 05:55:14,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:14,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-09-09 05:55:14,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:14,430 INFO L225 Difference]: With dead ends: 823 [2019-09-09 05:55:14,431 INFO L226 Difference]: Without dead ends: 823 [2019-09-09 05:55:14,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:14,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2019-09-09 05:55:14,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 753. [2019-09-09 05:55:14,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-09-09 05:55:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1148 transitions. [2019-09-09 05:55:14,442 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1148 transitions. Word has length 137 [2019-09-09 05:55:14,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:14,442 INFO L475 AbstractCegarLoop]: Abstraction has 753 states and 1148 transitions. [2019-09-09 05:55:14,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:14,442 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1148 transitions. [2019-09-09 05:55:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-09 05:55:14,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:14,444 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-09 05:55:14,444 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:14,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:14,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1070148881, now seen corresponding path program 1 times [2019-09-09 05:55:14,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:14,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:14,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:14,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:14,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:14,517 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:14,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:14,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:14,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:14,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:14,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:14,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:14,519 INFO L87 Difference]: Start difference. First operand 753 states and 1148 transitions. Second operand 4 states. [2019-09-09 05:55:14,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:14,945 INFO L93 Difference]: Finished difference Result 955 states and 1454 transitions. [2019-09-09 05:55:14,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:14,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-09 05:55:14,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:14,951 INFO L225 Difference]: With dead ends: 955 [2019-09-09 05:55:14,951 INFO L226 Difference]: Without dead ends: 955 [2019-09-09 05:55:14,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:14,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-09-09 05:55:14,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 777. [2019-09-09 05:55:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-09-09 05:55:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1182 transitions. [2019-09-09 05:55:14,962 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1182 transitions. Word has length 138 [2019-09-09 05:55:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:14,963 INFO L475 AbstractCegarLoop]: Abstraction has 777 states and 1182 transitions. [2019-09-09 05:55:14,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1182 transitions. [2019-09-09 05:55:14,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-09 05:55:14,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:14,965 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1] [2019-09-09 05:55:14,965 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:14,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:14,965 INFO L82 PathProgramCache]: Analyzing trace with hash 968872080, now seen corresponding path program 1 times [2019-09-09 05:55:14,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:14,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:14,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:14,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:14,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:55:15,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:15,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:15,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:15,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:15,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:15,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:15,038 INFO L87 Difference]: Start difference. First operand 777 states and 1182 transitions. Second operand 4 states. [2019-09-09 05:55:15,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:15,315 INFO L93 Difference]: Finished difference Result 807 states and 1222 transitions. [2019-09-09 05:55:15,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:15,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-09 05:55:15,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:15,318 INFO L225 Difference]: With dead ends: 807 [2019-09-09 05:55:15,319 INFO L226 Difference]: Without dead ends: 807 [2019-09-09 05:55:15,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2019-09-09 05:55:15,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 777. [2019-09-09 05:55:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-09-09 05:55:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1180 transitions. [2019-09-09 05:55:15,326 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1180 transitions. Word has length 138 [2019-09-09 05:55:15,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:15,327 INFO L475 AbstractCegarLoop]: Abstraction has 777 states and 1180 transitions. [2019-09-09 05:55:15,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:15,327 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1180 transitions. [2019-09-09 05:55:15,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-09 05:55:15,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:15,328 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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-09 05:55:15,328 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:15,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:15,329 INFO L82 PathProgramCache]: Analyzing trace with hash 201122752, now seen corresponding path program 1 times [2019-09-09 05:55:15,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:15,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:15,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:15,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:15,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:15,383 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:15,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:15,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:15,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:15,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:15,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:15,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:15,385 INFO L87 Difference]: Start difference. First operand 777 states and 1180 transitions. Second operand 4 states. [2019-09-09 05:55:15,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:15,763 INFO L93 Difference]: Finished difference Result 955 states and 1450 transitions. [2019-09-09 05:55:15,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:15,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-09 05:55:15,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:15,768 INFO L225 Difference]: With dead ends: 955 [2019-09-09 05:55:15,768 INFO L226 Difference]: Without dead ends: 955 [2019-09-09 05:55:15,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-09-09 05:55:15,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 779. [2019-09-09 05:55:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2019-09-09 05:55:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1182 transitions. [2019-09-09 05:55:15,776 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1182 transitions. Word has length 139 [2019-09-09 05:55:15,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:15,777 INFO L475 AbstractCegarLoop]: Abstraction has 779 states and 1182 transitions. [2019-09-09 05:55:15,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1182 transitions. [2019-09-09 05:55:15,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-09 05:55:15,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:15,778 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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-09 05:55:15,778 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:15,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:15,779 INFO L82 PathProgramCache]: Analyzing trace with hash 295879222, now seen corresponding path program 1 times [2019-09-09 05:55:15,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:15,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:15,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:15,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:15,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:15,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:15,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:15,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:15,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:15,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:15,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:15,833 INFO L87 Difference]: Start difference. First operand 779 states and 1182 transitions. Second operand 4 states. [2019-09-09 05:55:16,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:16,251 INFO L93 Difference]: Finished difference Result 955 states and 1448 transitions. [2019-09-09 05:55:16,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:16,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-09 05:55:16,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:16,256 INFO L225 Difference]: With dead ends: 955 [2019-09-09 05:55:16,257 INFO L226 Difference]: Without dead ends: 955 [2019-09-09 05:55:16,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:16,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-09-09 05:55:16,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 781. [2019-09-09 05:55:16,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-09-09 05:55:16,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1184 transitions. [2019-09-09 05:55:16,266 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1184 transitions. Word has length 140 [2019-09-09 05:55:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:16,267 INFO L475 AbstractCegarLoop]: Abstraction has 781 states and 1184 transitions. [2019-09-09 05:55:16,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1184 transitions. [2019-09-09 05:55:16,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-09 05:55:16,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:16,268 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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-09 05:55:16,268 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:16,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:16,269 INFO L82 PathProgramCache]: Analyzing trace with hash 203125189, now seen corresponding path program 1 times [2019-09-09 05:55:16,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:16,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:16,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:16,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:16,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:16,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:16,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:16,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:16,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:16,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:16,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:16,318 INFO L87 Difference]: Start difference. First operand 781 states and 1184 transitions. Second operand 4 states. [2019-09-09 05:55:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:16,686 INFO L93 Difference]: Finished difference Result 935 states and 1422 transitions. [2019-09-09 05:55:16,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:16,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-09 05:55:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:16,692 INFO L225 Difference]: With dead ends: 935 [2019-09-09 05:55:16,692 INFO L226 Difference]: Without dead ends: 935 [2019-09-09 05:55:16,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:16,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-09-09 05:55:16,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 783. [2019-09-09 05:55:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-09 05:55:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1186 transitions. [2019-09-09 05:55:16,703 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1186 transitions. Word has length 141 [2019-09-09 05:55:16,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:16,703 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1186 transitions. [2019-09-09 05:55:16,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:16,703 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1186 transitions. [2019-09-09 05:55:16,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-09 05:55:16,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:16,704 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:16,705 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:16,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:16,705 INFO L82 PathProgramCache]: Analyzing trace with hash -271914970, now seen corresponding path program 1 times [2019-09-09 05:55:16,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:16,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:16,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:16,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:16,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:16,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:16,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:16,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:16,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:16,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:16,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:16,776 INFO L87 Difference]: Start difference. First operand 783 states and 1186 transitions. Second operand 4 states. [2019-09-09 05:55:17,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:17,203 INFO L93 Difference]: Finished difference Result 955 states and 1444 transitions. [2019-09-09 05:55:17,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:17,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-09-09 05:55:17,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:17,207 INFO L225 Difference]: With dead ends: 955 [2019-09-09 05:55:17,208 INFO L226 Difference]: Without dead ends: 955 [2019-09-09 05:55:17,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:17,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-09-09 05:55:17,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 783. [2019-09-09 05:55:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-09 05:55:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1184 transitions. [2019-09-09 05:55:17,220 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1184 transitions. Word has length 144 [2019-09-09 05:55:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:17,220 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1184 transitions. [2019-09-09 05:55:17,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1184 transitions. [2019-09-09 05:55:17,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-09 05:55:17,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:17,222 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:17,222 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:17,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:17,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1546816331, now seen corresponding path program 1 times [2019-09-09 05:55:17,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:17,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:17,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:17,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:17,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:17,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:17,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:17,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:17,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:17,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:17,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:17,319 INFO L87 Difference]: Start difference. First operand 783 states and 1184 transitions. Second operand 4 states. [2019-09-09 05:55:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:17,748 INFO L93 Difference]: Finished difference Result 955 states and 1442 transitions. [2019-09-09 05:55:17,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:17,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-09 05:55:17,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:17,752 INFO L225 Difference]: With dead ends: 955 [2019-09-09 05:55:17,752 INFO L226 Difference]: Without dead ends: 955 [2019-09-09 05:55:17,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:17,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-09-09 05:55:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 783. [2019-09-09 05:55:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-09 05:55:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1182 transitions. [2019-09-09 05:55:17,760 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1182 transitions. Word has length 145 [2019-09-09 05:55:17,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:17,760 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1182 transitions. [2019-09-09 05:55:17,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:17,760 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1182 transitions. [2019-09-09 05:55:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-09 05:55:17,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:17,761 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:17,762 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:17,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:17,762 INFO L82 PathProgramCache]: Analyzing trace with hash -937292789, now seen corresponding path program 1 times [2019-09-09 05:55:17,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:17,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:17,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:17,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:17,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:17,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:17,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:17,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:17,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:17,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:17,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:17,830 INFO L87 Difference]: Start difference. First operand 783 states and 1182 transitions. Second operand 4 states. [2019-09-09 05:55:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:18,247 INFO L93 Difference]: Finished difference Result 955 states and 1440 transitions. [2019-09-09 05:55:18,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:18,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-09-09 05:55:18,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:18,251 INFO L225 Difference]: With dead ends: 955 [2019-09-09 05:55:18,251 INFO L226 Difference]: Without dead ends: 955 [2019-09-09 05:55:18,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:18,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-09-09 05:55:18,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 783. [2019-09-09 05:55:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-09 05:55:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1180 transitions. [2019-09-09 05:55:18,263 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1180 transitions. Word has length 146 [2019-09-09 05:55:18,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:18,263 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1180 transitions. [2019-09-09 05:55:18,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:18,263 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1180 transitions. [2019-09-09 05:55:18,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-09 05:55:18,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:18,265 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:18,265 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:18,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:18,266 INFO L82 PathProgramCache]: Analyzing trace with hash 629498512, now seen corresponding path program 1 times [2019-09-09 05:55:18,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:18,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:18,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:18,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:18,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:18,339 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:18,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:18,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:18,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:18,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:18,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:18,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:18,341 INFO L87 Difference]: Start difference. First operand 783 states and 1180 transitions. Second operand 4 states. [2019-09-09 05:55:18,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:18,754 INFO L93 Difference]: Finished difference Result 935 states and 1414 transitions. [2019-09-09 05:55:18,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:18,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-09-09 05:55:18,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:18,757 INFO L225 Difference]: With dead ends: 935 [2019-09-09 05:55:18,757 INFO L226 Difference]: Without dead ends: 935 [2019-09-09 05:55:18,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:18,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-09-09 05:55:18,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 753. [2019-09-09 05:55:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-09-09 05:55:18,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1138 transitions. [2019-09-09 05:55:18,768 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1138 transitions. Word has length 147 [2019-09-09 05:55:18,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:18,768 INFO L475 AbstractCegarLoop]: Abstraction has 753 states and 1138 transitions. [2019-09-09 05:55:18,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:18,768 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1138 transitions. [2019-09-09 05:55:18,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-09 05:55:18,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:18,769 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:18,769 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:18,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:18,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1509765041, now seen corresponding path program 1 times [2019-09-09 05:55:18,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:18,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:18,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:18,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:18,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:18,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:18,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:18,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:18,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:18,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:18,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:18,833 INFO L87 Difference]: Start difference. First operand 753 states and 1138 transitions. Second operand 4 states. [2019-09-09 05:55:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:19,181 INFO L93 Difference]: Finished difference Result 935 states and 1412 transitions. [2019-09-09 05:55:19,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:19,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-09-09 05:55:19,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:19,183 INFO L225 Difference]: With dead ends: 935 [2019-09-09 05:55:19,184 INFO L226 Difference]: Without dead ends: 935 [2019-09-09 05:55:19,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:19,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-09-09 05:55:19,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 809. [2019-09-09 05:55:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2019-09-09 05:55:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1228 transitions. [2019-09-09 05:55:19,194 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1228 transitions. Word has length 148 [2019-09-09 05:55:19,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:19,194 INFO L475 AbstractCegarLoop]: Abstraction has 809 states and 1228 transitions. [2019-09-09 05:55:19,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:19,194 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1228 transitions. [2019-09-09 05:55:19,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-09 05:55:19,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:19,196 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:19,196 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:19,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:19,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1711553696, now seen corresponding path program 1 times [2019-09-09 05:55:19,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:19,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:19,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:19,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:19,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:19,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:19,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:19,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:19,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:19,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:19,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:19,269 INFO L87 Difference]: Start difference. First operand 809 states and 1228 transitions. Second operand 4 states. [2019-09-09 05:55:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:19,632 INFO L93 Difference]: Finished difference Result 919 states and 1384 transitions. [2019-09-09 05:55:19,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:19,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-09-09 05:55:19,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:19,634 INFO L225 Difference]: With dead ends: 919 [2019-09-09 05:55:19,634 INFO L226 Difference]: Without dead ends: 919 [2019-09-09 05:55:19,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-09-09 05:55:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 811. [2019-09-09 05:55:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-09-09 05:55:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1230 transitions. [2019-09-09 05:55:19,646 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1230 transitions. Word has length 149 [2019-09-09 05:55:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:19,646 INFO L475 AbstractCegarLoop]: Abstraction has 811 states and 1230 transitions. [2019-09-09 05:55:19,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1230 transitions. [2019-09-09 05:55:19,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-09 05:55:19,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:19,648 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1] [2019-09-09 05:55:19,648 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:19,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:19,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1568314076, now seen corresponding path program 1 times [2019-09-09 05:55:19,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:19,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:19,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:19,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:19,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:19,718 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-09 05:55:19,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:19,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:19,719 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:19,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:19,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:19,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:19,720 INFO L87 Difference]: Start difference. First operand 811 states and 1230 transitions. Second operand 4 states. [2019-09-09 05:55:20,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:20,107 INFO L93 Difference]: Finished difference Result 919 states and 1382 transitions. [2019-09-09 05:55:20,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:20,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-09 05:55:20,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:20,110 INFO L225 Difference]: With dead ends: 919 [2019-09-09 05:55:20,110 INFO L226 Difference]: Without dead ends: 919 [2019-09-09 05:55:20,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:20,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-09-09 05:55:20,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 811. [2019-09-09 05:55:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-09-09 05:55:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1228 transitions. [2019-09-09 05:55:20,121 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1228 transitions. Word has length 151 [2019-09-09 05:55:20,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:20,121 INFO L475 AbstractCegarLoop]: Abstraction has 811 states and 1228 transitions. [2019-09-09 05:55:20,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1228 transitions. [2019-09-09 05:55:20,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-09 05:55:20,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:20,123 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 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-09 05:55:20,124 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:20,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:20,124 INFO L82 PathProgramCache]: Analyzing trace with hash -358292749, now seen corresponding path program 1 times [2019-09-09 05:55:20,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:20,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:20,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:20,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:20,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:20,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:20,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:20,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:20,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:20,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:20,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:20,203 INFO L87 Difference]: Start difference. First operand 811 states and 1228 transitions. Second operand 4 states. [2019-09-09 05:55:20,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:20,617 INFO L93 Difference]: Finished difference Result 913 states and 1372 transitions. [2019-09-09 05:55:20,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:20,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-09 05:55:20,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:20,620 INFO L225 Difference]: With dead ends: 913 [2019-09-09 05:55:20,620 INFO L226 Difference]: Without dead ends: 913 [2019-09-09 05:55:20,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:20,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-09-09 05:55:20,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 817. [2019-09-09 05:55:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-09-09 05:55:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1238 transitions. [2019-09-09 05:55:20,631 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1238 transitions. Word has length 152 [2019-09-09 05:55:20,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:20,631 INFO L475 AbstractCegarLoop]: Abstraction has 817 states and 1238 transitions. [2019-09-09 05:55:20,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1238 transitions. [2019-09-09 05:55:20,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-09 05:55:20,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:20,634 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1] [2019-09-09 05:55:20,634 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:20,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:20,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1799915925, now seen corresponding path program 1 times [2019-09-09 05:55:20,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:20,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:20,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:20,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:20,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:20,711 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-09 05:55:20,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:20,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:20,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:20,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:20,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:20,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:20,713 INFO L87 Difference]: Start difference. First operand 817 states and 1238 transitions. Second operand 4 states. [2019-09-09 05:55:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:21,033 INFO L93 Difference]: Finished difference Result 909 states and 1366 transitions. [2019-09-09 05:55:21,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:21,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-09 05:55:21,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:21,036 INFO L225 Difference]: With dead ends: 909 [2019-09-09 05:55:21,036 INFO L226 Difference]: Without dead ends: 909 [2019-09-09 05:55:21,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:21,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-09-09 05:55:21,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 817. [2019-09-09 05:55:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-09-09 05:55:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1236 transitions. [2019-09-09 05:55:21,046 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1236 transitions. Word has length 152 [2019-09-09 05:55:21,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:21,047 INFO L475 AbstractCegarLoop]: Abstraction has 817 states and 1236 transitions. [2019-09-09 05:55:21,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:21,047 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1236 transitions. [2019-09-09 05:55:21,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-09 05:55:21,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:21,049 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:21,049 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:21,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:21,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1034406813, now seen corresponding path program 1 times [2019-09-09 05:55:21,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:21,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:21,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:21,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:21,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:21,123 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:21,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:21,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:21,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:21,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:21,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:21,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:21,126 INFO L87 Difference]: Start difference. First operand 817 states and 1236 transitions. Second operand 4 states. [2019-09-09 05:55:21,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:21,470 INFO L93 Difference]: Finished difference Result 887 states and 1330 transitions. [2019-09-09 05:55:21,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:21,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-09 05:55:21,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:21,473 INFO L225 Difference]: With dead ends: 887 [2019-09-09 05:55:21,473 INFO L226 Difference]: Without dead ends: 887 [2019-09-09 05:55:21,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-09-09 05:55:21,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 817. [2019-09-09 05:55:21,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-09-09 05:55:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1234 transitions. [2019-09-09 05:55:21,482 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1234 transitions. Word has length 152 [2019-09-09 05:55:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:21,482 INFO L475 AbstractCegarLoop]: Abstraction has 817 states and 1234 transitions. [2019-09-09 05:55:21,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:21,482 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1234 transitions. [2019-09-09 05:55:21,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-09 05:55:21,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:21,483 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:21,484 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:21,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:21,485 INFO L82 PathProgramCache]: Analyzing trace with hash -615594322, now seen corresponding path program 1 times [2019-09-09 05:55:21,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:21,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:21,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:21,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:21,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:21,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:21,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:21,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:21,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:21,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:21,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:21,545 INFO L87 Difference]: Start difference. First operand 817 states and 1234 transitions. Second operand 4 states. [2019-09-09 05:55:21,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:21,895 INFO L93 Difference]: Finished difference Result 887 states and 1328 transitions. [2019-09-09 05:55:21,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:21,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-09 05:55:21,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:21,899 INFO L225 Difference]: With dead ends: 887 [2019-09-09 05:55:21,899 INFO L226 Difference]: Without dead ends: 887 [2019-09-09 05:55:21,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-09-09 05:55:21,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 817. [2019-09-09 05:55:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-09-09 05:55:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1232 transitions. [2019-09-09 05:55:21,909 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1232 transitions. Word has length 153 [2019-09-09 05:55:21,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:21,910 INFO L475 AbstractCegarLoop]: Abstraction has 817 states and 1232 transitions. [2019-09-09 05:55:21,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1232 transitions. [2019-09-09 05:55:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-09 05:55:21,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:21,912 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:21,912 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:21,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:21,913 INFO L82 PathProgramCache]: Analyzing trace with hash 34854022, now seen corresponding path program 1 times [2019-09-09 05:55:21,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:21,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:21,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:21,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:21,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:21,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:21,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:21,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:21,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:22,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:22,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:22,000 INFO L87 Difference]: Start difference. First operand 817 states and 1232 transitions. Second operand 4 states. [2019-09-09 05:55:22,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:22,393 INFO L93 Difference]: Finished difference Result 935 states and 1398 transitions. [2019-09-09 05:55:22,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:22,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-09 05:55:22,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:22,396 INFO L225 Difference]: With dead ends: 935 [2019-09-09 05:55:22,396 INFO L226 Difference]: Without dead ends: 935 [2019-09-09 05:55:22,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:22,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-09-09 05:55:22,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 817. [2019-09-09 05:55:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-09-09 05:55:22,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1230 transitions. [2019-09-09 05:55:22,407 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1230 transitions. Word has length 154 [2019-09-09 05:55:22,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:22,408 INFO L475 AbstractCegarLoop]: Abstraction has 817 states and 1230 transitions. [2019-09-09 05:55:22,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:22,408 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1230 transitions. [2019-09-09 05:55:22,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-09 05:55:22,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:22,410 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:22,410 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:22,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:22,411 INFO L82 PathProgramCache]: Analyzing trace with hash 747453704, now seen corresponding path program 1 times [2019-09-09 05:55:22,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:22,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:22,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:22,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:22,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:22,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:22,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:22,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:22,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:22,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:22,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:22,491 INFO L87 Difference]: Start difference. First operand 817 states and 1230 transitions. Second operand 4 states. [2019-09-09 05:55:22,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:22,830 INFO L93 Difference]: Finished difference Result 887 states and 1324 transitions. [2019-09-09 05:55:22,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:22,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-09 05:55:22,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:22,832 INFO L225 Difference]: With dead ends: 887 [2019-09-09 05:55:22,832 INFO L226 Difference]: Without dead ends: 887 [2019-09-09 05:55:22,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:22,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-09-09 05:55:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 817. [2019-09-09 05:55:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-09-09 05:55:22,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1228 transitions. [2019-09-09 05:55:22,840 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1228 transitions. Word has length 154 [2019-09-09 05:55:22,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:22,841 INFO L475 AbstractCegarLoop]: Abstraction has 817 states and 1228 transitions. [2019-09-09 05:55:22,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:22,841 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1228 transitions. [2019-09-09 05:55:22,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:55:22,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:22,842 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1] [2019-09-09 05:55:22,842 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:22,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:22,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1061014933, now seen corresponding path program 1 times [2019-09-09 05:55:22,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:22,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:22,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:22,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:22,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:22,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:22,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:22,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:22,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:22,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:22,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:22,898 INFO L87 Difference]: Start difference. First operand 817 states and 1228 transitions. Second operand 4 states. [2019-09-09 05:55:23,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:23,276 INFO L93 Difference]: Finished difference Result 919 states and 1368 transitions. [2019-09-09 05:55:23,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:23,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-09 05:55:23,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:23,280 INFO L225 Difference]: With dead ends: 919 [2019-09-09 05:55:23,281 INFO L226 Difference]: Without dead ends: 919 [2019-09-09 05:55:23,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:23,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-09-09 05:55:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 817. [2019-09-09 05:55:23,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-09-09 05:55:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1226 transitions. [2019-09-09 05:55:23,291 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1226 transitions. Word has length 155 [2019-09-09 05:55:23,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:23,292 INFO L475 AbstractCegarLoop]: Abstraction has 817 states and 1226 transitions. [2019-09-09 05:55:23,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:23,292 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1226 transitions. [2019-09-09 05:55:23,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:55:23,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:23,294 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:23,294 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:23,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:23,295 INFO L82 PathProgramCache]: Analyzing trace with hash -996407864, now seen corresponding path program 1 times [2019-09-09 05:55:23,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:23,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:23,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:23,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:23,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:23,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:23,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:23,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:23,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:23,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:23,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:23,374 INFO L87 Difference]: Start difference. First operand 817 states and 1226 transitions. Second operand 4 states. [2019-09-09 05:55:23,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:23,690 INFO L93 Difference]: Finished difference Result 909 states and 1354 transitions. [2019-09-09 05:55:23,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:23,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-09 05:55:23,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:23,693 INFO L225 Difference]: With dead ends: 909 [2019-09-09 05:55:23,693 INFO L226 Difference]: Without dead ends: 909 [2019-09-09 05:55:23,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:23,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-09-09 05:55:23,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 819. [2019-09-09 05:55:23,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-09-09 05:55:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1228 transitions. [2019-09-09 05:55:23,703 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1228 transitions. Word has length 155 [2019-09-09 05:55:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:23,703 INFO L475 AbstractCegarLoop]: Abstraction has 819 states and 1228 transitions. [2019-09-09 05:55:23,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1228 transitions. [2019-09-09 05:55:23,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:55:23,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:23,705 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:23,706 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:23,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:23,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1317032243, now seen corresponding path program 1 times [2019-09-09 05:55:23,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:23,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:23,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:23,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:23,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:23,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:23,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:23,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:23,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:23,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:23,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:23,783 INFO L87 Difference]: Start difference. First operand 819 states and 1228 transitions. Second operand 4 states. [2019-09-09 05:55:24,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:24,089 INFO L93 Difference]: Finished difference Result 869 states and 1298 transitions. [2019-09-09 05:55:24,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:24,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-09 05:55:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:24,091 INFO L225 Difference]: With dead ends: 869 [2019-09-09 05:55:24,091 INFO L226 Difference]: Without dead ends: 869 [2019-09-09 05:55:24,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2019-09-09 05:55:24,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 819. [2019-09-09 05:55:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-09-09 05:55:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1226 transitions. [2019-09-09 05:55:24,099 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1226 transitions. Word has length 155 [2019-09-09 05:55:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:24,100 INFO L475 AbstractCegarLoop]: Abstraction has 819 states and 1226 transitions. [2019-09-09 05:55:24,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1226 transitions. [2019-09-09 05:55:24,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:55:24,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:24,101 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 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-09 05:55:24,101 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:24,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:24,102 INFO L82 PathProgramCache]: Analyzing trace with hash 885646974, now seen corresponding path program 1 times [2019-09-09 05:55:24,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:24,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:24,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:24,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:24,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:24,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:24,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:24,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:24,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:24,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:24,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:24,161 INFO L87 Difference]: Start difference. First operand 819 states and 1226 transitions. Second operand 4 states. [2019-09-09 05:55:24,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:24,480 INFO L93 Difference]: Finished difference Result 897 states and 1334 transitions. [2019-09-09 05:55:24,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:24,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:55:24,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:24,482 INFO L225 Difference]: With dead ends: 897 [2019-09-09 05:55:24,482 INFO L226 Difference]: Without dead ends: 897 [2019-09-09 05:55:24,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-09-09 05:55:24,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 821. [2019-09-09 05:55:24,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2019-09-09 05:55:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1228 transitions. [2019-09-09 05:55:24,490 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1228 transitions. Word has length 156 [2019-09-09 05:55:24,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:24,490 INFO L475 AbstractCegarLoop]: Abstraction has 821 states and 1228 transitions. [2019-09-09 05:55:24,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1228 transitions. [2019-09-09 05:55:24,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:55:24,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:24,492 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:24,493 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:24,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:24,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1328661089, now seen corresponding path program 1 times [2019-09-09 05:55:24,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:24,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:24,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:24,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:24,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:24,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:24,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:24,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:24,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:24,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:24,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:24,559 INFO L87 Difference]: Start difference. First operand 821 states and 1228 transitions. Second operand 4 states. [2019-09-09 05:55:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:24,881 INFO L93 Difference]: Finished difference Result 897 states and 1332 transitions. [2019-09-09 05:55:24,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:24,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:55:24,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:24,884 INFO L225 Difference]: With dead ends: 897 [2019-09-09 05:55:24,884 INFO L226 Difference]: Without dead ends: 897 [2019-09-09 05:55:24,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:24,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-09-09 05:55:24,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 823. [2019-09-09 05:55:24,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-09 05:55:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1230 transitions. [2019-09-09 05:55:24,893 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1230 transitions. Word has length 156 [2019-09-09 05:55:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:24,894 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1230 transitions. [2019-09-09 05:55:24,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1230 transitions. [2019-09-09 05:55:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-09 05:55:24,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:24,896 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:24,896 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:24,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:24,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1167924271, now seen corresponding path program 1 times [2019-09-09 05:55:24,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:24,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:24,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:24,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:24,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:55:24,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:24,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:24,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:24,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:24,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:24,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:24,947 INFO L87 Difference]: Start difference. First operand 823 states and 1230 transitions. Second operand 4 states. [2019-09-09 05:55:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:25,326 INFO L93 Difference]: Finished difference Result 919 states and 1358 transitions. [2019-09-09 05:55:25,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:25,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-09 05:55:25,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:25,328 INFO L225 Difference]: With dead ends: 919 [2019-09-09 05:55:25,328 INFO L226 Difference]: Without dead ends: 919 [2019-09-09 05:55:25,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:25,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-09-09 05:55:25,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 823. [2019-09-09 05:55:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-09 05:55:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1228 transitions. [2019-09-09 05:55:25,348 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1228 transitions. Word has length 157 [2019-09-09 05:55:25,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:25,348 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1228 transitions. [2019-09-09 05:55:25,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:25,348 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1228 transitions. [2019-09-09 05:55:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-09 05:55:25,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:25,350 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 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] [2019-09-09 05:55:25,350 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:25,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:25,351 INFO L82 PathProgramCache]: Analyzing trace with hash -442652919, now seen corresponding path program 1 times [2019-09-09 05:55:25,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:25,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:25,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:25,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:25,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:25,432 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:25,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:25,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:25,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:25,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:25,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:25,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:25,434 INFO L87 Difference]: Start difference. First operand 823 states and 1228 transitions. Second operand 4 states. [2019-09-09 05:55:25,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:25,760 INFO L93 Difference]: Finished difference Result 891 states and 1321 transitions. [2019-09-09 05:55:25,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:25,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-09 05:55:25,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:25,762 INFO L225 Difference]: With dead ends: 891 [2019-09-09 05:55:25,762 INFO L226 Difference]: Without dead ends: 891 [2019-09-09 05:55:25,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2019-09-09 05:55:25,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 825. [2019-09-09 05:55:25,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-09-09 05:55:25,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1230 transitions. [2019-09-09 05:55:25,772 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1230 transitions. Word has length 157 [2019-09-09 05:55:25,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:25,772 INFO L475 AbstractCegarLoop]: Abstraction has 825 states and 1230 transitions. [2019-09-09 05:55:25,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:25,772 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1230 transitions. [2019-09-09 05:55:25,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:55:25,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:25,773 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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-09 05:55:25,774 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:25,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:25,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1434249912, now seen corresponding path program 1 times [2019-09-09 05:55:25,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:25,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:25,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:25,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:25,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:25,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:25,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:25,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:25,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:25,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:25,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:25,831 INFO L87 Difference]: Start difference. First operand 825 states and 1230 transitions. Second operand 4 states. [2019-09-09 05:55:26,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:26,198 INFO L93 Difference]: Finished difference Result 913 states and 1346 transitions. [2019-09-09 05:55:26,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:26,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-09 05:55:26,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:26,200 INFO L225 Difference]: With dead ends: 913 [2019-09-09 05:55:26,200 INFO L226 Difference]: Without dead ends: 913 [2019-09-09 05:55:26,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:26,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-09-09 05:55:26,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 825. [2019-09-09 05:55:26,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-09-09 05:55:26,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1228 transitions. [2019-09-09 05:55:26,208 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1228 transitions. Word has length 158 [2019-09-09 05:55:26,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:26,208 INFO L475 AbstractCegarLoop]: Abstraction has 825 states and 1228 transitions. [2019-09-09 05:55:26,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:26,208 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1228 transitions. [2019-09-09 05:55:26,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:55:26,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:26,210 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:26,210 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:26,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:26,211 INFO L82 PathProgramCache]: Analyzing trace with hash 723958762, now seen corresponding path program 1 times [2019-09-09 05:55:26,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:26,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:26,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:26,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:26,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:55:26,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:26,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:26,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:26,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:26,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:26,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:26,280 INFO L87 Difference]: Start difference. First operand 825 states and 1228 transitions. Second operand 4 states. [2019-09-09 05:55:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:26,622 INFO L93 Difference]: Finished difference Result 909 states and 1340 transitions. [2019-09-09 05:55:26,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:26,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-09 05:55:26,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:26,624 INFO L225 Difference]: With dead ends: 909 [2019-09-09 05:55:26,624 INFO L226 Difference]: Without dead ends: 909 [2019-09-09 05:55:26,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:26,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-09-09 05:55:26,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 825. [2019-09-09 05:55:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-09-09 05:55:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1226 transitions. [2019-09-09 05:55:26,634 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1226 transitions. Word has length 158 [2019-09-09 05:55:26,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:26,635 INFO L475 AbstractCegarLoop]: Abstraction has 825 states and 1226 transitions. [2019-09-09 05:55:26,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:26,635 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1226 transitions. [2019-09-09 05:55:26,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:55:26,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:26,637 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:26,637 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:26,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:26,637 INFO L82 PathProgramCache]: Analyzing trace with hash 896101671, now seen corresponding path program 1 times [2019-09-09 05:55:26,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:26,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:26,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:26,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:26,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:26,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:26,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:26,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:26,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:26,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:26,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:26,713 INFO L87 Difference]: Start difference. First operand 825 states and 1226 transitions. Second operand 4 states. [2019-09-09 05:55:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:27,042 INFO L93 Difference]: Finished difference Result 891 states and 1315 transitions. [2019-09-09 05:55:27,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:27,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-09 05:55:27,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:27,045 INFO L225 Difference]: With dead ends: 891 [2019-09-09 05:55:27,045 INFO L226 Difference]: Without dead ends: 891 [2019-09-09 05:55:27,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:27,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2019-09-09 05:55:27,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 827. [2019-09-09 05:55:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-09-09 05:55:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1228 transitions. [2019-09-09 05:55:27,053 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1228 transitions. Word has length 158 [2019-09-09 05:55:27,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:27,053 INFO L475 AbstractCegarLoop]: Abstraction has 827 states and 1228 transitions. [2019-09-09 05:55:27,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1228 transitions. [2019-09-09 05:55:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-09 05:55:27,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:27,055 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:27,055 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:27,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:27,055 INFO L82 PathProgramCache]: Analyzing trace with hash 323311473, now seen corresponding path program 1 times [2019-09-09 05:55:27,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:27,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:27,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:27,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:27,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:27,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:27,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:27,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:27,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:27,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:27,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:27,107 INFO L87 Difference]: Start difference. First operand 827 states and 1228 transitions. Second operand 4 states. [2019-09-09 05:55:27,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:27,433 INFO L93 Difference]: Finished difference Result 885 states and 1306 transitions. [2019-09-09 05:55:27,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:27,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-09 05:55:27,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:27,435 INFO L225 Difference]: With dead ends: 885 [2019-09-09 05:55:27,435 INFO L226 Difference]: Without dead ends: 885 [2019-09-09 05:55:27,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:27,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2019-09-09 05:55:27,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 829. [2019-09-09 05:55:27,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-09 05:55:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1230 transitions. [2019-09-09 05:55:27,443 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1230 transitions. Word has length 159 [2019-09-09 05:55:27,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:27,443 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1230 transitions. [2019-09-09 05:55:27,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:27,444 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1230 transitions. [2019-09-09 05:55:27,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 05:55:27,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:27,445 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 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] [2019-09-09 05:55:27,445 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:27,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:27,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1495320749, now seen corresponding path program 1 times [2019-09-09 05:55:27,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:27,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:27,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:27,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:27,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:27,521 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:27,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:27,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:27,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:27,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:27,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:27,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:27,522 INFO L87 Difference]: Start difference. First operand 829 states and 1230 transitions. Second operand 4 states. [2019-09-09 05:55:27,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:27,861 INFO L93 Difference]: Finished difference Result 909 states and 1334 transitions. [2019-09-09 05:55:27,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:27,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-09 05:55:27,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:27,863 INFO L225 Difference]: With dead ends: 909 [2019-09-09 05:55:27,864 INFO L226 Difference]: Without dead ends: 909 [2019-09-09 05:55:27,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:27,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-09-09 05:55:27,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 829. [2019-09-09 05:55:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-09 05:55:27,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1228 transitions. [2019-09-09 05:55:27,885 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1228 transitions. Word has length 161 [2019-09-09 05:55:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:27,885 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1228 transitions. [2019-09-09 05:55:27,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1228 transitions. [2019-09-09 05:55:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-09 05:55:27,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:27,887 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-09 05:55:27,888 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:27,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:27,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1695750573, now seen corresponding path program 1 times [2019-09-09 05:55:27,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:27,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:27,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:27,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:27,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:27,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:27,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:27,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:27,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:27,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:27,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:27,946 INFO L87 Difference]: Start difference. First operand 829 states and 1228 transitions. Second operand 4 states. [2019-09-09 05:55:28,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:28,286 INFO L93 Difference]: Finished difference Result 897 states and 1316 transitions. [2019-09-09 05:55:28,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:28,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-09 05:55:28,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:28,289 INFO L225 Difference]: With dead ends: 897 [2019-09-09 05:55:28,289 INFO L226 Difference]: Without dead ends: 897 [2019-09-09 05:55:28,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:28,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-09-09 05:55:28,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 829. [2019-09-09 05:55:28,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-09 05:55:28,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1226 transitions. [2019-09-09 05:55:28,297 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1226 transitions. Word has length 162 [2019-09-09 05:55:28,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:28,297 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1226 transitions. [2019-09-09 05:55:28,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:28,297 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1226 transitions. [2019-09-09 05:55:28,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-09 05:55:28,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:28,299 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-09 05:55:28,299 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:28,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:28,299 INFO L82 PathProgramCache]: Analyzing trace with hash 384908660, now seen corresponding path program 1 times [2019-09-09 05:55:28,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:28,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:28,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:28,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:28,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:28,386 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:28,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:28,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:28,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:28,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:28,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:28,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:28,387 INFO L87 Difference]: Start difference. First operand 829 states and 1226 transitions. Second operand 4 states. [2019-09-09 05:55:28,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:28,746 INFO L93 Difference]: Finished difference Result 897 states and 1314 transitions. [2019-09-09 05:55:28,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:28,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-09 05:55:28,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:28,748 INFO L225 Difference]: With dead ends: 897 [2019-09-09 05:55:28,748 INFO L226 Difference]: Without dead ends: 897 [2019-09-09 05:55:28,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:28,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-09-09 05:55:28,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 829. [2019-09-09 05:55:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-09 05:55:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1224 transitions. [2019-09-09 05:55:28,756 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1224 transitions. Word has length 162 [2019-09-09 05:55:28,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:28,756 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1224 transitions. [2019-09-09 05:55:28,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1224 transitions. [2019-09-09 05:55:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-09 05:55:28,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:28,758 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:28,758 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:28,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:28,758 INFO L82 PathProgramCache]: Analyzing trace with hash 670087299, now seen corresponding path program 1 times [2019-09-09 05:55:28,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:28,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:28,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:28,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:28,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:28,820 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:55:28,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:28,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:28,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:28,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:28,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:28,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:28,821 INFO L87 Difference]: Start difference. First operand 829 states and 1224 transitions. Second operand 4 states. [2019-09-09 05:55:29,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:29,204 INFO L93 Difference]: Finished difference Result 963 states and 1430 transitions. [2019-09-09 05:55:29,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:29,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-09 05:55:29,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:29,206 INFO L225 Difference]: With dead ends: 963 [2019-09-09 05:55:29,207 INFO L226 Difference]: Without dead ends: 963 [2019-09-09 05:55:29,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:29,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-09-09 05:55:29,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 889. [2019-09-09 05:55:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-09-09 05:55:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1330 transitions. [2019-09-09 05:55:29,215 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1330 transitions. Word has length 162 [2019-09-09 05:55:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:29,216 INFO L475 AbstractCegarLoop]: Abstraction has 889 states and 1330 transitions. [2019-09-09 05:55:29,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1330 transitions. [2019-09-09 05:55:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-09 05:55:29,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:29,218 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-09 05:55:29,218 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:29,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:29,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1138401748, now seen corresponding path program 1 times [2019-09-09 05:55:29,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:29,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:29,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:29,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:29,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:29,276 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:29,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:29,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:29,277 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:29,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:29,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:29,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:29,278 INFO L87 Difference]: Start difference. First operand 889 states and 1330 transitions. Second operand 4 states. [2019-09-09 05:55:29,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:29,612 INFO L93 Difference]: Finished difference Result 951 states and 1411 transitions. [2019-09-09 05:55:29,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:29,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-09 05:55:29,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:29,614 INFO L225 Difference]: With dead ends: 951 [2019-09-09 05:55:29,614 INFO L226 Difference]: Without dead ends: 951 [2019-09-09 05:55:29,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-09-09 05:55:29,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 889. [2019-09-09 05:55:29,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-09-09 05:55:29,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1328 transitions. [2019-09-09 05:55:29,622 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1328 transitions. Word has length 163 [2019-09-09 05:55:29,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:29,622 INFO L475 AbstractCegarLoop]: Abstraction has 889 states and 1328 transitions. [2019-09-09 05:55:29,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1328 transitions. [2019-09-09 05:55:29,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-09 05:55:29,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:29,624 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:29,624 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:29,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:29,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1630811204, now seen corresponding path program 1 times [2019-09-09 05:55:29,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:29,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:29,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:29,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:29,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:29,712 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:29,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:29,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:29,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:29,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:29,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:29,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:29,714 INFO L87 Difference]: Start difference. First operand 889 states and 1328 transitions. Second operand 4 states. [2019-09-09 05:55:30,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:30,045 INFO L93 Difference]: Finished difference Result 951 states and 1409 transitions. [2019-09-09 05:55:30,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:30,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-09 05:55:30,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:30,048 INFO L225 Difference]: With dead ends: 951 [2019-09-09 05:55:30,048 INFO L226 Difference]: Without dead ends: 951 [2019-09-09 05:55:30,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:30,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-09-09 05:55:30,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 889. [2019-09-09 05:55:30,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-09-09 05:55:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1326 transitions. [2019-09-09 05:55:30,057 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1326 transitions. Word has length 164 [2019-09-09 05:55:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:30,057 INFO L475 AbstractCegarLoop]: Abstraction has 889 states and 1326 transitions. [2019-09-09 05:55:30,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1326 transitions. [2019-09-09 05:55:30,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-09 05:55:30,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:30,059 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-09 05:55:30,059 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:30,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:30,059 INFO L82 PathProgramCache]: Analyzing trace with hash -701576324, now seen corresponding path program 1 times [2019-09-09 05:55:30,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:30,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:30,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:30,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:30,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:30,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:30,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:30,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:30,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:30,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:30,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:30,120 INFO L87 Difference]: Start difference. First operand 889 states and 1326 transitions. Second operand 4 states. [2019-09-09 05:55:30,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:30,466 INFO L93 Difference]: Finished difference Result 945 states and 1400 transitions. [2019-09-09 05:55:30,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:30,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-09 05:55:30,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:30,468 INFO L225 Difference]: With dead ends: 945 [2019-09-09 05:55:30,469 INFO L226 Difference]: Without dead ends: 945 [2019-09-09 05:55:30,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:30,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-09-09 05:55:30,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 813. [2019-09-09 05:55:30,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-09-09 05:55:30,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1214 transitions. [2019-09-09 05:55:30,477 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1214 transitions. Word has length 165 [2019-09-09 05:55:30,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:30,478 INFO L475 AbstractCegarLoop]: Abstraction has 813 states and 1214 transitions. [2019-09-09 05:55:30,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:30,478 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1214 transitions. [2019-09-09 05:55:30,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-09 05:55:30,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:30,480 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:30,480 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:30,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:30,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1609676641, now seen corresponding path program 1 times [2019-09-09 05:55:30,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:30,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:30,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:30,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:30,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-09 05:55:30,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:30,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:30,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:30,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:30,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:30,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:30,557 INFO L87 Difference]: Start difference. First operand 813 states and 1214 transitions. Second operand 4 states. [2019-09-09 05:55:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:30,896 INFO L93 Difference]: Finished difference Result 945 states and 1398 transitions. [2019-09-09 05:55:30,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:30,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-09 05:55:30,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:30,898 INFO L225 Difference]: With dead ends: 945 [2019-09-09 05:55:30,898 INFO L226 Difference]: Without dead ends: 945 [2019-09-09 05:55:30,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-09-09 05:55:30,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 873. [2019-09-09 05:55:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-09-09 05:55:30,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1304 transitions. [2019-09-09 05:55:30,908 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1304 transitions. Word has length 165 [2019-09-09 05:55:30,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:30,908 INFO L475 AbstractCegarLoop]: Abstraction has 873 states and 1304 transitions. [2019-09-09 05:55:30,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:30,908 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1304 transitions. [2019-09-09 05:55:30,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-09 05:55:30,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:30,910 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:30,911 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:30,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:30,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1776573202, now seen corresponding path program 1 times [2019-09-09 05:55:30,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:30,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:30,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:30,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:30,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-09 05:55:30,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:30,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:30,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:30,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:30,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:30,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:30,979 INFO L87 Difference]: Start difference. First operand 873 states and 1304 transitions. Second operand 4 states. [2019-09-09 05:55:31,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:31,358 INFO L93 Difference]: Finished difference Result 953 states and 1410 transitions. [2019-09-09 05:55:31,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:31,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-09 05:55:31,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:31,360 INFO L225 Difference]: With dead ends: 953 [2019-09-09 05:55:31,360 INFO L226 Difference]: Without dead ends: 953 [2019-09-09 05:55:31,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:31,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-09-09 05:55:31,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 873. [2019-09-09 05:55:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-09-09 05:55:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1302 transitions. [2019-09-09 05:55:31,373 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1302 transitions. Word has length 165 [2019-09-09 05:55:31,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:31,373 INFO L475 AbstractCegarLoop]: Abstraction has 873 states and 1302 transitions. [2019-09-09 05:55:31,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1302 transitions. [2019-09-09 05:55:31,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-09 05:55:31,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:31,377 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:31,377 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:31,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:31,377 INFO L82 PathProgramCache]: Analyzing trace with hash 625440223, now seen corresponding path program 1 times [2019-09-09 05:55:31,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:31,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:31,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:31,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:31,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:31,453 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-09 05:55:31,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:31,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:31,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:31,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:31,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:31,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:31,454 INFO L87 Difference]: Start difference. First operand 873 states and 1302 transitions. Second operand 4 states. [2019-09-09 05:55:31,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:31,838 INFO L93 Difference]: Finished difference Result 953 states and 1408 transitions. [2019-09-09 05:55:31,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:31,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-09 05:55:31,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:31,840 INFO L225 Difference]: With dead ends: 953 [2019-09-09 05:55:31,840 INFO L226 Difference]: Without dead ends: 953 [2019-09-09 05:55:31,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:31,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-09-09 05:55:31,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 873. [2019-09-09 05:55:31,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-09-09 05:55:31,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1300 transitions. [2019-09-09 05:55:31,850 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1300 transitions. Word has length 166 [2019-09-09 05:55:31,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:31,851 INFO L475 AbstractCegarLoop]: Abstraction has 873 states and 1300 transitions. [2019-09-09 05:55:31,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:31,851 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1300 transitions. [2019-09-09 05:55:31,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-09 05:55:31,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:31,852 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:31,852 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:31,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:31,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1942050488, now seen corresponding path program 1 times [2019-09-09 05:55:31,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:31,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:31,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:31,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:31,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-09 05:55:31,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:31,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:31,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:31,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:31,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:31,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:31,908 INFO L87 Difference]: Start difference. First operand 873 states and 1300 transitions. Second operand 4 states. [2019-09-09 05:55:32,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:32,181 INFO L93 Difference]: Finished difference Result 901 states and 1338 transitions. [2019-09-09 05:55:32,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:32,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-09 05:55:32,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:32,183 INFO L225 Difference]: With dead ends: 901 [2019-09-09 05:55:32,183 INFO L226 Difference]: Without dead ends: 901 [2019-09-09 05:55:32,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:32,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-09-09 05:55:32,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 873. [2019-09-09 05:55:32,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-09-09 05:55:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1298 transitions. [2019-09-09 05:55:32,190 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1298 transitions. Word has length 167 [2019-09-09 05:55:32,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:32,190 INFO L475 AbstractCegarLoop]: Abstraction has 873 states and 1298 transitions. [2019-09-09 05:55:32,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:32,190 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1298 transitions. [2019-09-09 05:55:32,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-09 05:55:32,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:32,192 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:32,192 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:32,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:32,193 INFO L82 PathProgramCache]: Analyzing trace with hash 564818935, now seen corresponding path program 1 times [2019-09-09 05:55:32,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:32,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:32,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:32,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:32,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-09 05:55:32,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:32,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:32,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:32,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:32,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:32,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:32,253 INFO L87 Difference]: Start difference. First operand 873 states and 1298 transitions. Second operand 4 states. [2019-09-09 05:55:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:32,567 INFO L93 Difference]: Finished difference Result 923 states and 1368 transitions. [2019-09-09 05:55:32,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:32,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-09 05:55:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:32,568 INFO L225 Difference]: With dead ends: 923 [2019-09-09 05:55:32,568 INFO L226 Difference]: Without dead ends: 923 [2019-09-09 05:55:32,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:32,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-09-09 05:55:32,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 873. [2019-09-09 05:55:32,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-09-09 05:55:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1296 transitions. [2019-09-09 05:55:32,576 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1296 transitions. Word has length 167 [2019-09-09 05:55:32,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:32,576 INFO L475 AbstractCegarLoop]: Abstraction has 873 states and 1296 transitions. [2019-09-09 05:55:32,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:32,576 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1296 transitions. [2019-09-09 05:55:32,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-09 05:55:32,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:32,577 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:32,577 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:32,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:32,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1430006682, now seen corresponding path program 1 times [2019-09-09 05:55:32,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:32,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:32,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:32,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:32,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:32,720 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:55:32,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:32,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:55:32,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:32,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:55:32,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:55:32,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:32,721 INFO L87 Difference]: Start difference. First operand 873 states and 1296 transitions. Second operand 5 states. [2019-09-09 05:55:33,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:33,321 INFO L93 Difference]: Finished difference Result 1031 states and 1538 transitions. [2019-09-09 05:55:33,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:55:33,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2019-09-09 05:55:33,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:33,323 INFO L225 Difference]: With dead ends: 1031 [2019-09-09 05:55:33,323 INFO L226 Difference]: Without dead ends: 1031 [2019-09-09 05:55:33,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:55:33,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2019-09-09 05:55:33,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 939. [2019-09-09 05:55:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2019-09-09 05:55:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1414 transitions. [2019-09-09 05:55:33,331 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1414 transitions. Word has length 168 [2019-09-09 05:55:33,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:33,332 INFO L475 AbstractCegarLoop]: Abstraction has 939 states and 1414 transitions. [2019-09-09 05:55:33,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:55:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1414 transitions. [2019-09-09 05:55:33,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-09 05:55:33,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:33,333 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:33,333 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:33,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:33,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1523003660, now seen corresponding path program 1 times [2019-09-09 05:55:33,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:33,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:33,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:33,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:33,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-09 05:55:33,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:33,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:33,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:33,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:33,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:33,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:33,420 INFO L87 Difference]: Start difference. First operand 939 states and 1414 transitions. Second operand 4 states. [2019-09-09 05:55:33,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:33,742 INFO L93 Difference]: Finished difference Result 985 states and 1480 transitions. [2019-09-09 05:55:33,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:33,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-09 05:55:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:33,744 INFO L225 Difference]: With dead ends: 985 [2019-09-09 05:55:33,744 INFO L226 Difference]: Without dead ends: 985 [2019-09-09 05:55:33,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:33,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2019-09-09 05:55:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 939. [2019-09-09 05:55:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2019-09-09 05:55:33,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1412 transitions. [2019-09-09 05:55:33,759 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1412 transitions. Word has length 168 [2019-09-09 05:55:33,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:33,759 INFO L475 AbstractCegarLoop]: Abstraction has 939 states and 1412 transitions. [2019-09-09 05:55:33,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:33,760 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1412 transitions. [2019-09-09 05:55:33,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-09 05:55:33,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:33,764 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:33,764 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:33,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:33,765 INFO L82 PathProgramCache]: Analyzing trace with hash -185060975, now seen corresponding path program 1 times [2019-09-09 05:55:33,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:33,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:33,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:33,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:33,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-09 05:55:33,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:33,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:33,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:33,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:33,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:33,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:33,872 INFO L87 Difference]: Start difference. First operand 939 states and 1412 transitions. Second operand 4 states. [2019-09-09 05:55:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:34,198 INFO L93 Difference]: Finished difference Result 1011 states and 1504 transitions. [2019-09-09 05:55:34,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:34,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-09 05:55:34,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:34,200 INFO L225 Difference]: With dead ends: 1011 [2019-09-09 05:55:34,200 INFO L226 Difference]: Without dead ends: 1011 [2019-09-09 05:55:34,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:34,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2019-09-09 05:55:34,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 879. [2019-09-09 05:55:34,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-09-09 05:55:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1320 transitions. [2019-09-09 05:55:34,208 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1320 transitions. Word has length 173 [2019-09-09 05:55:34,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:34,208 INFO L475 AbstractCegarLoop]: Abstraction has 879 states and 1320 transitions. [2019-09-09 05:55:34,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:34,209 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1320 transitions. [2019-09-09 05:55:34,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-09 05:55:34,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:34,210 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:34,210 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:34,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:34,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1218125229, now seen corresponding path program 1 times [2019-09-09 05:55:34,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:34,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:34,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:34,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:34,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:34,992 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:55:34,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:55:34,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:55:34,994 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 174 with the following transitions: [2019-09-09 05:55:34,996 INFO L207 CegarAbsIntRunner]: [0], [43], [48], [50], [61], [63], [67], [76], [78], [83], [88], [93], [98], [103], [108], [113], [118], [121], [123], [128], [133], [136], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [193], [198], [203], [208], [213], [218], [221], [223], [228], [231], [233], [238], [241], [312], [315], [323], [325], [328], [336], [339], [343], [548], [553], [558], [573], [578], [583], [588], [594], [599], [601], [606], [611], [617], [620], [624], [645], [679], [681], [693], [696], [697], [709], [717], [718], [719] [2019-09-09 05:55:35,081 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:55:35,082 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:55:35,158 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:55:35,161 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-09 05:55:35,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:35,165 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:55:35,222 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-09 05:55:35,223 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:55:35,228 INFO L420 sIntCurrentIteration]: We unified 172 AI predicates to 172 [2019-09-09 05:55:35,228 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:55:35,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:55:35,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-09-09 05:55:35,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:35,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-09 05:55:35,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-09 05:55:35,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:55:35,231 INFO L87 Difference]: Start difference. First operand 879 states and 1320 transitions. Second operand 2 states. [2019-09-09 05:55:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:35,231 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-09 05:55:35,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-09 05:55:35,232 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 173 [2019-09-09 05:55:35,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:35,232 INFO L225 Difference]: With dead ends: 2 [2019-09-09 05:55:35,232 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:55:35,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:55:35,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:55:35,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:55:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:55:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:55:35,233 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2019-09-09 05:55:35,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:35,233 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:55:35,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-09 05:55:35,234 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:55:35,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:55:35,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:55:35 BoogieIcfgContainer [2019-09-09 05:55:35,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:55:35,241 INFO L168 Benchmark]: Toolchain (without parser) took 51771.91 ms. Allocated memory was 131.1 MB in the beginning and 753.4 MB in the end (delta: 622.3 MB). Free memory was 84.4 MB in the beginning and 296.9 MB in the end (delta: -212.5 MB). Peak memory consumption was 409.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:35,242 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 131.1 MB. Free memory was 105.5 MB in the beginning and 105.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:55:35,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1048.01 ms. Allocated memory was 131.1 MB in the beginning and 199.8 MB in the end (delta: 68.7 MB). Free memory was 84.0 MB in the beginning and 154.8 MB in the end (delta: -70.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:35,243 INFO L168 Benchmark]: Boogie Preprocessor took 189.98 ms. Allocated memory is still 199.8 MB. Free memory was 154.8 MB in the beginning and 146.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:35,244 INFO L168 Benchmark]: RCFGBuilder took 1341.63 ms. Allocated memory was 199.8 MB in the beginning and 220.2 MB in the end (delta: 20.4 MB). Free memory was 146.7 MB in the beginning and 163.3 MB in the end (delta: -16.6 MB). Peak memory consumption was 84.1 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:35,244 INFO L168 Benchmark]: TraceAbstraction took 49184.16 ms. Allocated memory was 220.2 MB in the beginning and 753.4 MB in the end (delta: 533.2 MB). Free memory was 163.3 MB in the beginning and 296.9 MB in the end (delta: -133.6 MB). Peak memory consumption was 399.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:35,247 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 131.1 MB. Free memory was 105.5 MB in the beginning and 105.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1048.01 ms. Allocated memory was 131.1 MB in the beginning and 199.8 MB in the end (delta: 68.7 MB). Free memory was 84.0 MB in the beginning and 154.8 MB in the end (delta: -70.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 189.98 ms. Allocated memory is still 199.8 MB. Free memory was 154.8 MB in the beginning and 146.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1341.63 ms. Allocated memory was 199.8 MB in the beginning and 220.2 MB in the end (delta: 20.4 MB). Free memory was 146.7 MB in the beginning and 163.3 MB in the end (delta: -16.6 MB). Peak memory consumption was 84.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49184.16 ms. Allocated memory was 220.2 MB in the beginning and 753.4 MB in the end (delta: 533.2 MB). Free memory was 163.3 MB in the beginning and 296.9 MB in the end (delta: -133.6 MB). Peak memory consumption was 399.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1750]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 191 locations, 1 error locations. SAFE Result, 49.1s OverallTime, 108 OverallIterations, 7 TraceHistogramMax, 38.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 25238 SDtfs, 7275 SDslu, 37696 SDs, 0 SdLazy, 22312 SolverSat, 804 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 758 GetRequests, 392 SyntacticMatches, 46 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=939occurred in iteration=105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.2383720930232558 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 108 MinimizatonAttempts, 6442 StatesRemovedByMinimization, 107 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 13361 NumberOfCodeBlocks, 13361 NumberOfCodeBlocksAsserted, 108 NumberOfCheckSat, 13253 ConstructedInterpolants, 0 QuantifiedInterpolants, 4656854 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 108 InterpolantComputations, 107 PerfectInterpolantSequences, 13168/13353 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...