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.06.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:53:21,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:53:21,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:53:21,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:53:21,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:53:21,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:53:21,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:53:21,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:53:21,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:53:21,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:53:21,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:53:21,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:53:21,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:53:21,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:53:21,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:53:21,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:53:21,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:53:21,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:53:21,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:53:21,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:53:21,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:53:21,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:53:21,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:53:21,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:53:21,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:53:21,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:53:21,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:53:21,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:53:21,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:53:21,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:53:21,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:53:21,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:53:21,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:53:21,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:53:21,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:53:21,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:53:21,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:53:21,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:53:21,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:53:21,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:53:21,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:53:21,538 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:53:21,553 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:53:21,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:53:21,554 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:53:21,554 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:53:21,555 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:53:21,555 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:53:21,555 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:53:21,555 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:53:21,555 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:53:21,556 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:53:21,556 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:53:21,557 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:53:21,557 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:53:21,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:53:21,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:53:21,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:53:21,557 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:53:21,558 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:53:21,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:53:21,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:53:21,558 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:53:21,559 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:53:21,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:53:21,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:53:21,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:53:21,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:53:21,560 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:53:21,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:53:21,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:53:21,560 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:53:21,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:53:21,605 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:53:21,608 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:53:21,610 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:53:21,610 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:53:21,611 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.06.i.cil-1.c [2019-09-09 05:53:21,672 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d644311ef/12aff5f15e514e63be402dae0f040780/FLAG0269100bf [2019-09-09 05:53:22,305 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:53:22,306 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.06.i.cil-1.c [2019-09-09 05:53:22,332 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d644311ef/12aff5f15e514e63be402dae0f040780/FLAG0269100bf [2019-09-09 05:53:22,473 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d644311ef/12aff5f15e514e63be402dae0f040780 [2019-09-09 05:53:22,484 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:53:22,486 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:53:22,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:53:22,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:53:22,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:53:22,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:53:22" (1/1) ... [2019-09-09 05:53:22,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5338cd07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:22, skipping insertion in model container [2019-09-09 05:53:22,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:53:22" (1/1) ... [2019-09-09 05:53:22,505 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:53:22,584 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:53:23,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:53:23,215 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:53:23,403 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:53:23,444 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:53:23,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:23 WrapperNode [2019-09-09 05:53:23,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:53:23,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:53:23,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:53:23,447 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:53:23,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:23" (1/1) ... [2019-09-09 05:53:23,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:23" (1/1) ... [2019-09-09 05:53:23,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:23" (1/1) ... [2019-09-09 05:53:23,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:23" (1/1) ... [2019-09-09 05:53:23,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:23" (1/1) ... [2019-09-09 05:53:23,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:23" (1/1) ... [2019-09-09 05:53:23,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:23" (1/1) ... [2019-09-09 05:53:23,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:53:23,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:53:23,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:53:23,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:53:23,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:23" (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:53:23,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:53:23,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:53:23,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-09 05:53:23,735 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-09 05:53:23,735 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:53:23,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:53:23,735 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-09 05:53:23,735 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-09 05:53:23,735 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-09 05:53:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:53:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-09 05:53:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:53:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:53:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:53:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:53:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-09 05:53:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-09 05:53:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-09 05:53:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:53:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-09 05:53:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-09 05:53:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-09 05:53:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:53:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-09 05:53:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-09 05:53:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-09 05:53:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-09 05:53:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-09 05:53:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-09 05:53:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:53:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-09 05:53:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-09 05:53:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-09 05:53:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:53:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-09 05:53:23,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-09 05:53:23,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-09 05:53:23,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-09 05:53:23,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-09 05:53:24,206 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:53:24,924 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-09 05:53:24,924 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-09 05:53:24,948 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:53:24,948 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:53:24,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:53:24 BoogieIcfgContainer [2019-09-09 05:53:24,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:53:24,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:53:24,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:53:24,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:53:24,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:53:22" (1/3) ... [2019-09-09 05:53:24,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a0ac1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:53:24, skipping insertion in model container [2019-09-09 05:53:24,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:23" (2/3) ... [2019-09-09 05:53:24,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a0ac1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:53:24, skipping insertion in model container [2019-09-09 05:53:24,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:53:24" (3/3) ... [2019-09-09 05:53:24,958 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06.i.cil-1.c [2019-09-09 05:53:24,969 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:53:24,981 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:53:24,999 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:53:25,040 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:53:25,040 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:53:25,040 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:53:25,040 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:53:25,040 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:53:25,040 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:53:25,041 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:53:25,041 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:53:25,061 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states. [2019-09-09 05:53:25,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-09 05:53:25,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:25,077 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:25,080 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:25,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:25,086 INFO L82 PathProgramCache]: Analyzing trace with hash -232634089, now seen corresponding path program 1 times [2019-09-09 05:53:25,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:25,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:25,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:25,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:25,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:25,515 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:53:25,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:25,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:25,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:25,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:25,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:25,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:25,545 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 4 states. [2019-09-09 05:53:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:26,021 INFO L93 Difference]: Finished difference Result 201 states and 332 transitions. [2019-09-09 05:53:26,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:26,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-09-09 05:53:26,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:26,038 INFO L225 Difference]: With dead ends: 201 [2019-09-09 05:53:26,039 INFO L226 Difference]: Without dead ends: 180 [2019-09-09 05:53:26,041 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:53:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-09 05:53:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-09-09 05:53:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-09 05:53:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 254 transitions. [2019-09-09 05:53:26,111 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 254 transitions. Word has length 50 [2019-09-09 05:53:26,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:26,111 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 254 transitions. [2019-09-09 05:53:26,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:26,112 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 254 transitions. [2019-09-09 05:53:26,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:53:26,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:26,119 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:26,119 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:26,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:26,120 INFO L82 PathProgramCache]: Analyzing trace with hash 349129836, now seen corresponding path program 1 times [2019-09-09 05:53:26,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:26,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:26,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:26,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:26,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:26,303 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:53:26,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:26,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:26,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:26,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:26,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:26,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:26,307 INFO L87 Difference]: Start difference. First operand 163 states and 254 transitions. Second operand 4 states. [2019-09-09 05:53:26,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:26,687 INFO L93 Difference]: Finished difference Result 180 states and 274 transitions. [2019-09-09 05:53:26,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:26,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:53:26,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:26,691 INFO L225 Difference]: With dead ends: 180 [2019-09-09 05:53:26,691 INFO L226 Difference]: Without dead ends: 180 [2019-09-09 05:53:26,692 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:53:26,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-09 05:53:26,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-09-09 05:53:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-09 05:53:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 253 transitions. [2019-09-09 05:53:26,705 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 253 transitions. Word has length 63 [2019-09-09 05:53:26,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:26,705 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 253 transitions. [2019-09-09 05:53:26,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 253 transitions. [2019-09-09 05:53:26,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:53:26,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:26,714 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:26,714 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:26,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:26,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1878433696, now seen corresponding path program 1 times [2019-09-09 05:53:26,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:26,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:26,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:26,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:26,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:26,855 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:53:26,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:26,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:26,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:26,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:26,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:26,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:26,857 INFO L87 Difference]: Start difference. First operand 163 states and 253 transitions. Second operand 4 states. [2019-09-09 05:53:27,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:27,186 INFO L93 Difference]: Finished difference Result 179 states and 272 transitions. [2019-09-09 05:53:27,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:27,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-09 05:53:27,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:27,189 INFO L225 Difference]: With dead ends: 179 [2019-09-09 05:53:27,190 INFO L226 Difference]: Without dead ends: 179 [2019-09-09 05:53:27,190 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:53:27,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-09 05:53:27,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 163. [2019-09-09 05:53:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-09 05:53:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 252 transitions. [2019-09-09 05:53:27,200 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 252 transitions. Word has length 64 [2019-09-09 05:53:27,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:27,201 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 252 transitions. [2019-09-09 05:53:27,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 252 transitions. [2019-09-09 05:53:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:53:27,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:27,203 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:27,204 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:27,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:27,204 INFO L82 PathProgramCache]: Analyzing trace with hash 780998220, now seen corresponding path program 1 times [2019-09-09 05:53:27,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:27,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:27,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:27,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:27,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:27,282 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:53:27,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:27,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:53:27,283 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:27,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:53:27,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:53:27,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:27,284 INFO L87 Difference]: Start difference. First operand 163 states and 252 transitions. Second operand 5 states. [2019-09-09 05:53:27,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:27,865 INFO L93 Difference]: Finished difference Result 184 states and 280 transitions. [2019-09-09 05:53:27,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:53:27,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-09 05:53:27,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:27,867 INFO L225 Difference]: With dead ends: 184 [2019-09-09 05:53:27,867 INFO L226 Difference]: Without dead ends: 184 [2019-09-09 05:53:27,868 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:53:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-09 05:53:27,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-09-09 05:53:27,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-09 05:53:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 279 transitions. [2019-09-09 05:53:27,877 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 279 transitions. Word has length 64 [2019-09-09 05:53:27,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:27,877 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 279 transitions. [2019-09-09 05:53:27,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:53:27,878 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 279 transitions. [2019-09-09 05:53:27,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:53:27,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:27,879 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:27,880 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:27,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:27,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1214135404, now seen corresponding path program 1 times [2019-09-09 05:53:27,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:27,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:27,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:27,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:27,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:27,940 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:53:27,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:27,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:27,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:27,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:27,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:27,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:27,943 INFO L87 Difference]: Start difference. First operand 183 states and 279 transitions. Second operand 4 states. [2019-09-09 05:53:28,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:28,301 INFO L93 Difference]: Finished difference Result 198 states and 296 transitions. [2019-09-09 05:53:28,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:28,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-09 05:53:28,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:28,303 INFO L225 Difference]: With dead ends: 198 [2019-09-09 05:53:28,304 INFO L226 Difference]: Without dead ends: 198 [2019-09-09 05:53:28,304 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:53:28,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-09 05:53:28,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 183. [2019-09-09 05:53:28,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-09 05:53:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 278 transitions. [2019-09-09 05:53:28,313 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 278 transitions. Word has length 64 [2019-09-09 05:53:28,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:28,313 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 278 transitions. [2019-09-09 05:53:28,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:28,313 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 278 transitions. [2019-09-09 05:53:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:53:28,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:28,315 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:28,315 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:28,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:28,316 INFO L82 PathProgramCache]: Analyzing trace with hash 986471861, now seen corresponding path program 1 times [2019-09-09 05:53:28,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:28,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:28,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:28,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:28,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:28,381 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:53:28,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:28,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:28,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:28,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:28,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:28,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:28,383 INFO L87 Difference]: Start difference. First operand 183 states and 278 transitions. Second operand 4 states. [2019-09-09 05:53:28,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:28,641 INFO L93 Difference]: Finished difference Result 196 states and 293 transitions. [2019-09-09 05:53:28,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:28,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-09 05:53:28,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:28,643 INFO L225 Difference]: With dead ends: 196 [2019-09-09 05:53:28,643 INFO L226 Difference]: Without dead ends: 196 [2019-09-09 05:53:28,644 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:53:28,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-09 05:53:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 183. [2019-09-09 05:53:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-09 05:53:28,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 277 transitions. [2019-09-09 05:53:28,651 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 277 transitions. Word has length 64 [2019-09-09 05:53:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:28,651 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 277 transitions. [2019-09-09 05:53:28,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:28,652 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 277 transitions. [2019-09-09 05:53:28,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:53:28,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:28,653 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:28,653 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:28,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:28,654 INFO L82 PathProgramCache]: Analyzing trace with hash 922088847, now seen corresponding path program 1 times [2019-09-09 05:53:28,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:28,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:28,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:28,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:28,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:28,713 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:53:28,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:28,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:28,714 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:28,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:28,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:28,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:28,715 INFO L87 Difference]: Start difference. First operand 183 states and 277 transitions. Second operand 4 states. [2019-09-09 05:53:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:29,002 INFO L93 Difference]: Finished difference Result 196 states and 292 transitions. [2019-09-09 05:53:29,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:29,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-09 05:53:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:29,004 INFO L225 Difference]: With dead ends: 196 [2019-09-09 05:53:29,004 INFO L226 Difference]: Without dead ends: 196 [2019-09-09 05:53:29,004 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:53:29,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-09 05:53:29,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 183. [2019-09-09 05:53:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-09 05:53:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 276 transitions. [2019-09-09 05:53:29,010 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 276 transitions. Word has length 65 [2019-09-09 05:53:29,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:29,011 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 276 transitions. [2019-09-09 05:53:29,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:29,011 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 276 transitions. [2019-09-09 05:53:29,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-09 05:53:29,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:29,012 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:29,012 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:29,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:29,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1054711976, now seen corresponding path program 1 times [2019-09-09 05:53:29,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:29,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:29,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:29,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:29,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:29,080 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:53:29,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:29,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:29,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:29,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:29,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:29,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:29,083 INFO L87 Difference]: Start difference. First operand 183 states and 276 transitions. Second operand 4 states. [2019-09-09 05:53:29,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:29,371 INFO L93 Difference]: Finished difference Result 196 states and 291 transitions. [2019-09-09 05:53:29,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:29,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-09 05:53:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:29,373 INFO L225 Difference]: With dead ends: 196 [2019-09-09 05:53:29,374 INFO L226 Difference]: Without dead ends: 196 [2019-09-09 05:53:29,374 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:53:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-09 05:53:29,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 183. [2019-09-09 05:53:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-09 05:53:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 275 transitions. [2019-09-09 05:53:29,380 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 275 transitions. Word has length 66 [2019-09-09 05:53:29,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:29,380 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 275 transitions. [2019-09-09 05:53:29,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:29,380 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 275 transitions. [2019-09-09 05:53:29,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-09 05:53:29,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:29,381 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:29,382 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:29,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:29,382 INFO L82 PathProgramCache]: Analyzing trace with hash 2050175156, now seen corresponding path program 1 times [2019-09-09 05:53:29,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:29,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:29,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:29,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:29,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:29,431 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:53:29,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:29,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:29,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:29,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:29,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:29,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:29,433 INFO L87 Difference]: Start difference. First operand 183 states and 275 transitions. Second operand 4 states. [2019-09-09 05:53:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:29,731 INFO L93 Difference]: Finished difference Result 196 states and 290 transitions. [2019-09-09 05:53:29,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:29,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-09 05:53:29,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:29,733 INFO L225 Difference]: With dead ends: 196 [2019-09-09 05:53:29,733 INFO L226 Difference]: Without dead ends: 196 [2019-09-09 05:53:29,734 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:53:29,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-09 05:53:29,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 183. [2019-09-09 05:53:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-09 05:53:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 274 transitions. [2019-09-09 05:53:29,740 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 274 transitions. Word has length 67 [2019-09-09 05:53:29,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:29,740 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 274 transitions. [2019-09-09 05:53:29,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:29,741 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 274 transitions. [2019-09-09 05:53:29,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-09 05:53:29,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:29,742 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:29,742 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:29,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:29,742 INFO L82 PathProgramCache]: Analyzing trace with hash -415898059, now seen corresponding path program 1 times [2019-09-09 05:53:29,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:29,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:29,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:29,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:29,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:29,794 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:53:29,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:29,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:29,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:29,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:29,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:29,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:29,795 INFO L87 Difference]: Start difference. First operand 183 states and 274 transitions. Second operand 4 states. [2019-09-09 05:53:30,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:30,096 INFO L93 Difference]: Finished difference Result 225 states and 336 transitions. [2019-09-09 05:53:30,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:30,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-09 05:53:30,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:30,099 INFO L225 Difference]: With dead ends: 225 [2019-09-09 05:53:30,100 INFO L226 Difference]: Without dead ends: 225 [2019-09-09 05:53:30,100 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:53:30,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-09 05:53:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 205. [2019-09-09 05:53:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-09 05:53:30,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 311 transitions. [2019-09-09 05:53:30,108 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 311 transitions. Word has length 67 [2019-09-09 05:53:30,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:30,108 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 311 transitions. [2019-09-09 05:53:30,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:30,109 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 311 transitions. [2019-09-09 05:53:30,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-09 05:53:30,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:30,110 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:30,110 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:30,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:30,111 INFO L82 PathProgramCache]: Analyzing trace with hash -521368355, now seen corresponding path program 1 times [2019-09-09 05:53:30,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:30,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:30,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:30,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:30,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:30,199 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:53:30,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:30,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:30,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:30,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:30,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:30,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:30,201 INFO L87 Difference]: Start difference. First operand 205 states and 311 transitions. Second operand 4 states. [2019-09-09 05:53:30,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:30,479 INFO L93 Difference]: Finished difference Result 208 states and 314 transitions. [2019-09-09 05:53:30,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:30,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-09 05:53:30,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:30,481 INFO L225 Difference]: With dead ends: 208 [2019-09-09 05:53:30,481 INFO L226 Difference]: Without dead ends: 208 [2019-09-09 05:53:30,482 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:53:30,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-09 05:53:30,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 205. [2019-09-09 05:53:30,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-09 05:53:30,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 310 transitions. [2019-09-09 05:53:30,488 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 310 transitions. Word has length 68 [2019-09-09 05:53:30,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:30,489 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 310 transitions. [2019-09-09 05:53:30,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:30,489 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 310 transitions. [2019-09-09 05:53:30,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:53:30,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:30,490 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:30,491 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:30,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:30,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1287622642, now seen corresponding path program 1 times [2019-09-09 05:53:30,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:30,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:30,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:30,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:30,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:30,556 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:53:30,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:30,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:30,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:30,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:30,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:30,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:30,558 INFO L87 Difference]: Start difference. First operand 205 states and 310 transitions. Second operand 4 states. [2019-09-09 05:53:30,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:30,866 INFO L93 Difference]: Finished difference Result 225 states and 334 transitions. [2019-09-09 05:53:30,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:30,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:53:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:30,868 INFO L225 Difference]: With dead ends: 225 [2019-09-09 05:53:30,868 INFO L226 Difference]: Without dead ends: 225 [2019-09-09 05:53:30,869 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:53:30,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-09 05:53:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 205. [2019-09-09 05:53:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-09 05:53:30,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 309 transitions. [2019-09-09 05:53:30,876 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 309 transitions. Word has length 80 [2019-09-09 05:53:30,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:30,877 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 309 transitions. [2019-09-09 05:53:30,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 309 transitions. [2019-09-09 05:53:30,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 05:53:30,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:30,878 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:30,878 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:30,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:30,879 INFO L82 PathProgramCache]: Analyzing trace with hash -413854670, now seen corresponding path program 1 times [2019-09-09 05:53:30,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:30,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:30,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:30,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:30,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:30,935 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:53:30,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:30,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:30,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:30,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:30,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:30,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:30,938 INFO L87 Difference]: Start difference. First operand 205 states and 309 transitions. Second operand 4 states. [2019-09-09 05:53:31,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:31,228 INFO L93 Difference]: Finished difference Result 224 states and 332 transitions. [2019-09-09 05:53:31,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:31,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-09 05:53:31,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:31,229 INFO L225 Difference]: With dead ends: 224 [2019-09-09 05:53:31,230 INFO L226 Difference]: Without dead ends: 224 [2019-09-09 05:53:31,230 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:53:31,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-09 05:53:31,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 205. [2019-09-09 05:53:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-09 05:53:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 308 transitions. [2019-09-09 05:53:31,240 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 308 transitions. Word has length 81 [2019-09-09 05:53:31,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:31,242 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 308 transitions. [2019-09-09 05:53:31,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:31,242 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 308 transitions. [2019-09-09 05:53:31,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 05:53:31,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:31,243 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:31,243 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:31,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:31,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1786752595, now seen corresponding path program 1 times [2019-09-09 05:53:31,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:31,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:31,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:31,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:31,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:31,307 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:53:31,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:31,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:31,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:31,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:31,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:31,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:31,308 INFO L87 Difference]: Start difference. First operand 205 states and 308 transitions. Second operand 4 states. [2019-09-09 05:53:31,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:31,636 INFO L93 Difference]: Finished difference Result 222 states and 329 transitions. [2019-09-09 05:53:31,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:31,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-09 05:53:31,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:31,638 INFO L225 Difference]: With dead ends: 222 [2019-09-09 05:53:31,638 INFO L226 Difference]: Without dead ends: 222 [2019-09-09 05:53:31,639 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:53:31,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-09 05:53:31,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2019-09-09 05:53:31,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-09 05:53:31,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 307 transitions. [2019-09-09 05:53:31,645 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 307 transitions. Word has length 81 [2019-09-09 05:53:31,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:31,645 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 307 transitions. [2019-09-09 05:53:31,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:31,646 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 307 transitions. [2019-09-09 05:53:31,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-09 05:53:31,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:31,647 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:31,647 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:31,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:31,648 INFO L82 PathProgramCache]: Analyzing trace with hash -39012175, now seen corresponding path program 1 times [2019-09-09 05:53:31,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:31,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:31,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:31,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:31,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:31,706 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:53:31,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:31,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:31,707 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:31,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:31,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:31,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:31,708 INFO L87 Difference]: Start difference. First operand 205 states and 307 transitions. Second operand 4 states. [2019-09-09 05:53:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:31,981 INFO L93 Difference]: Finished difference Result 222 states and 328 transitions. [2019-09-09 05:53:31,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:31,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-09 05:53:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:31,983 INFO L225 Difference]: With dead ends: 222 [2019-09-09 05:53:31,983 INFO L226 Difference]: Without dead ends: 222 [2019-09-09 05:53:31,984 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:53:31,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-09 05:53:31,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2019-09-09 05:53:31,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-09 05:53:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 306 transitions. [2019-09-09 05:53:31,989 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 306 transitions. Word has length 82 [2019-09-09 05:53:31,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:31,989 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 306 transitions. [2019-09-09 05:53:31,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:31,990 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 306 transitions. [2019-09-09 05:53:31,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-09 05:53:31,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:31,991 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:31,991 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:31,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:31,992 INFO L82 PathProgramCache]: Analyzing trace with hash -784072586, now seen corresponding path program 1 times [2019-09-09 05:53:31,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:31,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:31,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:31,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:31,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:32,067 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:53:32,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:32,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:32,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:32,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:32,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:32,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:32,069 INFO L87 Difference]: Start difference. First operand 205 states and 306 transitions. Second operand 4 states. [2019-09-09 05:53:32,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:32,364 INFO L93 Difference]: Finished difference Result 222 states and 327 transitions. [2019-09-09 05:53:32,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:32,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-09 05:53:32,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:32,366 INFO L225 Difference]: With dead ends: 222 [2019-09-09 05:53:32,366 INFO L226 Difference]: Without dead ends: 222 [2019-09-09 05:53:32,367 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:53:32,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-09 05:53:32,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2019-09-09 05:53:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-09 05:53:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 305 transitions. [2019-09-09 05:53:32,372 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 305 transitions. Word has length 83 [2019-09-09 05:53:32,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:32,373 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 305 transitions. [2019-09-09 05:53:32,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:32,373 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 305 transitions. [2019-09-09 05:53:32,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-09 05:53:32,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:32,374 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:32,374 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:32,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:32,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1850061654, now seen corresponding path program 1 times [2019-09-09 05:53:32,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:32,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:32,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:32,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:32,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:32,424 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:53:32,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:32,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:32,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:32,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:32,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:32,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:32,426 INFO L87 Difference]: Start difference. First operand 205 states and 305 transitions. Second operand 4 states. [2019-09-09 05:53:32,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:32,697 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2019-09-09 05:53:32,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:32,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-09 05:53:32,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:32,700 INFO L225 Difference]: With dead ends: 222 [2019-09-09 05:53:32,700 INFO L226 Difference]: Without dead ends: 222 [2019-09-09 05:53:32,701 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:53:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-09 05:53:32,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2019-09-09 05:53:32,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-09 05:53:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 304 transitions. [2019-09-09 05:53:32,707 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 304 transitions. Word has length 84 [2019-09-09 05:53:32,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:32,707 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 304 transitions. [2019-09-09 05:53:32,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:32,708 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 304 transitions. [2019-09-09 05:53:32,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-09 05:53:32,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:32,709 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:32,710 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:32,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:32,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1865047675, now seen corresponding path program 1 times [2019-09-09 05:53:32,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:32,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:32,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:32,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:32,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:32,800 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:53:32,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:32,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:32,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:32,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:32,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:32,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:32,801 INFO L87 Difference]: Start difference. First operand 205 states and 304 transitions. Second operand 4 states. [2019-09-09 05:53:33,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:33,065 INFO L93 Difference]: Finished difference Result 212 states and 313 transitions. [2019-09-09 05:53:33,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:33,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-09 05:53:33,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:33,067 INFO L225 Difference]: With dead ends: 212 [2019-09-09 05:53:33,067 INFO L226 Difference]: Without dead ends: 212 [2019-09-09 05:53:33,067 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:53:33,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-09 05:53:33,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 205. [2019-09-09 05:53:33,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-09 05:53:33,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 303 transitions. [2019-09-09 05:53:33,073 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 303 transitions. Word has length 85 [2019-09-09 05:53:33,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:33,074 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 303 transitions. [2019-09-09 05:53:33,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 303 transitions. [2019-09-09 05:53:33,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 05:53:33,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:33,075 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:33,075 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:33,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:33,076 INFO L82 PathProgramCache]: Analyzing trace with hash -530152541, now seen corresponding path program 1 times [2019-09-09 05:53:33,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:33,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:33,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:33,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:33,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:33,158 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:53:33,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:33,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:33,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:33,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:33,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:33,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:33,161 INFO L87 Difference]: Start difference. First operand 205 states and 303 transitions. Second operand 4 states. [2019-09-09 05:53:33,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:33,665 INFO L93 Difference]: Finished difference Result 319 states and 480 transitions. [2019-09-09 05:53:33,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:33,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-09 05:53:33,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:33,668 INFO L225 Difference]: With dead ends: 319 [2019-09-09 05:53:33,669 INFO L226 Difference]: Without dead ends: 319 [2019-09-09 05:53:33,670 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:53:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-09 05:53:33,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 246. [2019-09-09 05:53:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-09-09 05:53:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 376 transitions. [2019-09-09 05:53:33,681 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 376 transitions. Word has length 89 [2019-09-09 05:53:33,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:33,682 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 376 transitions. [2019-09-09 05:53:33,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:33,682 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 376 transitions. [2019-09-09 05:53:33,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 05:53:33,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:33,685 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:33,685 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:33,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:33,686 INFO L82 PathProgramCache]: Analyzing trace with hash -282006047, now seen corresponding path program 1 times [2019-09-09 05:53:33,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:33,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:33,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:33,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:33,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:33,833 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:53:33,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:33,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:33,834 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:33,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:33,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:33,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:33,835 INFO L87 Difference]: Start difference. First operand 246 states and 376 transitions. Second operand 4 states. [2019-09-09 05:53:34,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:34,273 INFO L93 Difference]: Finished difference Result 295 states and 449 transitions. [2019-09-09 05:53:34,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:34,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-09 05:53:34,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:34,275 INFO L225 Difference]: With dead ends: 295 [2019-09-09 05:53:34,276 INFO L226 Difference]: Without dead ends: 295 [2019-09-09 05:53:34,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:34,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-09 05:53:34,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 270. [2019-09-09 05:53:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-09 05:53:34,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 417 transitions. [2019-09-09 05:53:34,284 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 417 transitions. Word has length 89 [2019-09-09 05:53:34,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:34,285 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 417 transitions. [2019-09-09 05:53:34,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:34,285 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 417 transitions. [2019-09-09 05:53:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-09 05:53:34,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:34,286 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:34,286 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:34,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:34,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1774496135, now seen corresponding path program 1 times [2019-09-09 05:53:34,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:34,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:34,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:34,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:34,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:34,423 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:53:34,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:34,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:34,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:34,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:34,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:34,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:34,425 INFO L87 Difference]: Start difference. First operand 270 states and 417 transitions. Second operand 4 states. [2019-09-09 05:53:34,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:34,840 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-09-09 05:53:34,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:34,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-09 05:53:34,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:34,844 INFO L225 Difference]: With dead ends: 334 [2019-09-09 05:53:34,844 INFO L226 Difference]: Without dead ends: 334 [2019-09-09 05:53:34,844 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:53:34,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-09 05:53:34,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 271. [2019-09-09 05:53:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-09 05:53:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 418 transitions. [2019-09-09 05:53:34,853 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 418 transitions. Word has length 90 [2019-09-09 05:53:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:34,854 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 418 transitions. [2019-09-09 05:53:34,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 418 transitions. [2019-09-09 05:53:34,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:53:34,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:34,856 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:34,856 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:34,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:34,856 INFO L82 PathProgramCache]: Analyzing trace with hash 973313376, now seen corresponding path program 1 times [2019-09-09 05:53:34,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:34,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:34,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:34,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:34,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:34,939 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:53:34,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:34,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:34,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:34,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:34,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:34,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:34,941 INFO L87 Difference]: Start difference. First operand 271 states and 418 transitions. Second operand 4 states. [2019-09-09 05:53:35,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:35,401 INFO L93 Difference]: Finished difference Result 334 states and 506 transitions. [2019-09-09 05:53:35,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:35,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:53:35,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:35,406 INFO L225 Difference]: With dead ends: 334 [2019-09-09 05:53:35,406 INFO L226 Difference]: Without dead ends: 334 [2019-09-09 05:53:35,406 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:53:35,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-09 05:53:35,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 271. [2019-09-09 05:53:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-09 05:53:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 417 transitions. [2019-09-09 05:53:35,413 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 417 transitions. Word has length 102 [2019-09-09 05:53:35,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:35,413 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 417 transitions. [2019-09-09 05:53:35,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:35,413 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 417 transitions. [2019-09-09 05:53:35,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:53:35,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:35,415 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:35,415 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:35,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:35,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1934868510, now seen corresponding path program 1 times [2019-09-09 05:53:35,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:35,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:35,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:35,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:35,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:35,496 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:53:35,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:35,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:35,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:35,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:35,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:35,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:35,498 INFO L87 Difference]: Start difference. First operand 271 states and 417 transitions. Second operand 4 states. [2019-09-09 05:53:35,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:35,958 INFO L93 Difference]: Finished difference Result 296 states and 448 transitions. [2019-09-09 05:53:35,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:35,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:53:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:35,961 INFO L225 Difference]: With dead ends: 296 [2019-09-09 05:53:35,961 INFO L226 Difference]: Without dead ends: 296 [2019-09-09 05:53:35,961 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:53:35,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-09 05:53:35,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 271. [2019-09-09 05:53:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-09 05:53:35,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 416 transitions. [2019-09-09 05:53:35,970 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 416 transitions. Word has length 102 [2019-09-09 05:53:35,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:35,971 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 416 transitions. [2019-09-09 05:53:35,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:35,971 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 416 transitions. [2019-09-09 05:53:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:53:35,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:35,974 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:35,974 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:35,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:35,975 INFO L82 PathProgramCache]: Analyzing trace with hash 955685152, now seen corresponding path program 1 times [2019-09-09 05:53:35,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:35,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:35,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:35,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:35,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:36,093 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:53:36,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:36,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:36,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:36,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:36,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:36,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:36,098 INFO L87 Difference]: Start difference. First operand 271 states and 416 transitions. Second operand 4 states. [2019-09-09 05:53:36,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:36,661 INFO L93 Difference]: Finished difference Result 333 states and 503 transitions. [2019-09-09 05:53:36,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:36,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:53:36,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:36,663 INFO L225 Difference]: With dead ends: 333 [2019-09-09 05:53:36,664 INFO L226 Difference]: Without dead ends: 333 [2019-09-09 05:53:36,664 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:53:36,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-09 05:53:36,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 271. [2019-09-09 05:53:36,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-09 05:53:36,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 415 transitions. [2019-09-09 05:53:36,670 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 415 transitions. Word has length 103 [2019-09-09 05:53:36,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:36,671 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 415 transitions. [2019-09-09 05:53:36,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:36,671 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 415 transitions. [2019-09-09 05:53:36,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:53:36,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:36,672 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:36,673 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:36,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:36,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1138674879, now seen corresponding path program 1 times [2019-09-09 05:53:36,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:36,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:36,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:36,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:36,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:36,736 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:53:36,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:36,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:36,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:36,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:36,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:36,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:36,737 INFO L87 Difference]: Start difference. First operand 271 states and 415 transitions. Second operand 4 states. [2019-09-09 05:53:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:37,143 INFO L93 Difference]: Finished difference Result 331 states and 500 transitions. [2019-09-09 05:53:37,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:37,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:53:37,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:37,149 INFO L225 Difference]: With dead ends: 331 [2019-09-09 05:53:37,149 INFO L226 Difference]: Without dead ends: 331 [2019-09-09 05:53:37,149 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:53:37,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-09 05:53:37,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 271. [2019-09-09 05:53:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-09 05:53:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 414 transitions. [2019-09-09 05:53:37,155 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 414 transitions. Word has length 103 [2019-09-09 05:53:37,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:37,156 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 414 transitions. [2019-09-09 05:53:37,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:37,156 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 414 transitions. [2019-09-09 05:53:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:53:37,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:37,157 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:37,158 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:37,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:37,158 INFO L82 PathProgramCache]: Analyzing trace with hash 996359902, now seen corresponding path program 1 times [2019-09-09 05:53:37,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:37,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:37,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:37,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:37,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:37,217 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:53:37,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:37,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:37,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:37,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:37,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:37,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:37,219 INFO L87 Difference]: Start difference. First operand 271 states and 414 transitions. Second operand 4 states. [2019-09-09 05:53:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:37,547 INFO L93 Difference]: Finished difference Result 295 states and 444 transitions. [2019-09-09 05:53:37,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:37,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:53:37,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:37,551 INFO L225 Difference]: With dead ends: 295 [2019-09-09 05:53:37,551 INFO L226 Difference]: Without dead ends: 295 [2019-09-09 05:53:37,552 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:53:37,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-09 05:53:37,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 271. [2019-09-09 05:53:37,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-09 05:53:37,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 413 transitions. [2019-09-09 05:53:37,559 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 413 transitions. Word has length 103 [2019-09-09 05:53:37,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:37,559 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 413 transitions. [2019-09-09 05:53:37,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 413 transitions. [2019-09-09 05:53:37,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:53:37,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:37,561 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:37,561 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:37,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:37,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1098000129, now seen corresponding path program 1 times [2019-09-09 05:53:37,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:37,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:37,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:37,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:37,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:37,635 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:53:37,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:37,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:37,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:37,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:37,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:37,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:37,637 INFO L87 Difference]: Start difference. First operand 271 states and 413 transitions. Second operand 4 states. [2019-09-09 05:53:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:37,983 INFO L93 Difference]: Finished difference Result 293 states and 441 transitions. [2019-09-09 05:53:37,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:37,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:53:37,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:37,986 INFO L225 Difference]: With dead ends: 293 [2019-09-09 05:53:37,986 INFO L226 Difference]: Without dead ends: 293 [2019-09-09 05:53:37,986 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:53:37,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-09 05:53:37,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 271. [2019-09-09 05:53:37,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-09 05:53:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 412 transitions. [2019-09-09 05:53:37,992 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 412 transitions. Word has length 103 [2019-09-09 05:53:37,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:37,993 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 412 transitions. [2019-09-09 05:53:37,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 412 transitions. [2019-09-09 05:53:37,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:53:37,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:37,994 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:37,995 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:37,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:37,995 INFO L82 PathProgramCache]: Analyzing trace with hash -532950653, now seen corresponding path program 1 times [2019-09-09 05:53:37,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:37,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:37,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:37,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:37,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:38,072 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:53:38,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:38,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:38,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:38,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:38,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:38,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:38,074 INFO L87 Difference]: Start difference. First operand 271 states and 412 transitions. Second operand 4 states. [2019-09-09 05:53:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:38,604 INFO L93 Difference]: Finished difference Result 331 states and 497 transitions. [2019-09-09 05:53:38,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:38,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:53:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:38,607 INFO L225 Difference]: With dead ends: 331 [2019-09-09 05:53:38,607 INFO L226 Difference]: Without dead ends: 331 [2019-09-09 05:53:38,608 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:53:38,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-09 05:53:38,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 271. [2019-09-09 05:53:38,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-09 05:53:38,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 411 transitions. [2019-09-09 05:53:38,615 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 411 transitions. Word has length 104 [2019-09-09 05:53:38,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:38,615 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 411 transitions. [2019-09-09 05:53:38,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:38,616 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 411 transitions. [2019-09-09 05:53:38,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:53:38,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:38,618 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:38,618 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:38,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:38,619 INFO L82 PathProgramCache]: Analyzing trace with hash 727966597, now seen corresponding path program 1 times [2019-09-09 05:53:38,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:38,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:38,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:38,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:38,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:38,698 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:53:38,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:38,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:38,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:38,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:38,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:38,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:38,701 INFO L87 Difference]: Start difference. First operand 271 states and 411 transitions. Second operand 4 states. [2019-09-09 05:53:39,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:39,010 INFO L93 Difference]: Finished difference Result 293 states and 439 transitions. [2019-09-09 05:53:39,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:39,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:53:39,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:39,012 INFO L225 Difference]: With dead ends: 293 [2019-09-09 05:53:39,012 INFO L226 Difference]: Without dead ends: 293 [2019-09-09 05:53:39,013 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:53:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-09 05:53:39,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 271. [2019-09-09 05:53:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-09 05:53:39,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 410 transitions. [2019-09-09 05:53:39,023 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 410 transitions. Word has length 104 [2019-09-09 05:53:39,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:39,023 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 410 transitions. [2019-09-09 05:53:39,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:39,023 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 410 transitions. [2019-09-09 05:53:39,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:53:39,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:39,025 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:39,025 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:39,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:39,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1083703780, now seen corresponding path program 1 times [2019-09-09 05:53:39,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:39,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:39,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:39,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:39,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:39,092 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:53:39,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:39,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:39,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:39,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:39,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:39,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:39,094 INFO L87 Difference]: Start difference. First operand 271 states and 410 transitions. Second operand 4 states. [2019-09-09 05:53:39,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:39,507 INFO L93 Difference]: Finished difference Result 331 states and 495 transitions. [2019-09-09 05:53:39,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:39,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-09 05:53:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:39,509 INFO L225 Difference]: With dead ends: 331 [2019-09-09 05:53:39,509 INFO L226 Difference]: Without dead ends: 331 [2019-09-09 05:53:39,510 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:53:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-09 05:53:39,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 271. [2019-09-09 05:53:39,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-09 05:53:39,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 409 transitions. [2019-09-09 05:53:39,515 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 409 transitions. Word has length 105 [2019-09-09 05:53:39,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:39,515 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 409 transitions. [2019-09-09 05:53:39,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:39,516 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 409 transitions. [2019-09-09 05:53:39,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:53:39,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:39,517 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:39,517 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:39,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:39,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1517432866, now seen corresponding path program 1 times [2019-09-09 05:53:39,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:39,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:39,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:39,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:39,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:39,582 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:53:39,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:39,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:39,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:39,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:39,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:39,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:39,585 INFO L87 Difference]: Start difference. First operand 271 states and 409 transitions. Second operand 4 states. [2019-09-09 05:53:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:39,930 INFO L93 Difference]: Finished difference Result 293 states and 437 transitions. [2019-09-09 05:53:39,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:39,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-09 05:53:39,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:39,932 INFO L225 Difference]: With dead ends: 293 [2019-09-09 05:53:39,933 INFO L226 Difference]: Without dead ends: 293 [2019-09-09 05:53:39,933 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:53:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-09 05:53:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 271. [2019-09-09 05:53:39,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-09 05:53:39,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 408 transitions. [2019-09-09 05:53:39,940 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 408 transitions. Word has length 105 [2019-09-09 05:53:39,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:39,940 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 408 transitions. [2019-09-09 05:53:39,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:39,941 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 408 transitions. [2019-09-09 05:53:39,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-09 05:53:39,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:39,942 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:39,943 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:39,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:39,943 INFO L82 PathProgramCache]: Analyzing trace with hash -378413144, now seen corresponding path program 1 times [2019-09-09 05:53:39,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:39,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:39,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:39,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:39,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:40,051 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:53:40,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:40,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:40,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:40,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:40,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:40,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:40,053 INFO L87 Difference]: Start difference. First operand 271 states and 408 transitions. Second operand 4 states. [2019-09-09 05:53:40,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:40,442 INFO L93 Difference]: Finished difference Result 331 states and 493 transitions. [2019-09-09 05:53:40,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:40,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-09 05:53:40,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:40,444 INFO L225 Difference]: With dead ends: 331 [2019-09-09 05:53:40,444 INFO L226 Difference]: Without dead ends: 331 [2019-09-09 05:53:40,445 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:53:40,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-09 05:53:40,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 271. [2019-09-09 05:53:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-09 05:53:40,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 407 transitions. [2019-09-09 05:53:40,452 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 407 transitions. Word has length 106 [2019-09-09 05:53:40,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:40,452 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 407 transitions. [2019-09-09 05:53:40,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:40,452 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 407 transitions. [2019-09-09 05:53:40,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-09 05:53:40,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:40,454 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:40,454 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:40,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:40,455 INFO L82 PathProgramCache]: Analyzing trace with hash 182286634, now seen corresponding path program 1 times [2019-09-09 05:53:40,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:40,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:40,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:40,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:40,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:40,522 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:53:40,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:40,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:40,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:40,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:40,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:40,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:40,527 INFO L87 Difference]: Start difference. First operand 271 states and 407 transitions. Second operand 4 states. [2019-09-09 05:53:40,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:40,839 INFO L93 Difference]: Finished difference Result 293 states and 435 transitions. [2019-09-09 05:53:40,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:40,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-09 05:53:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:40,842 INFO L225 Difference]: With dead ends: 293 [2019-09-09 05:53:40,842 INFO L226 Difference]: Without dead ends: 293 [2019-09-09 05:53:40,843 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:53:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-09 05:53:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 271. [2019-09-09 05:53:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-09 05:53:40,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 406 transitions. [2019-09-09 05:53:40,849 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 406 transitions. Word has length 106 [2019-09-09 05:53:40,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:40,849 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 406 transitions. [2019-09-09 05:53:40,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 406 transitions. [2019-09-09 05:53:40,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-09 05:53:40,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:40,851 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:40,851 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:40,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:40,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1501805673, now seen corresponding path program 1 times [2019-09-09 05:53:40,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:40,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:40,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:40,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:40,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:40,909 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:53:40,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:40,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:40,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:40,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:40,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:40,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:40,910 INFO L87 Difference]: Start difference. First operand 271 states and 406 transitions. Second operand 4 states. [2019-09-09 05:53:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:41,264 INFO L93 Difference]: Finished difference Result 321 states and 479 transitions. [2019-09-09 05:53:41,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:41,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-09 05:53:41,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:41,267 INFO L225 Difference]: With dead ends: 321 [2019-09-09 05:53:41,267 INFO L226 Difference]: Without dead ends: 321 [2019-09-09 05:53:41,267 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:53:41,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-09 05:53:41,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 271. [2019-09-09 05:53:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-09 05:53:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 405 transitions. [2019-09-09 05:53:41,274 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 405 transitions. Word has length 107 [2019-09-09 05:53:41,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:41,274 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 405 transitions. [2019-09-09 05:53:41,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 405 transitions. [2019-09-09 05:53:41,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-09 05:53:41,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:41,276 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:41,276 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:41,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:41,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1703629607, now seen corresponding path program 1 times [2019-09-09 05:53:41,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:41,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:41,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:41,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:41,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:41,343 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:53:41,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:41,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:41,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:41,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:41,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:41,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:41,345 INFO L87 Difference]: Start difference. First operand 271 states and 405 transitions. Second operand 4 states. [2019-09-09 05:53:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:41,623 INFO L93 Difference]: Finished difference Result 283 states and 421 transitions. [2019-09-09 05:53:41,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:41,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-09 05:53:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:41,625 INFO L225 Difference]: With dead ends: 283 [2019-09-09 05:53:41,625 INFO L226 Difference]: Without dead ends: 283 [2019-09-09 05:53:41,626 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:53:41,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-09 05:53:41,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 271. [2019-09-09 05:53:41,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-09 05:53:41,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 404 transitions. [2019-09-09 05:53:41,632 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 404 transitions. Word has length 107 [2019-09-09 05:53:41,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:41,632 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 404 transitions. [2019-09-09 05:53:41,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:41,632 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 404 transitions. [2019-09-09 05:53:41,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-09 05:53:41,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:41,634 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:41,634 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:41,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:41,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1624523651, now seen corresponding path program 1 times [2019-09-09 05:53:41,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:41,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:41,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:41,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:41,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:41,736 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:53:41,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:41,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:41,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:41,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:41,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:41,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:41,738 INFO L87 Difference]: Start difference. First operand 271 states and 404 transitions. Second operand 4 states. [2019-09-09 05:53:42,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:42,140 INFO L93 Difference]: Finished difference Result 321 states and 477 transitions. [2019-09-09 05:53:42,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:42,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-09 05:53:42,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:42,142 INFO L225 Difference]: With dead ends: 321 [2019-09-09 05:53:42,143 INFO L226 Difference]: Without dead ends: 321 [2019-09-09 05:53:42,143 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:53:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-09 05:53:42,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 271. [2019-09-09 05:53:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-09 05:53:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 403 transitions. [2019-09-09 05:53:42,149 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 403 transitions. Word has length 111 [2019-09-09 05:53:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:42,150 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 403 transitions. [2019-09-09 05:53:42,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 403 transitions. [2019-09-09 05:53:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-09 05:53:42,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:42,151 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:42,151 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:42,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:42,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1570130753, now seen corresponding path program 1 times [2019-09-09 05:53:42,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:42,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:42,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:42,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:42,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:42,220 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:53:42,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:42,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:42,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:42,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:42,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:42,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:42,221 INFO L87 Difference]: Start difference. First operand 271 states and 403 transitions. Second operand 4 states. [2019-09-09 05:53:42,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:42,517 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2019-09-09 05:53:42,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:42,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-09 05:53:42,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:42,520 INFO L225 Difference]: With dead ends: 324 [2019-09-09 05:53:42,520 INFO L226 Difference]: Without dead ends: 324 [2019-09-09 05:53:42,520 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:53:42,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-09 05:53:42,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 297. [2019-09-09 05:53:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-09 05:53:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 448 transitions. [2019-09-09 05:53:42,526 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 448 transitions. Word has length 111 [2019-09-09 05:53:42,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:42,527 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 448 transitions. [2019-09-09 05:53:42,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 448 transitions. [2019-09-09 05:53:42,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-09 05:53:42,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:42,528 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, 1, 1] [2019-09-09 05:53:42,529 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:42,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:42,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1144392861, now seen corresponding path program 1 times [2019-09-09 05:53:42,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:42,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:42,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:42,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:42,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:42,601 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:53:42,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:42,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:42,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:42,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:42,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:42,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:42,603 INFO L87 Difference]: Start difference. First operand 297 states and 448 transitions. Second operand 4 states. [2019-09-09 05:53:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:42,979 INFO L93 Difference]: Finished difference Result 347 states and 521 transitions. [2019-09-09 05:53:42,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:42,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-09 05:53:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:42,982 INFO L225 Difference]: With dead ends: 347 [2019-09-09 05:53:42,982 INFO L226 Difference]: Without dead ends: 347 [2019-09-09 05:53:42,982 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:53:42,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-09 05:53:42,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 297. [2019-09-09 05:53:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-09 05:53:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 447 transitions. [2019-09-09 05:53:42,988 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 447 transitions. Word has length 114 [2019-09-09 05:53:42,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:42,988 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 447 transitions. [2019-09-09 05:53:42,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:42,988 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 447 transitions. [2019-09-09 05:53:42,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-09 05:53:42,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:42,990 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, 1, 1] [2019-09-09 05:53:42,990 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:42,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:42,990 INFO L82 PathProgramCache]: Analyzing trace with hash -2115681404, now seen corresponding path program 1 times [2019-09-09 05:53:42,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:42,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:42,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:42,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:42,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:43,060 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:53:43,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:43,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:43,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:43,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:43,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:43,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:43,062 INFO L87 Difference]: Start difference. First operand 297 states and 447 transitions. Second operand 4 states. [2019-09-09 05:53:43,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:43,597 INFO L93 Difference]: Finished difference Result 339 states and 507 transitions. [2019-09-09 05:53:43,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:43,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-09 05:53:43,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:43,600 INFO L225 Difference]: With dead ends: 339 [2019-09-09 05:53:43,600 INFO L226 Difference]: Without dead ends: 339 [2019-09-09 05:53:43,600 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:53:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-09 05:53:43,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 297. [2019-09-09 05:53:43,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-09 05:53:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 446 transitions. [2019-09-09 05:53:43,606 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 446 transitions. Word has length 115 [2019-09-09 05:53:43,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:43,607 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 446 transitions. [2019-09-09 05:53:43,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 446 transitions. [2019-09-09 05:53:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-09 05:53:43,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:43,608 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, 1, 1] [2019-09-09 05:53:43,608 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:43,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:43,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1421422653, now seen corresponding path program 1 times [2019-09-09 05:53:43,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:43,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:43,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:43,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:43,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:43,687 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:53:43,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:43,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:43,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:43,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:43,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:43,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:43,689 INFO L87 Difference]: Start difference. First operand 297 states and 446 transitions. Second operand 4 states. [2019-09-09 05:53:44,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:44,058 INFO L93 Difference]: Finished difference Result 339 states and 506 transitions. [2019-09-09 05:53:44,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:44,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-09 05:53:44,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:44,060 INFO L225 Difference]: With dead ends: 339 [2019-09-09 05:53:44,060 INFO L226 Difference]: Without dead ends: 339 [2019-09-09 05:53:44,060 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:53:44,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-09 05:53:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 297. [2019-09-09 05:53:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-09 05:53:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 445 transitions. [2019-09-09 05:53:44,067 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 445 transitions. Word has length 116 [2019-09-09 05:53:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:44,067 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 445 transitions. [2019-09-09 05:53:44,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:44,067 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 445 transitions. [2019-09-09 05:53:44,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-09 05:53:44,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:44,069 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, 1, 1] [2019-09-09 05:53:44,069 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:44,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:44,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2095280754, now seen corresponding path program 1 times [2019-09-09 05:53:44,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:44,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:44,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:44,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:44,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:44,146 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:53:44,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:44,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:44,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:44,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:44,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:44,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:44,148 INFO L87 Difference]: Start difference. First operand 297 states and 445 transitions. Second operand 4 states. [2019-09-09 05:53:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:44,488 INFO L93 Difference]: Finished difference Result 339 states and 505 transitions. [2019-09-09 05:53:44,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:44,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-09 05:53:44,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:44,493 INFO L225 Difference]: With dead ends: 339 [2019-09-09 05:53:44,493 INFO L226 Difference]: Without dead ends: 339 [2019-09-09 05:53:44,494 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:53:44,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-09 05:53:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 297. [2019-09-09 05:53:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-09 05:53:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 444 transitions. [2019-09-09 05:53:44,500 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 444 transitions. Word has length 117 [2019-09-09 05:53:44,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:44,500 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 444 transitions. [2019-09-09 05:53:44,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:44,500 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 444 transitions. [2019-09-09 05:53:44,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-09 05:53:44,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:44,502 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, 1, 1] [2019-09-09 05:53:44,502 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:44,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:44,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1598827452, now seen corresponding path program 1 times [2019-09-09 05:53:44,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:44,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:44,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:44,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:44,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:44,580 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:53:44,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:44,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:44,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:44,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:44,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:44,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:44,582 INFO L87 Difference]: Start difference. First operand 297 states and 444 transitions. Second operand 4 states. [2019-09-09 05:53:44,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:44,935 INFO L93 Difference]: Finished difference Result 337 states and 502 transitions. [2019-09-09 05:53:44,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:44,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-09 05:53:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:44,938 INFO L225 Difference]: With dead ends: 337 [2019-09-09 05:53:44,938 INFO L226 Difference]: Without dead ends: 337 [2019-09-09 05:53:44,938 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:53:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-09 05:53:44,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 297. [2019-09-09 05:53:44,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-09 05:53:44,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 443 transitions. [2019-09-09 05:53:44,944 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 443 transitions. Word has length 117 [2019-09-09 05:53:44,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:44,944 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 443 transitions. [2019-09-09 05:53:44,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 443 transitions. [2019-09-09 05:53:44,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-09 05:53:44,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:44,946 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, 1, 1] [2019-09-09 05:53:44,947 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:44,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:44,947 INFO L82 PathProgramCache]: Analyzing trace with hash 2094381677, now seen corresponding path program 1 times [2019-09-09 05:53:44,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:44,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:44,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:44,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:44,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:45,017 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:53:45,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:45,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:45,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:45,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:45,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:45,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:45,019 INFO L87 Difference]: Start difference. First operand 297 states and 443 transitions. Second operand 4 states. [2019-09-09 05:53:45,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:45,348 INFO L93 Difference]: Finished difference Result 335 states and 498 transitions. [2019-09-09 05:53:45,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:45,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-09-09 05:53:45,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:45,350 INFO L225 Difference]: With dead ends: 335 [2019-09-09 05:53:45,350 INFO L226 Difference]: Without dead ends: 335 [2019-09-09 05:53:45,351 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:53:45,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-09 05:53:45,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 297. [2019-09-09 05:53:45,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-09 05:53:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 442 transitions. [2019-09-09 05:53:45,357 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 442 transitions. Word has length 118 [2019-09-09 05:53:45,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:45,357 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 442 transitions. [2019-09-09 05:53:45,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:45,357 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 442 transitions. [2019-09-09 05:53:45,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-09 05:53:45,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:45,359 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, 1, 1] [2019-09-09 05:53:45,359 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:45,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:45,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1839467173, now seen corresponding path program 1 times [2019-09-09 05:53:45,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:45,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:45,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:45,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:45,434 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:53:45,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:45,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:45,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:45,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:45,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:45,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:45,436 INFO L87 Difference]: Start difference. First operand 297 states and 442 transitions. Second operand 4 states. [2019-09-09 05:53:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:45,836 INFO L93 Difference]: Finished difference Result 332 states and 493 transitions. [2019-09-09 05:53:45,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:45,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-09-09 05:53:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:45,839 INFO L225 Difference]: With dead ends: 332 [2019-09-09 05:53:45,840 INFO L226 Difference]: Without dead ends: 332 [2019-09-09 05:53:45,840 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:53:45,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-09 05:53:45,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 297. [2019-09-09 05:53:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-09 05:53:45,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 441 transitions. [2019-09-09 05:53:45,848 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 441 transitions. Word has length 118 [2019-09-09 05:53:45,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:45,848 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 441 transitions. [2019-09-09 05:53:45,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:45,849 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 441 transitions. [2019-09-09 05:53:45,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-09 05:53:45,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:45,851 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, 1, 1] [2019-09-09 05:53:45,851 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:45,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:45,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1659588588, now seen corresponding path program 1 times [2019-09-09 05:53:45,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:45,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:45,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:45,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:45,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:45,958 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:53:45,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:45,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:45,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:45,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:45,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:45,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:45,960 INFO L87 Difference]: Start difference. First operand 297 states and 441 transitions. Second operand 4 states. [2019-09-09 05:53:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:46,282 INFO L93 Difference]: Finished difference Result 332 states and 492 transitions. [2019-09-09 05:53:46,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:46,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-09 05:53:46,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:46,285 INFO L225 Difference]: With dead ends: 332 [2019-09-09 05:53:46,285 INFO L226 Difference]: Without dead ends: 332 [2019-09-09 05:53:46,286 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:53:46,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-09 05:53:46,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 297. [2019-09-09 05:53:46,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-09 05:53:46,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 440 transitions. [2019-09-09 05:53:46,291 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 440 transitions. Word has length 121 [2019-09-09 05:53:46,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:46,291 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 440 transitions. [2019-09-09 05:53:46,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:46,291 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 440 transitions. [2019-09-09 05:53:46,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-09 05:53:46,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:46,293 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, 1, 1] [2019-09-09 05:53:46,293 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:46,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:46,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1761494000, now seen corresponding path program 1 times [2019-09-09 05:53:46,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:46,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:46,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:46,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:46,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:46,363 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:53:46,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:46,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:46,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:46,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:46,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:46,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:46,365 INFO L87 Difference]: Start difference. First operand 297 states and 440 transitions. Second operand 4 states. [2019-09-09 05:53:46,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:46,685 INFO L93 Difference]: Finished difference Result 326 states and 482 transitions. [2019-09-09 05:53:46,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:46,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-09 05:53:46,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:46,687 INFO L225 Difference]: With dead ends: 326 [2019-09-09 05:53:46,688 INFO L226 Difference]: Without dead ends: 326 [2019-09-09 05:53:46,688 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:53:46,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-09 05:53:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 297. [2019-09-09 05:53:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-09 05:53:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 439 transitions. [2019-09-09 05:53:46,693 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 439 transitions. Word has length 122 [2019-09-09 05:53:46,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:46,693 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 439 transitions. [2019-09-09 05:53:46,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 439 transitions. [2019-09-09 05:53:46,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-09 05:53:46,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:46,695 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, 1, 1] [2019-09-09 05:53:46,695 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:46,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:46,695 INFO L82 PathProgramCache]: Analyzing trace with hash -427889517, now seen corresponding path program 1 times [2019-09-09 05:53:46,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:46,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:46,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:46,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:46,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:46,774 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:53:46,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:46,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:46,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:46,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:46,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:46,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:46,776 INFO L87 Difference]: Start difference. First operand 297 states and 439 transitions. Second operand 4 states. [2019-09-09 05:53:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:47,091 INFO L93 Difference]: Finished difference Result 326 states and 481 transitions. [2019-09-09 05:53:47,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:47,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-09 05:53:47,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:47,095 INFO L225 Difference]: With dead ends: 326 [2019-09-09 05:53:47,095 INFO L226 Difference]: Without dead ends: 326 [2019-09-09 05:53:47,095 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:53:47,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-09 05:53:47,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 297. [2019-09-09 05:53:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-09 05:53:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 438 transitions. [2019-09-09 05:53:47,099 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 438 transitions. Word has length 122 [2019-09-09 05:53:47,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:47,100 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 438 transitions. [2019-09-09 05:53:47,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:47,100 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 438 transitions. [2019-09-09 05:53:47,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-09 05:53:47,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:47,101 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, 1, 1] [2019-09-09 05:53:47,101 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:47,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:47,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1988908143, now seen corresponding path program 1 times [2019-09-09 05:53:47,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:47,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:47,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:47,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:47,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:47,183 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:53:47,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:47,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:47,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:47,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:47,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:47,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:47,185 INFO L87 Difference]: Start difference. First operand 297 states and 438 transitions. Second operand 4 states. [2019-09-09 05:53:47,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:47,519 INFO L93 Difference]: Finished difference Result 323 states and 476 transitions. [2019-09-09 05:53:47,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:47,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-09 05:53:47,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:47,521 INFO L225 Difference]: With dead ends: 323 [2019-09-09 05:53:47,522 INFO L226 Difference]: Without dead ends: 323 [2019-09-09 05:53:47,522 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:53:47,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-09 05:53:47,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 297. [2019-09-09 05:53:47,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-09 05:53:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 437 transitions. [2019-09-09 05:53:47,527 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 437 transitions. Word has length 123 [2019-09-09 05:53:47,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:47,528 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 437 transitions. [2019-09-09 05:53:47,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:47,528 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 437 transitions. [2019-09-09 05:53:47,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-09 05:53:47,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:47,529 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, 1, 1] [2019-09-09 05:53:47,529 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:47,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:47,530 INFO L82 PathProgramCache]: Analyzing trace with hash -547194789, now seen corresponding path program 1 times [2019-09-09 05:53:47,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:47,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:47,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:47,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:47,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:47,601 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:53:47,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:47,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:47,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:47,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:47,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:47,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:47,603 INFO L87 Difference]: Start difference. First operand 297 states and 437 transitions. Second operand 4 states. [2019-09-09 05:53:47,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:47,911 INFO L93 Difference]: Finished difference Result 323 states and 475 transitions. [2019-09-09 05:53:47,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:47,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-09 05:53:47,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:47,914 INFO L225 Difference]: With dead ends: 323 [2019-09-09 05:53:47,914 INFO L226 Difference]: Without dead ends: 323 [2019-09-09 05:53:47,914 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:53:47,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-09 05:53:47,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 297. [2019-09-09 05:53:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-09 05:53:47,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 436 transitions. [2019-09-09 05:53:47,919 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 436 transitions. Word has length 124 [2019-09-09 05:53:47,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:47,920 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 436 transitions. [2019-09-09 05:53:47,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:47,920 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 436 transitions. [2019-09-09 05:53:47,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-09 05:53:47,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:47,921 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, 1, 1] [2019-09-09 05:53:47,921 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:47,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:47,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1345216894, now seen corresponding path program 1 times [2019-09-09 05:53:47,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:47,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:47,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:47,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:47,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:47,994 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:53:47,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:47,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:47,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:47,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:47,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:47,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:47,995 INFO L87 Difference]: Start difference. First operand 297 states and 436 transitions. Second operand 4 states. [2019-09-09 05:53:48,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:48,363 INFO L93 Difference]: Finished difference Result 369 states and 547 transitions. [2019-09-09 05:53:48,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:48,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-09 05:53:48,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:48,366 INFO L225 Difference]: With dead ends: 369 [2019-09-09 05:53:48,366 INFO L226 Difference]: Without dead ends: 369 [2019-09-09 05:53:48,367 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:53:48,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-09 05:53:48,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 329. [2019-09-09 05:53:48,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-09 05:53:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 493 transitions. [2019-09-09 05:53:48,372 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 493 transitions. Word has length 124 [2019-09-09 05:53:48,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:48,373 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 493 transitions. [2019-09-09 05:53:48,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:48,373 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 493 transitions. [2019-09-09 05:53:48,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-09 05:53:48,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:48,374 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, 1, 1] [2019-09-09 05:53:48,375 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:48,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:48,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1970746519, now seen corresponding path program 1 times [2019-09-09 05:53:48,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:48,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:48,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:48,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:48,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:48,446 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:53:48,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:48,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:48,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:48,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:48,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:48,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:48,448 INFO L87 Difference]: Start difference. First operand 329 states and 493 transitions. Second operand 4 states. [2019-09-09 05:53:48,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:48,756 INFO L93 Difference]: Finished difference Result 352 states and 527 transitions. [2019-09-09 05:53:48,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:48,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-09 05:53:48,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:48,760 INFO L225 Difference]: With dead ends: 352 [2019-09-09 05:53:48,760 INFO L226 Difference]: Without dead ends: 352 [2019-09-09 05:53:48,760 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:53:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-09 05:53:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 329. [2019-09-09 05:53:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-09 05:53:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 492 transitions. [2019-09-09 05:53:48,765 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 492 transitions. Word has length 125 [2019-09-09 05:53:48,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:48,766 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 492 transitions. [2019-09-09 05:53:48,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:48,766 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 492 transitions. [2019-09-09 05:53:48,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-09 05:53:48,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:48,767 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, 1] [2019-09-09 05:53:48,767 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:48,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:48,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2095690814, now seen corresponding path program 1 times [2019-09-09 05:53:48,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:48,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:48,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:48,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:48,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:48,846 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:53:48,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:48,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:48,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:48,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:48,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:48,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:48,848 INFO L87 Difference]: Start difference. First operand 329 states and 492 transitions. Second operand 4 states. [2019-09-09 05:53:49,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:49,304 INFO L93 Difference]: Finished difference Result 441 states and 667 transitions. [2019-09-09 05:53:49,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:49,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-09 05:53:49,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:49,310 INFO L225 Difference]: With dead ends: 441 [2019-09-09 05:53:49,310 INFO L226 Difference]: Without dead ends: 441 [2019-09-09 05:53:49,310 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:53:49,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-09-09 05:53:49,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 368. [2019-09-09 05:53:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-09 05:53:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 563 transitions. [2019-09-09 05:53:49,316 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 563 transitions. Word has length 125 [2019-09-09 05:53:49,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:49,316 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 563 transitions. [2019-09-09 05:53:49,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 563 transitions. [2019-09-09 05:53:49,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-09 05:53:49,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:49,318 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, 1, 1] [2019-09-09 05:53:49,318 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:49,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:49,319 INFO L82 PathProgramCache]: Analyzing trace with hash 447486501, now seen corresponding path program 1 times [2019-09-09 05:53:49,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:49,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:49,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:49,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:49,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:49,418 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:53:49,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:49,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:49,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:49,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:49,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:49,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:49,420 INFO L87 Difference]: Start difference. First operand 368 states and 563 transitions. Second operand 4 states. [2019-09-09 05:53:49,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:49,716 INFO L93 Difference]: Finished difference Result 395 states and 597 transitions. [2019-09-09 05:53:49,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:49,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-09 05:53:49,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:49,718 INFO L225 Difference]: With dead ends: 395 [2019-09-09 05:53:49,718 INFO L226 Difference]: Without dead ends: 395 [2019-09-09 05:53:49,719 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:53:49,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-09-09 05:53:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 368. [2019-09-09 05:53:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-09 05:53:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 562 transitions. [2019-09-09 05:53:49,724 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 562 transitions. Word has length 126 [2019-09-09 05:53:49,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:49,724 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 562 transitions. [2019-09-09 05:53:49,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 562 transitions. [2019-09-09 05:53:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-09 05:53:49,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:49,726 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, 1, 1] [2019-09-09 05:53:49,726 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:49,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:49,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1571261516, now seen corresponding path program 1 times [2019-09-09 05:53:49,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:49,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:49,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:49,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:49,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:49,797 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:53:49,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:49,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:49,798 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:49,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:49,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:49,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:49,799 INFO L87 Difference]: Start difference. First operand 368 states and 562 transitions. Second operand 4 states. [2019-09-09 05:53:50,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:50,221 INFO L93 Difference]: Finished difference Result 432 states and 652 transitions. [2019-09-09 05:53:50,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:50,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-09 05:53:50,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:50,225 INFO L225 Difference]: With dead ends: 432 [2019-09-09 05:53:50,225 INFO L226 Difference]: Without dead ends: 432 [2019-09-09 05:53:50,226 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:53:50,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-09 05:53:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 367. [2019-09-09 05:53:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-09 05:53:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 561 transitions. [2019-09-09 05:53:50,230 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 561 transitions. Word has length 126 [2019-09-09 05:53:50,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:50,230 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 561 transitions. [2019-09-09 05:53:50,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 561 transitions. [2019-09-09 05:53:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-09 05:53:50,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:50,232 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, 1, 1] [2019-09-09 05:53:50,232 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:50,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:50,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1412484482, now seen corresponding path program 1 times [2019-09-09 05:53:50,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:50,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:50,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:50,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:50,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:50,308 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:53:50,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:50,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:50,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:50,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:50,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:50,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:50,310 INFO L87 Difference]: Start difference. First operand 367 states and 561 transitions. Second operand 4 states. [2019-09-09 05:53:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:50,643 INFO L93 Difference]: Finished difference Result 394 states and 595 transitions. [2019-09-09 05:53:50,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:50,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-09 05:53:50,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:50,647 INFO L225 Difference]: With dead ends: 394 [2019-09-09 05:53:50,647 INFO L226 Difference]: Without dead ends: 394 [2019-09-09 05:53:50,647 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:53:50,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-09 05:53:50,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 367. [2019-09-09 05:53:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-09 05:53:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 560 transitions. [2019-09-09 05:53:50,651 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 560 transitions. Word has length 127 [2019-09-09 05:53:50,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:50,651 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 560 transitions. [2019-09-09 05:53:50,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 560 transitions. [2019-09-09 05:53:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-09 05:53:50,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:50,653 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, 1, 1] [2019-09-09 05:53:50,653 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:50,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:50,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1223854026, now seen corresponding path program 1 times [2019-09-09 05:53:50,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:50,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:50,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:50,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:50,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:50,724 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:53:50,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:50,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:50,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:50,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:50,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:50,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:50,725 INFO L87 Difference]: Start difference. First operand 367 states and 560 transitions. Second operand 4 states. [2019-09-09 05:53:51,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:51,030 INFO L93 Difference]: Finished difference Result 394 states and 594 transitions. [2019-09-09 05:53:51,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:51,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-09 05:53:51,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:51,032 INFO L225 Difference]: With dead ends: 394 [2019-09-09 05:53:51,032 INFO L226 Difference]: Without dead ends: 394 [2019-09-09 05:53:51,032 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:53:51,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-09 05:53:51,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 367. [2019-09-09 05:53:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-09 05:53:51,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 559 transitions. [2019-09-09 05:53:51,038 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 559 transitions. Word has length 128 [2019-09-09 05:53:51,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:51,038 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 559 transitions. [2019-09-09 05:53:51,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:51,038 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 559 transitions. [2019-09-09 05:53:51,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-09 05:53:51,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:51,039 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, 1, 1] [2019-09-09 05:53:51,040 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:51,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:51,040 INFO L82 PathProgramCache]: Analyzing trace with hash -367519609, now seen corresponding path program 1 times [2019-09-09 05:53:51,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:51,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:51,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:51,107 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:53:51,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:51,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:51,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:51,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:51,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:51,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:51,109 INFO L87 Difference]: Start difference. First operand 367 states and 559 transitions. Second operand 4 states. [2019-09-09 05:53:51,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:51,385 INFO L93 Difference]: Finished difference Result 384 states and 581 transitions. [2019-09-09 05:53:51,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:51,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-09 05:53:51,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:51,389 INFO L225 Difference]: With dead ends: 384 [2019-09-09 05:53:51,389 INFO L226 Difference]: Without dead ends: 384 [2019-09-09 05:53:51,389 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:53:51,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-09 05:53:51,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 367. [2019-09-09 05:53:51,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-09 05:53:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 558 transitions. [2019-09-09 05:53:51,394 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 558 transitions. Word has length 129 [2019-09-09 05:53:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:51,394 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 558 transitions. [2019-09-09 05:53:51,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 558 transitions. [2019-09-09 05:53:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-09 05:53:51,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:51,396 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] [2019-09-09 05:53:51,396 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:51,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:51,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2095643265, now seen corresponding path program 1 times [2019-09-09 05:53:51,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:51,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:51,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:51,492 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:53:51,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:51,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:51,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:51,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:51,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:51,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:51,494 INFO L87 Difference]: Start difference. First operand 367 states and 558 transitions. Second operand 3 states. [2019-09-09 05:53:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:51,590 INFO L93 Difference]: Finished difference Result 705 states and 1065 transitions. [2019-09-09 05:53:51,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:51,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-09-09 05:53:51,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:51,595 INFO L225 Difference]: With dead ends: 705 [2019-09-09 05:53:51,595 INFO L226 Difference]: Without dead ends: 705 [2019-09-09 05:53:51,596 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:53:51,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-09-09 05:53:51,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 703. [2019-09-09 05:53:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-09-09 05:53:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1064 transitions. [2019-09-09 05:53:51,603 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1064 transitions. Word has length 130 [2019-09-09 05:53:51,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:51,603 INFO L475 AbstractCegarLoop]: Abstraction has 703 states and 1064 transitions. [2019-09-09 05:53:51,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1064 transitions. [2019-09-09 05:53:51,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-09 05:53:51,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:51,604 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, 1, 1] [2019-09-09 05:53:51,604 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:51,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:51,605 INFO L82 PathProgramCache]: Analyzing trace with hash -17161460, now seen corresponding path program 1 times [2019-09-09 05:53:51,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:51,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:51,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:51,683 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:53:51,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:51,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:51,684 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:51,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:51,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:51,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:51,685 INFO L87 Difference]: Start difference. First operand 703 states and 1064 transitions. Second operand 4 states. [2019-09-09 05:53:52,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:52,135 INFO L93 Difference]: Finished difference Result 923 states and 1398 transitions. [2019-09-09 05:53:52,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:52,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-09 05:53:52,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:52,141 INFO L225 Difference]: With dead ends: 923 [2019-09-09 05:53:52,141 INFO L226 Difference]: Without dead ends: 923 [2019-09-09 05:53:52,141 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:53:52,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-09-09 05:53:52,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 781. [2019-09-09 05:53:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-09-09 05:53:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1206 transitions. [2019-09-09 05:53:52,149 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1206 transitions. Word has length 133 [2019-09-09 05:53:52,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:52,150 INFO L475 AbstractCegarLoop]: Abstraction has 781 states and 1206 transitions. [2019-09-09 05:53:52,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:52,150 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1206 transitions. [2019-09-09 05:53:52,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-09 05:53:52,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:52,151 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, 1, 1, 1, 1] [2019-09-09 05:53:52,151 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:52,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:52,152 INFO L82 PathProgramCache]: Analyzing trace with hash 497350462, now seen corresponding path program 1 times [2019-09-09 05:53:52,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:52,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:52,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:52,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:52,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:52,228 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:53:52,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:52,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:52,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:52,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:52,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:52,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:52,230 INFO L87 Difference]: Start difference. First operand 781 states and 1206 transitions. Second operand 4 states. [2019-09-09 05:53:52,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:52,663 INFO L93 Difference]: Finished difference Result 909 states and 1378 transitions. [2019-09-09 05:53:52,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:52,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-09-09 05:53:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:52,668 INFO L225 Difference]: With dead ends: 909 [2019-09-09 05:53:52,668 INFO L226 Difference]: Without dead ends: 909 [2019-09-09 05:53:52,669 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:53:52,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-09-09 05:53:52,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 703. [2019-09-09 05:53:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-09-09 05:53:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1064 transitions. [2019-09-09 05:53:52,683 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1064 transitions. Word has length 134 [2019-09-09 05:53:52,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:52,684 INFO L475 AbstractCegarLoop]: Abstraction has 703 states and 1064 transitions. [2019-09-09 05:53:52,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:52,684 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1064 transitions. [2019-09-09 05:53:52,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-09 05:53:52,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:52,685 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, 1, 1, 1, 1] [2019-09-09 05:53:52,685 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:52,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:52,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1370532881, now seen corresponding path program 1 times [2019-09-09 05:53:52,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:52,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:52,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:52,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:52,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:52,786 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:53:52,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:52,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:52,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:52,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:52,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:52,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:52,788 INFO L87 Difference]: Start difference. First operand 703 states and 1064 transitions. Second operand 4 states. [2019-09-09 05:53:53,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:53,050 INFO L93 Difference]: Finished difference Result 735 states and 1106 transitions. [2019-09-09 05:53:53,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:53,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-09 05:53:53,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:53,054 INFO L225 Difference]: With dead ends: 735 [2019-09-09 05:53:53,055 INFO L226 Difference]: Without dead ends: 735 [2019-09-09 05:53:53,055 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:53:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-09 05:53:53,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 709. [2019-09-09 05:53:53,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-09-09 05:53:53,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1070 transitions. [2019-09-09 05:53:53,062 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1070 transitions. Word has length 135 [2019-09-09 05:53:53,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:53,063 INFO L475 AbstractCegarLoop]: Abstraction has 709 states and 1070 transitions. [2019-09-09 05:53:53,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:53,063 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1070 transitions. [2019-09-09 05:53:53,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-09 05:53:53,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:53,064 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, 1, 1] [2019-09-09 05:53:53,064 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:53,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:53,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1007271108, now seen corresponding path program 1 times [2019-09-09 05:53:53,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:53,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:53,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:53,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:53,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:53,124 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:53:53,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:53,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:53,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:53,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:53,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:53,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:53,125 INFO L87 Difference]: Start difference. First operand 709 states and 1070 transitions. Second operand 4 states. [2019-09-09 05:53:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:53,390 INFO L93 Difference]: Finished difference Result 743 states and 1114 transitions. [2019-09-09 05:53:53,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:53,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-09 05:53:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:53,395 INFO L225 Difference]: With dead ends: 743 [2019-09-09 05:53:53,395 INFO L226 Difference]: Without dead ends: 743 [2019-09-09 05:53:53,395 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:53:53,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-09-09 05:53:53,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 709. [2019-09-09 05:53:53,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-09-09 05:53:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1068 transitions. [2019-09-09 05:53:53,403 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1068 transitions. Word has length 139 [2019-09-09 05:53:53,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:53,403 INFO L475 AbstractCegarLoop]: Abstraction has 709 states and 1068 transitions. [2019-09-09 05:53:53,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:53,403 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1068 transitions. [2019-09-09 05:53:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-09 05:53:53,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:53,404 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:53,405 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:53,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:53,405 INFO L82 PathProgramCache]: Analyzing trace with hash 230349868, now seen corresponding path program 1 times [2019-09-09 05:53:53,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:53,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:53,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:53,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:53,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:53,493 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:53:53,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:53,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:53,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:53,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:53,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:53,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:53,494 INFO L87 Difference]: Start difference. First operand 709 states and 1068 transitions. Second operand 4 states. [2019-09-09 05:53:53,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:53,870 INFO L93 Difference]: Finished difference Result 835 states and 1262 transitions. [2019-09-09 05:53:53,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:53,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-09 05:53:53,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:53,875 INFO L225 Difference]: With dead ends: 835 [2019-09-09 05:53:53,875 INFO L226 Difference]: Without dead ends: 835 [2019-09-09 05:53:53,875 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:53:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-09-09 05:53:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 765. [2019-09-09 05:53:53,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-09-09 05:53:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1166 transitions. [2019-09-09 05:53:53,884 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1166 transitions. Word has length 139 [2019-09-09 05:53:53,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:53,885 INFO L475 AbstractCegarLoop]: Abstraction has 765 states and 1166 transitions. [2019-09-09 05:53:53,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:53,885 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1166 transitions. [2019-09-09 05:53:53,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-09 05:53:53,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:53,898 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, 1, 1] [2019-09-09 05:53:53,898 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:53,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:53,898 INFO L82 PathProgramCache]: Analyzing trace with hash 977532808, now seen corresponding path program 1 times [2019-09-09 05:53:53,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:53,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:53,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:53,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:53,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:53,958 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:53:53,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:53,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:53,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:53,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:53,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:53,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:53,963 INFO L87 Difference]: Start difference. First operand 765 states and 1166 transitions. Second operand 4 states. [2019-09-09 05:53:54,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:54,351 INFO L93 Difference]: Finished difference Result 971 states and 1478 transitions. [2019-09-09 05:53:54,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:54,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-09 05:53:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:54,356 INFO L225 Difference]: With dead ends: 971 [2019-09-09 05:53:54,356 INFO L226 Difference]: Without dead ends: 971 [2019-09-09 05:53:54,357 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:53:54,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-09-09 05:53:54,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 789. [2019-09-09 05:53:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-09-09 05:53:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1200 transitions. [2019-09-09 05:53:54,366 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1200 transitions. Word has length 140 [2019-09-09 05:53:54,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:54,366 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1200 transitions. [2019-09-09 05:53:54,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:54,366 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1200 transitions. [2019-09-09 05:53:54,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-09 05:53:54,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:54,368 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, 1, 1] [2019-09-09 05:53:54,368 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:54,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:54,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1860192441, now seen corresponding path program 1 times [2019-09-09 05:53:54,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:54,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:54,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:54,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:54,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:54,429 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:53:54,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:54,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:54,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:54,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:54,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:54,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:54,430 INFO L87 Difference]: Start difference. First operand 789 states and 1200 transitions. Second operand 4 states. [2019-09-09 05:53:54,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:54,687 INFO L93 Difference]: Finished difference Result 819 states and 1240 transitions. [2019-09-09 05:53:54,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:54,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-09 05:53:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:54,692 INFO L225 Difference]: With dead ends: 819 [2019-09-09 05:53:54,692 INFO L226 Difference]: Without dead ends: 819 [2019-09-09 05:53:54,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:53:54,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-09-09 05:53:54,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 789. [2019-09-09 05:53:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-09-09 05:53:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1198 transitions. [2019-09-09 05:53:54,701 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1198 transitions. Word has length 140 [2019-09-09 05:53:54,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:54,701 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1198 transitions. [2019-09-09 05:53:54,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:54,702 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1198 transitions. [2019-09-09 05:53:54,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-09 05:53:54,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:54,704 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, 1, 1] [2019-09-09 05:53:54,704 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:54,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:54,704 INFO L82 PathProgramCache]: Analyzing trace with hash 664050815, now seen corresponding path program 1 times [2019-09-09 05:53:54,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:54,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:54,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:54,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:54,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:54,773 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:53:54,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:54,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:54,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:54,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:54,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:54,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:54,775 INFO L87 Difference]: Start difference. First operand 789 states and 1198 transitions. Second operand 4 states. [2019-09-09 05:53:55,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:55,181 INFO L93 Difference]: Finished difference Result 971 states and 1474 transitions. [2019-09-09 05:53:55,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:55,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-09 05:53:55,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:55,188 INFO L225 Difference]: With dead ends: 971 [2019-09-09 05:53:55,188 INFO L226 Difference]: Without dead ends: 971 [2019-09-09 05:53:55,189 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:53:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-09-09 05:53:55,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 791. [2019-09-09 05:53:55,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-09-09 05:53:55,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1200 transitions. [2019-09-09 05:53:55,202 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1200 transitions. Word has length 141 [2019-09-09 05:53:55,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:55,202 INFO L475 AbstractCegarLoop]: Abstraction has 791 states and 1200 transitions. [2019-09-09 05:53:55,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1200 transitions. [2019-09-09 05:53:55,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-09 05:53:55,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:55,205 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, 1, 1] [2019-09-09 05:53:55,205 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:55,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:55,205 INFO L82 PathProgramCache]: Analyzing trace with hash -502753171, now seen corresponding path program 1 times [2019-09-09 05:53:55,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:55,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:55,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:55,281 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:53:55,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:55,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:55,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:55,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:55,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:55,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:55,283 INFO L87 Difference]: Start difference. First operand 791 states and 1200 transitions. Second operand 4 states. [2019-09-09 05:53:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:55,687 INFO L93 Difference]: Finished difference Result 971 states and 1472 transitions. [2019-09-09 05:53:55,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:55,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-09 05:53:55,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:55,692 INFO L225 Difference]: With dead ends: 971 [2019-09-09 05:53:55,692 INFO L226 Difference]: Without dead ends: 971 [2019-09-09 05:53:55,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:53:55,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-09-09 05:53:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 793. [2019-09-09 05:53:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-09-09 05:53:55,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1202 transitions. [2019-09-09 05:53:55,704 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1202 transitions. Word has length 142 [2019-09-09 05:53:55,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:55,704 INFO L475 AbstractCegarLoop]: Abstraction has 793 states and 1202 transitions. [2019-09-09 05:53:55,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:55,705 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1202 transitions. [2019-09-09 05:53:55,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-09 05:53:55,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:55,706 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, 1, 1] [2019-09-09 05:53:55,706 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:55,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:55,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1942232132, now seen corresponding path program 1 times [2019-09-09 05:53:55,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:55,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:55,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:55,774 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:53:55,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:55,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:55,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:55,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:55,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:55,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:55,776 INFO L87 Difference]: Start difference. First operand 793 states and 1202 transitions. Second operand 4 states. [2019-09-09 05:53:56,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:56,160 INFO L93 Difference]: Finished difference Result 951 states and 1446 transitions. [2019-09-09 05:53:56,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:56,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-09 05:53:56,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:56,165 INFO L225 Difference]: With dead ends: 951 [2019-09-09 05:53:56,165 INFO L226 Difference]: Without dead ends: 951 [2019-09-09 05:53:56,166 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:53:56,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-09-09 05:53:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 795. [2019-09-09 05:53:56,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-09-09 05:53:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1204 transitions. [2019-09-09 05:53:56,176 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1204 transitions. Word has length 143 [2019-09-09 05:53:56,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:56,176 INFO L475 AbstractCegarLoop]: Abstraction has 795 states and 1204 transitions. [2019-09-09 05:53:56,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:56,176 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1204 transitions. [2019-09-09 05:53:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-09 05:53:56,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:56,177 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, 1, 1, 1, 1] [2019-09-09 05:53:56,178 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:56,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:56,178 INFO L82 PathProgramCache]: Analyzing trace with hash -2031463686, now seen corresponding path program 1 times [2019-09-09 05:53:56,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:56,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:56,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:56,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:56,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:56,248 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:53:56,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:56,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:56,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:56,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:56,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:56,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:56,250 INFO L87 Difference]: Start difference. First operand 795 states and 1204 transitions. Second operand 4 states. [2019-09-09 05:53:56,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:56,674 INFO L93 Difference]: Finished difference Result 971 states and 1468 transitions. [2019-09-09 05:53:56,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:56,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-09-09 05:53:56,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:56,679 INFO L225 Difference]: With dead ends: 971 [2019-09-09 05:53:56,679 INFO L226 Difference]: Without dead ends: 971 [2019-09-09 05:53:56,679 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:53:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-09-09 05:53:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 795. [2019-09-09 05:53:56,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-09-09 05:53:56,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1202 transitions. [2019-09-09 05:53:56,689 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1202 transitions. Word has length 148 [2019-09-09 05:53:56,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:56,689 INFO L475 AbstractCegarLoop]: Abstraction has 795 states and 1202 transitions. [2019-09-09 05:53:56,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1202 transitions. [2019-09-09 05:53:56,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-09 05:53:56,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:56,691 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, 1, 1, 1, 1] [2019-09-09 05:53:56,691 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:56,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:56,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1874440013, now seen corresponding path program 1 times [2019-09-09 05:53:56,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:56,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:56,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:56,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:56,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:56,763 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:53:56,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:56,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:56,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:56,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:56,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:56,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:56,764 INFO L87 Difference]: Start difference. First operand 795 states and 1202 transitions. Second operand 4 states. [2019-09-09 05:53:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:57,208 INFO L93 Difference]: Finished difference Result 971 states and 1466 transitions. [2019-09-09 05:53:57,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:57,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-09-09 05:53:57,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:57,211 INFO L225 Difference]: With dead ends: 971 [2019-09-09 05:53:57,212 INFO L226 Difference]: Without dead ends: 971 [2019-09-09 05:53:57,212 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:53:57,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-09-09 05:53:57,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 795. [2019-09-09 05:53:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-09-09 05:53:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1200 transitions. [2019-09-09 05:53:57,221 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1200 transitions. Word has length 149 [2019-09-09 05:53:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:57,221 INFO L475 AbstractCegarLoop]: Abstraction has 795 states and 1200 transitions. [2019-09-09 05:53:57,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1200 transitions. [2019-09-09 05:53:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-09 05:53:57,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:57,223 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, 1, 1, 1, 1] [2019-09-09 05:53:57,223 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:57,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:57,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1635393697, now seen corresponding path program 1 times [2019-09-09 05:53:57,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:57,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:57,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:57,305 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:53:57,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:57,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:57,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:57,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:57,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:57,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:57,307 INFO L87 Difference]: Start difference. First operand 795 states and 1200 transitions. Second operand 4 states. [2019-09-09 05:53:57,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:57,772 INFO L93 Difference]: Finished difference Result 971 states and 1464 transitions. [2019-09-09 05:53:57,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:57,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-09 05:53:57,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:57,775 INFO L225 Difference]: With dead ends: 971 [2019-09-09 05:53:57,775 INFO L226 Difference]: Without dead ends: 971 [2019-09-09 05:53:57,775 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:53:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-09-09 05:53:57,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 795. [2019-09-09 05:53:57,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-09-09 05:53:57,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1198 transitions. [2019-09-09 05:53:57,786 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1198 transitions. Word has length 150 [2019-09-09 05:53:57,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:57,786 INFO L475 AbstractCegarLoop]: Abstraction has 795 states and 1198 transitions. [2019-09-09 05:53:57,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:57,786 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1198 transitions. [2019-09-09 05:53:57,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-09 05:53:57,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:57,788 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, 1, 1] [2019-09-09 05:53:57,788 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:57,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:57,788 INFO L82 PathProgramCache]: Analyzing trace with hash 114431784, now seen corresponding path program 1 times [2019-09-09 05:53:57,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:57,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:57,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:57,854 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:53:57,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:57,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:57,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:57,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:57,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:57,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:57,856 INFO L87 Difference]: Start difference. First operand 795 states and 1198 transitions. Second operand 4 states. [2019-09-09 05:53:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:58,238 INFO L93 Difference]: Finished difference Result 951 states and 1438 transitions. [2019-09-09 05:53:58,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:58,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-09 05:53:58,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:58,242 INFO L225 Difference]: With dead ends: 951 [2019-09-09 05:53:58,242 INFO L226 Difference]: Without dead ends: 951 [2019-09-09 05:53:58,243 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:53:58,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-09-09 05:53:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 821. [2019-09-09 05:53:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2019-09-09 05:53:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1248 transitions. [2019-09-09 05:53:58,252 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1248 transitions. Word has length 150 [2019-09-09 05:53:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:58,252 INFO L475 AbstractCegarLoop]: Abstraction has 821 states and 1248 transitions. [2019-09-09 05:53:58,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1248 transitions. [2019-09-09 05:53:58,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-09 05:53:58,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:58,254 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, 1, 1, 1, 1] [2019-09-09 05:53:58,254 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:58,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:58,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1190114194, now seen corresponding path program 1 times [2019-09-09 05:53:58,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:58,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:58,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:58,326 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:53:58,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:58,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:58,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:58,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:58,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:58,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:58,327 INFO L87 Difference]: Start difference. First operand 821 states and 1248 transitions. Second operand 4 states. [2019-09-09 05:53:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:58,756 INFO L93 Difference]: Finished difference Result 951 states and 1436 transitions. [2019-09-09 05:53:58,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:58,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-09 05:53:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:58,759 INFO L225 Difference]: With dead ends: 951 [2019-09-09 05:53:58,759 INFO L226 Difference]: Without dead ends: 951 [2019-09-09 05:53:58,760 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:53:58,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-09-09 05:53:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 821. [2019-09-09 05:53:58,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2019-09-09 05:53:58,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1246 transitions. [2019-09-09 05:53:58,770 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1246 transitions. Word has length 151 [2019-09-09 05:53:58,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:58,770 INFO L475 AbstractCegarLoop]: Abstraction has 821 states and 1246 transitions. [2019-09-09 05:53:58,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1246 transitions. [2019-09-09 05:53:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-09 05:53:58,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:58,772 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, 1, 1] [2019-09-09 05:53:58,772 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:58,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:58,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1746823073, now seen corresponding path program 1 times [2019-09-09 05:53:58,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:58,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:58,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:58,826 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:53:58,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:58,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:58,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:58,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:58,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:58,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:58,827 INFO L87 Difference]: Start difference. First operand 821 states and 1246 transitions. Second operand 4 states. [2019-09-09 05:53:59,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:59,180 INFO L93 Difference]: Finished difference Result 935 states and 1408 transitions. [2019-09-09 05:53:59,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:59,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-09 05:53:59,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:59,182 INFO L225 Difference]: With dead ends: 935 [2019-09-09 05:53:59,182 INFO L226 Difference]: Without dead ends: 935 [2019-09-09 05:53:59,182 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:53:59,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-09-09 05:53:59,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 823. [2019-09-09 05:53:59,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-09 05:53:59,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1248 transitions. [2019-09-09 05:53:59,192 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1248 transitions. Word has length 151 [2019-09-09 05:53:59,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:59,193 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1248 transitions. [2019-09-09 05:53:59,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:59,193 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1248 transitions. [2019-09-09 05:53:59,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-09 05:53:59,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:59,194 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, 1, 1] [2019-09-09 05:53:59,194 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:59,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:59,195 INFO L82 PathProgramCache]: Analyzing trace with hash 967178305, now seen corresponding path program 1 times [2019-09-09 05:53:59,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:59,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:59,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:59,264 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:53:59,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:59,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:59,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:59,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:59,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:59,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:59,265 INFO L87 Difference]: Start difference. First operand 823 states and 1248 transitions. Second operand 4 states. [2019-09-09 05:53:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:59,632 INFO L93 Difference]: Finished difference Result 935 states and 1406 transitions. [2019-09-09 05:53:59,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:59,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-09 05:53:59,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:59,636 INFO L225 Difference]: With dead ends: 935 [2019-09-09 05:53:59,636 INFO L226 Difference]: Without dead ends: 935 [2019-09-09 05:53:59,636 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:53:59,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-09-09 05:53:59,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 823. [2019-09-09 05:53:59,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-09 05:53:59,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1246 transitions. [2019-09-09 05:53:59,647 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1246 transitions. Word has length 153 [2019-09-09 05:53:59,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:59,647 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1246 transitions. [2019-09-09 05:53:59,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:59,647 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1246 transitions. [2019-09-09 05:53:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-09 05:53:59,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:59,649 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, 1, 1] [2019-09-09 05:53:59,650 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:59,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:59,650 INFO L82 PathProgramCache]: Analyzing trace with hash -323304470, now seen corresponding path program 1 times [2019-09-09 05:53:59,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:59,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:59,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:59,761 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:53:59,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:59,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:59,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:59,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:59,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:59,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:59,763 INFO L87 Difference]: Start difference. First operand 823 states and 1246 transitions. Second operand 4 states. [2019-09-09 05:54:00,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:00,144 INFO L93 Difference]: Finished difference Result 929 states and 1396 transitions. [2019-09-09 05:54:00,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:00,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-09 05:54:00,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:00,146 INFO L225 Difference]: With dead ends: 929 [2019-09-09 05:54:00,146 INFO L226 Difference]: Without dead ends: 929 [2019-09-09 05:54:00,147 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:00,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-09-09 05:54:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 829. [2019-09-09 05:54:00,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-09 05:54:00,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1256 transitions. [2019-09-09 05:54:00,157 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1256 transitions. Word has length 154 [2019-09-09 05:54:00,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:00,157 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1256 transitions. [2019-09-09 05:54:00,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1256 transitions. [2019-09-09 05:54:00,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-09 05:54:00,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:00,159 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, 1, 1] [2019-09-09 05:54:00,159 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:00,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:00,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1191897962, now seen corresponding path program 1 times [2019-09-09 05:54:00,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:00,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:00,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:00,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:00,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:00,222 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:54:00,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:00,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:00,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:00,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:00,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:00,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:00,224 INFO L87 Difference]: Start difference. First operand 829 states and 1256 transitions. Second operand 4 states. [2019-09-09 05:54:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:00,553 INFO L93 Difference]: Finished difference Result 925 states and 1390 transitions. [2019-09-09 05:54:00,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:00,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-09 05:54:00,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:00,555 INFO L225 Difference]: With dead ends: 925 [2019-09-09 05:54:00,555 INFO L226 Difference]: Without dead ends: 925 [2019-09-09 05:54:00,555 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:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-09-09 05:54:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 829. [2019-09-09 05:54:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-09 05:54:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1254 transitions. [2019-09-09 05:54:00,566 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1254 transitions. Word has length 154 [2019-09-09 05:54:00,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:00,567 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1254 transitions. [2019-09-09 05:54:00,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1254 transitions. [2019-09-09 05:54:00,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-09 05:54:00,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:00,569 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:00,570 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:00,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:00,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1145293350, now seen corresponding path program 1 times [2019-09-09 05:54:00,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:00,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:00,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:00,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:00,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:00,644 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:54:00,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:00,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:00,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:00,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:00,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:00,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:00,646 INFO L87 Difference]: Start difference. First operand 829 states and 1254 transitions. Second operand 4 states. [2019-09-09 05:54:01,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:01,007 INFO L93 Difference]: Finished difference Result 899 states and 1348 transitions. [2019-09-09 05:54:01,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:01,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-09 05:54:01,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:01,011 INFO L225 Difference]: With dead ends: 899 [2019-09-09 05:54:01,011 INFO L226 Difference]: Without dead ends: 899 [2019-09-09 05:54:01,011 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:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-09-09 05:54:01,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 829. [2019-09-09 05:54:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-09 05:54:01,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1252 transitions. [2019-09-09 05:54:01,021 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1252 transitions. Word has length 154 [2019-09-09 05:54:01,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:01,022 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1252 transitions. [2019-09-09 05:54:01,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1252 transitions. [2019-09-09 05:54:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:54:01,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:01,024 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:01,024 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:01,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:01,025 INFO L82 PathProgramCache]: Analyzing trace with hash -719050643, now seen corresponding path program 1 times [2019-09-09 05:54:01,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:01,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:01,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:01,101 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:54:01,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:01,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:01,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:01,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:01,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:01,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:01,104 INFO L87 Difference]: Start difference. First operand 829 states and 1252 transitions. Second operand 4 states. [2019-09-09 05:54:01,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:01,483 INFO L93 Difference]: Finished difference Result 899 states and 1346 transitions. [2019-09-09 05:54:01,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:01,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-09 05:54:01,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:01,486 INFO L225 Difference]: With dead ends: 899 [2019-09-09 05:54:01,486 INFO L226 Difference]: Without dead ends: 899 [2019-09-09 05:54:01,486 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:01,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-09-09 05:54:01,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 829. [2019-09-09 05:54:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-09 05:54:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1250 transitions. [2019-09-09 05:54:01,495 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1250 transitions. Word has length 155 [2019-09-09 05:54:01,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:01,496 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1250 transitions. [2019-09-09 05:54:01,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:01,496 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1250 transitions. [2019-09-09 05:54:01,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:54:01,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:01,498 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:01,498 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:01,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:01,499 INFO L82 PathProgramCache]: Analyzing trace with hash -429225409, now seen corresponding path program 1 times [2019-09-09 05:54:01,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:01,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:01,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:01,573 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:54:01,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:01,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:01,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:01,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:01,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:01,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:01,575 INFO L87 Difference]: Start difference. First operand 829 states and 1250 transitions. Second operand 4 states. [2019-09-09 05:54:01,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:01,920 INFO L93 Difference]: Finished difference Result 899 states and 1344 transitions. [2019-09-09 05:54:01,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:01,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:54:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:01,923 INFO L225 Difference]: With dead ends: 899 [2019-09-09 05:54:01,923 INFO L226 Difference]: Without dead ends: 899 [2019-09-09 05:54:01,923 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:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-09-09 05:54:01,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 829. [2019-09-09 05:54:01,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-09 05:54:01,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1248 transitions. [2019-09-09 05:54:01,934 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1248 transitions. Word has length 156 [2019-09-09 05:54:01,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:01,934 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1248 transitions. [2019-09-09 05:54:01,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:01,934 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1248 transitions. [2019-09-09 05:54:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-09 05:54:01,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:01,936 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, 1, 1] [2019-09-09 05:54:01,936 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:01,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:01,937 INFO L82 PathProgramCache]: Analyzing trace with hash -666020729, now seen corresponding path program 1 times [2019-09-09 05:54:01,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:01,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:01,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:02,035 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:54:02,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:02,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:02,036 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:02,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:02,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:02,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:02,037 INFO L87 Difference]: Start difference. First operand 829 states and 1248 transitions. Second operand 4 states. [2019-09-09 05:54:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:02,410 INFO L93 Difference]: Finished difference Result 925 states and 1382 transitions. [2019-09-09 05:54:02,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:02,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-09 05:54:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:02,412 INFO L225 Difference]: With dead ends: 925 [2019-09-09 05:54:02,413 INFO L226 Difference]: Without dead ends: 925 [2019-09-09 05:54:02,413 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:02,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-09-09 05:54:02,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 831. [2019-09-09 05:54:02,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-09-09 05:54:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1250 transitions. [2019-09-09 05:54:02,424 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1250 transitions. Word has length 157 [2019-09-09 05:54:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:02,424 INFO L475 AbstractCegarLoop]: Abstraction has 831 states and 1250 transitions. [2019-09-09 05:54:02,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:02,424 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1250 transitions. [2019-09-09 05:54:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-09 05:54:02,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:02,426 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:02,427 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:02,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:02,427 INFO L82 PathProgramCache]: Analyzing trace with hash -73374542, now seen corresponding path program 1 times [2019-09-09 05:54:02,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:02,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:02,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:02,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:02,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:02,491 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:54:02,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:02,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:02,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:02,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:02,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:02,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:02,493 INFO L87 Difference]: Start difference. First operand 831 states and 1250 transitions. Second operand 4 states. [2019-09-09 05:54:02,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:02,821 INFO L93 Difference]: Finished difference Result 881 states and 1320 transitions. [2019-09-09 05:54:02,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:02,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-09 05:54:02,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:02,823 INFO L225 Difference]: With dead ends: 881 [2019-09-09 05:54:02,823 INFO L226 Difference]: Without dead ends: 881 [2019-09-09 05:54:02,824 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:02,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-09-09 05:54:02,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 831. [2019-09-09 05:54:02,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-09-09 05:54:02,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1248 transitions. [2019-09-09 05:54:02,836 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1248 transitions. Word has length 157 [2019-09-09 05:54:02,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:02,836 INFO L475 AbstractCegarLoop]: Abstraction has 831 states and 1248 transitions. [2019-09-09 05:54:02,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:02,836 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1248 transitions. [2019-09-09 05:54:02,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:54:02,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:02,838 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, 1, 1, 1, 1] [2019-09-09 05:54:02,838 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:02,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:02,839 INFO L82 PathProgramCache]: Analyzing trace with hash -715502566, now seen corresponding path program 1 times [2019-09-09 05:54:02,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:02,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:02,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:02,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:02,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:02,931 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:54:02,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:02,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:02,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:02,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:02,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:02,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:02,933 INFO L87 Difference]: Start difference. First operand 831 states and 1248 transitions. Second operand 4 states. [2019-09-09 05:54:03,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:03,317 INFO L93 Difference]: Finished difference Result 951 states and 1416 transitions. [2019-09-09 05:54:03,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:03,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-09 05:54:03,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:03,322 INFO L225 Difference]: With dead ends: 951 [2019-09-09 05:54:03,322 INFO L226 Difference]: Without dead ends: 951 [2019-09-09 05:54:03,322 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:03,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-09-09 05:54:03,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 831. [2019-09-09 05:54:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-09-09 05:54:03,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1246 transitions. [2019-09-09 05:54:03,332 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1246 transitions. Word has length 158 [2019-09-09 05:54:03,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:03,332 INFO L475 AbstractCegarLoop]: Abstraction has 831 states and 1246 transitions. [2019-09-09 05:54:03,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:03,333 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1246 transitions. [2019-09-09 05:54:03,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:54:03,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:03,335 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, 1, 1] [2019-09-09 05:54:03,335 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:03,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:03,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1612918091, now seen corresponding path program 1 times [2019-09-09 05:54:03,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:03,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:03,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:03,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:03,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:03,416 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:54:03,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:03,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:03,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:03,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:03,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:03,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:03,418 INFO L87 Difference]: Start difference. First operand 831 states and 1246 transitions. Second operand 4 states. [2019-09-09 05:54:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:03,746 INFO L93 Difference]: Finished difference Result 913 states and 1360 transitions. [2019-09-09 05:54:03,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:03,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-09 05:54:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:03,750 INFO L225 Difference]: With dead ends: 913 [2019-09-09 05:54:03,750 INFO L226 Difference]: Without dead ends: 913 [2019-09-09 05:54:03,751 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:03,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-09-09 05:54:03,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 833. [2019-09-09 05:54:03,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-09-09 05:54:03,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1248 transitions. [2019-09-09 05:54:03,760 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1248 transitions. Word has length 158 [2019-09-09 05:54:03,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:03,761 INFO L475 AbstractCegarLoop]: Abstraction has 833 states and 1248 transitions. [2019-09-09 05:54:03,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:03,761 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1248 transitions. [2019-09-09 05:54:03,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:54:03,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:03,763 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, 1, 1] [2019-09-09 05:54:03,763 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:03,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:03,764 INFO L82 PathProgramCache]: Analyzing trace with hash 740812182, now seen corresponding path program 1 times [2019-09-09 05:54:03,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:03,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:03,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:03,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:03,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:03,844 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:54:03,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:03,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:03,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:03,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:03,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:03,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:03,845 INFO L87 Difference]: Start difference. First operand 833 states and 1248 transitions. Second operand 4 states. [2019-09-09 05:54:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:04,190 INFO L93 Difference]: Finished difference Result 913 states and 1358 transitions. [2019-09-09 05:54:04,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:04,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-09 05:54:04,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:04,192 INFO L225 Difference]: With dead ends: 913 [2019-09-09 05:54:04,193 INFO L226 Difference]: Without dead ends: 913 [2019-09-09 05:54:04,193 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:04,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-09-09 05:54:04,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 835. [2019-09-09 05:54:04,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-09-09 05:54:04,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1250 transitions. [2019-09-09 05:54:04,204 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1250 transitions. Word has length 158 [2019-09-09 05:54:04,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:04,205 INFO L475 AbstractCegarLoop]: Abstraction has 835 states and 1250 transitions. [2019-09-09 05:54:04,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:04,205 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1250 transitions. [2019-09-09 05:54:04,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-09 05:54:04,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:04,207 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, 1, 1, 1, 1] [2019-09-09 05:54:04,208 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:04,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:04,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1704984147, now seen corresponding path program 1 times [2019-09-09 05:54:04,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:04,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:04,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:04,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:04,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:04,297 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:54:04,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:04,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:04,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:04,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:04,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:04,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:04,299 INFO L87 Difference]: Start difference. First operand 835 states and 1250 transitions. Second operand 4 states. [2019-09-09 05:54:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:04,656 INFO L93 Difference]: Finished difference Result 935 states and 1384 transitions. [2019-09-09 05:54:04,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:04,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-09 05:54:04,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:04,658 INFO L225 Difference]: With dead ends: 935 [2019-09-09 05:54:04,658 INFO L226 Difference]: Without dead ends: 935 [2019-09-09 05:54:04,659 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:04,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-09-09 05:54:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 835. [2019-09-09 05:54:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-09-09 05:54:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1248 transitions. [2019-09-09 05:54:04,672 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1248 transitions. Word has length 159 [2019-09-09 05:54:04,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:04,674 INFO L475 AbstractCegarLoop]: Abstraction has 835 states and 1248 transitions. [2019-09-09 05:54:04,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1248 transitions. [2019-09-09 05:54:04,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-09 05:54:04,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:04,676 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, 1, 1] [2019-09-09 05:54:04,677 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:04,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:04,677 INFO L82 PathProgramCache]: Analyzing trace with hash 709494920, now seen corresponding path program 1 times [2019-09-09 05:54:04,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:04,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:04,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:04,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:04,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:04,747 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:54:04,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:04,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:04,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:04,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:04,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:04,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:04,750 INFO L87 Difference]: Start difference. First operand 835 states and 1248 transitions. Second operand 4 states. [2019-09-09 05:54:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:05,074 INFO L93 Difference]: Finished difference Result 907 states and 1347 transitions. [2019-09-09 05:54:05,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:05,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-09 05:54:05,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:05,076 INFO L225 Difference]: With dead ends: 907 [2019-09-09 05:54:05,076 INFO L226 Difference]: Without dead ends: 907 [2019-09-09 05:54:05,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:05,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2019-09-09 05:54:05,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 837. [2019-09-09 05:54:05,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-09 05:54:05,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1250 transitions. [2019-09-09 05:54:05,086 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1250 transitions. Word has length 159 [2019-09-09 05:54:05,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:05,086 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1250 transitions. [2019-09-09 05:54:05,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:05,087 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1250 transitions. [2019-09-09 05:54:05,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-09 05:54:05,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:05,089 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, 1, 1] [2019-09-09 05:54:05,089 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:05,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:05,089 INFO L82 PathProgramCache]: Analyzing trace with hash -408759266, now seen corresponding path program 1 times [2019-09-09 05:54:05,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:05,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:05,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:05,177 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:54:05,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:05,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:05,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:05,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:05,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:05,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:05,180 INFO L87 Difference]: Start difference. First operand 837 states and 1250 transitions. Second operand 4 states. [2019-09-09 05:54:05,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:05,525 INFO L93 Difference]: Finished difference Result 907 states and 1345 transitions. [2019-09-09 05:54:05,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:05,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-09 05:54:05,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:05,526 INFO L225 Difference]: With dead ends: 907 [2019-09-09 05:54:05,526 INFO L226 Difference]: Without dead ends: 907 [2019-09-09 05:54:05,527 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:05,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2019-09-09 05:54:05,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 839. [2019-09-09 05:54:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-09-09 05:54:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1252 transitions. [2019-09-09 05:54:05,539 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1252 transitions. Word has length 160 [2019-09-09 05:54:05,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:05,540 INFO L475 AbstractCegarLoop]: Abstraction has 839 states and 1252 transitions. [2019-09-09 05:54:05,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:05,540 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1252 transitions. [2019-09-09 05:54:05,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 05:54:05,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:05,542 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, 1, 1, 1, 1] [2019-09-09 05:54:05,542 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:05,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:05,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1775286769, now seen corresponding path program 1 times [2019-09-09 05:54:05,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:05,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:05,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:05,614 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:54:05,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:05,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:05,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:05,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:05,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:05,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:05,615 INFO L87 Difference]: Start difference. First operand 839 states and 1252 transitions. Second operand 4 states. [2019-09-09 05:54:05,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:05,977 INFO L93 Difference]: Finished difference Result 935 states and 1378 transitions. [2019-09-09 05:54:05,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:05,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-09 05:54:05,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:05,979 INFO L225 Difference]: With dead ends: 935 [2019-09-09 05:54:05,980 INFO L226 Difference]: Without dead ends: 935 [2019-09-09 05:54:05,980 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:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-09-09 05:54:05,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 839. [2019-09-09 05:54:05,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-09-09 05:54:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1250 transitions. [2019-09-09 05:54:05,988 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1250 transitions. Word has length 161 [2019-09-09 05:54:05,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:05,988 INFO L475 AbstractCegarLoop]: Abstraction has 839 states and 1250 transitions. [2019-09-09 05:54:05,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:05,988 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1250 transitions. [2019-09-09 05:54:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 05:54:05,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:05,990 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, 1, 1] [2019-09-09 05:54:05,990 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:05,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:05,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1182147088, now seen corresponding path program 1 times [2019-09-09 05:54:05,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:05,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:05,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:06,066 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:54:06,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:06,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:06,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:06,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:06,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:06,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:06,068 INFO L87 Difference]: Start difference. First operand 839 states and 1250 transitions. Second operand 4 states. [2019-09-09 05:54:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:06,518 INFO L93 Difference]: Finished difference Result 901 states and 1334 transitions. [2019-09-09 05:54:06,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:06,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-09 05:54:06,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:06,520 INFO L225 Difference]: With dead ends: 901 [2019-09-09 05:54:06,521 INFO L226 Difference]: Without dead ends: 901 [2019-09-09 05:54:06,521 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:06,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-09-09 05:54:06,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 841. [2019-09-09 05:54:06,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-09-09 05:54:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1252 transitions. [2019-09-09 05:54:06,535 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1252 transitions. Word has length 161 [2019-09-09 05:54:06,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:06,536 INFO L475 AbstractCegarLoop]: Abstraction has 841 states and 1252 transitions. [2019-09-09 05:54:06,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1252 transitions. [2019-09-09 05:54:06,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-09 05:54:06,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:06,540 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, 1, 1, 1, 1] [2019-09-09 05:54:06,540 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:06,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:06,541 INFO L82 PathProgramCache]: Analyzing trace with hash 559624156, now seen corresponding path program 1 times [2019-09-09 05:54:06,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:06,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:06,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:06,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:06,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:06,624 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:54:06,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:06,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:06,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:06,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:06,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:06,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:06,626 INFO L87 Difference]: Start difference. First operand 841 states and 1252 transitions. Second operand 4 states. [2019-09-09 05:54:06,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:06,997 INFO L93 Difference]: Finished difference Result 929 states and 1366 transitions. [2019-09-09 05:54:06,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:06,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-09 05:54:06,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:06,999 INFO L225 Difference]: With dead ends: 929 [2019-09-09 05:54:06,999 INFO L226 Difference]: Without dead ends: 929 [2019-09-09 05:54:07,000 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:07,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-09-09 05:54:07,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 841. [2019-09-09 05:54:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-09-09 05:54:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1250 transitions. [2019-09-09 05:54:07,009 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1250 transitions. Word has length 162 [2019-09-09 05:54:07,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:07,009 INFO L475 AbstractCegarLoop]: Abstraction has 841 states and 1250 transitions. [2019-09-09 05:54:07,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:07,009 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1250 transitions. [2019-09-09 05:54:07,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-09 05:54:07,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:07,011 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, 1, 1, 1, 1] [2019-09-09 05:54:07,011 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:07,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:07,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2074826588, now seen corresponding path program 1 times [2019-09-09 05:54:07,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:07,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:07,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:07,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:07,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:07,072 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:54:07,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:07,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:07,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:07,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:07,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:07,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:07,074 INFO L87 Difference]: Start difference. First operand 841 states and 1250 transitions. Second operand 4 states. [2019-09-09 05:54:07,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:07,431 INFO L93 Difference]: Finished difference Result 925 states and 1360 transitions. [2019-09-09 05:54:07,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:07,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-09 05:54:07,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:07,433 INFO L225 Difference]: With dead ends: 925 [2019-09-09 05:54:07,433 INFO L226 Difference]: Without dead ends: 925 [2019-09-09 05:54:07,433 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:07,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-09-09 05:54:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 841. [2019-09-09 05:54:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-09-09 05:54:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1248 transitions. [2019-09-09 05:54:07,446 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1248 transitions. Word has length 162 [2019-09-09 05:54:07,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:07,446 INFO L475 AbstractCegarLoop]: Abstraction has 841 states and 1248 transitions. [2019-09-09 05:54:07,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1248 transitions. [2019-09-09 05:54:07,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-09 05:54:07,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:07,449 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] [2019-09-09 05:54:07,449 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:07,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:07,449 INFO L82 PathProgramCache]: Analyzing trace with hash 651564794, now seen corresponding path program 1 times [2019-09-09 05:54:07,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:07,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:07,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:07,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:07,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:07,529 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:54:07,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:07,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:07,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:07,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:07,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:07,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:07,531 INFO L87 Difference]: Start difference. First operand 841 states and 1248 transitions. Second operand 4 states. [2019-09-09 05:54:07,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:07,893 INFO L93 Difference]: Finished difference Result 975 states and 1454 transitions. [2019-09-09 05:54:07,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:07,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-09 05:54:07,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:07,896 INFO L225 Difference]: With dead ends: 975 [2019-09-09 05:54:07,896 INFO L226 Difference]: Without dead ends: 975 [2019-09-09 05:54:07,896 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:07,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2019-09-09 05:54:07,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 901. [2019-09-09 05:54:07,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-09-09 05:54:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1354 transitions. [2019-09-09 05:54:07,904 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1354 transitions. Word has length 164 [2019-09-09 05:54:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:07,904 INFO L475 AbstractCegarLoop]: Abstraction has 901 states and 1354 transitions. [2019-09-09 05:54:07,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1354 transitions. [2019-09-09 05:54:07,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-09 05:54:07,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:07,906 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, 1, 1, 1, 1] [2019-09-09 05:54:07,906 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:07,907 INFO L82 PathProgramCache]: Analyzing trace with hash 280955733, now seen corresponding path program 1 times [2019-09-09 05:54:07,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:07,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:07,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:07,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:07,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:07,963 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:54:07,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:07,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:07,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:07,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:07,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:07,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:07,964 INFO L87 Difference]: Start difference. First operand 901 states and 1354 transitions. Second operand 4 states. [2019-09-09 05:54:08,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:08,304 INFO L93 Difference]: Finished difference Result 985 states and 1464 transitions. [2019-09-09 05:54:08,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:08,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-09 05:54:08,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:08,306 INFO L225 Difference]: With dead ends: 985 [2019-09-09 05:54:08,306 INFO L226 Difference]: Without dead ends: 985 [2019-09-09 05:54:08,306 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:08,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2019-09-09 05:54:08,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 901. [2019-09-09 05:54:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-09-09 05:54:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1352 transitions. [2019-09-09 05:54:08,314 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1352 transitions. Word has length 165 [2019-09-09 05:54:08,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:08,315 INFO L475 AbstractCegarLoop]: Abstraction has 901 states and 1352 transitions. [2019-09-09 05:54:08,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:08,315 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1352 transitions. [2019-09-09 05:54:08,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-09 05:54:08,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:08,316 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, 1, 1, 1, 1] [2019-09-09 05:54:08,316 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:08,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:08,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1973548455, now seen corresponding path program 1 times [2019-09-09 05:54:08,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:08,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:08,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:08,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:08,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:08,388 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:54:08,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:08,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:08,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:08,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:08,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:08,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:08,389 INFO L87 Difference]: Start difference. First operand 901 states and 1352 transitions. Second operand 4 states. [2019-09-09 05:54:08,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:08,741 INFO L93 Difference]: Finished difference Result 973 states and 1446 transitions. [2019-09-09 05:54:08,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:08,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-09 05:54:08,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:08,743 INFO L225 Difference]: With dead ends: 973 [2019-09-09 05:54:08,743 INFO L226 Difference]: Without dead ends: 973 [2019-09-09 05:54:08,744 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:08,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-09-09 05:54:08,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 901. [2019-09-09 05:54:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-09-09 05:54:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1350 transitions. [2019-09-09 05:54:08,755 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1350 transitions. Word has length 166 [2019-09-09 05:54:08,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:08,755 INFO L475 AbstractCegarLoop]: Abstraction has 901 states and 1350 transitions. [2019-09-09 05:54:08,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:08,755 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1350 transitions. [2019-09-09 05:54:08,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-09 05:54:08,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:08,758 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, 1, 1, 1, 1] [2019-09-09 05:54:08,758 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:08,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:08,758 INFO L82 PathProgramCache]: Analyzing trace with hash 32311432, now seen corresponding path program 1 times [2019-09-09 05:54:08,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:08,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:08,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:08,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:08,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:08,846 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:54:08,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:08,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:08,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:08,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:08,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:08,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:08,848 INFO L87 Difference]: Start difference. First operand 901 states and 1350 transitions. Second operand 4 states. [2019-09-09 05:54:09,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:09,206 INFO L93 Difference]: Finished difference Result 973 states and 1444 transitions. [2019-09-09 05:54:09,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:09,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-09 05:54:09,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:09,208 INFO L225 Difference]: With dead ends: 973 [2019-09-09 05:54:09,208 INFO L226 Difference]: Without dead ends: 973 [2019-09-09 05:54:09,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:54:09,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-09-09 05:54:09,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 901. [2019-09-09 05:54:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-09-09 05:54:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1348 transitions. [2019-09-09 05:54:09,216 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1348 transitions. Word has length 166 [2019-09-09 05:54:09,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:09,216 INFO L475 AbstractCegarLoop]: Abstraction has 901 states and 1348 transitions. [2019-09-09 05:54:09,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1348 transitions. [2019-09-09 05:54:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-09 05:54:09,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:09,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, 1, 1, 1, 1] [2019-09-09 05:54:09,218 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:09,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:09,218 INFO L82 PathProgramCache]: Analyzing trace with hash 220808150, now seen corresponding path program 1 times [2019-09-09 05:54:09,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:09,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:09,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:09,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:09,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:09,288 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:54:09,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:09,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:09,289 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:09,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:09,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:09,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:09,290 INFO L87 Difference]: Start difference. First operand 901 states and 1348 transitions. Second operand 4 states. [2019-09-09 05:54:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:09,622 INFO L93 Difference]: Finished difference Result 967 states and 1435 transitions. [2019-09-09 05:54:09,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:09,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-09 05:54:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:09,624 INFO L225 Difference]: With dead ends: 967 [2019-09-09 05:54:09,624 INFO L226 Difference]: Without dead ends: 967 [2019-09-09 05:54:09,625 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:09,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-09-09 05:54:09,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 901. [2019-09-09 05:54:09,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-09-09 05:54:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1346 transitions. [2019-09-09 05:54:09,634 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1346 transitions. Word has length 167 [2019-09-09 05:54:09,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:09,635 INFO L475 AbstractCegarLoop]: Abstraction has 901 states and 1346 transitions. [2019-09-09 05:54:09,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:09,635 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1346 transitions. [2019-09-09 05:54:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-09 05:54:09,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:09,637 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, 1, 1] [2019-09-09 05:54:09,637 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:09,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:09,637 INFO L82 PathProgramCache]: Analyzing trace with hash -711262146, now seen corresponding path program 1 times [2019-09-09 05:54:09,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:09,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:09,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:09,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:09,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:09,710 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:54:09,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:09,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:09,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:09,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:09,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:09,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:09,712 INFO L87 Difference]: Start difference. First operand 901 states and 1346 transitions. Second operand 4 states. [2019-09-09 05:54:10,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:10,023 INFO L93 Difference]: Finished difference Result 961 states and 1426 transitions. [2019-09-09 05:54:10,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:10,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-09 05:54:10,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:10,025 INFO L225 Difference]: With dead ends: 961 [2019-09-09 05:54:10,025 INFO L226 Difference]: Without dead ends: 961 [2019-09-09 05:54:10,026 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:10,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-09-09 05:54:10,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 901. [2019-09-09 05:54:10,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-09-09 05:54:10,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1344 transitions. [2019-09-09 05:54:10,033 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1344 transitions. Word has length 167 [2019-09-09 05:54:10,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:10,033 INFO L475 AbstractCegarLoop]: Abstraction has 901 states and 1344 transitions. [2019-09-09 05:54:10,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1344 transitions. [2019-09-09 05:54:10,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-09 05:54:10,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:10,035 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, 1, 1] [2019-09-09 05:54:10,035 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:10,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:10,035 INFO L82 PathProgramCache]: Analyzing trace with hash -351465681, now seen corresponding path program 1 times [2019-09-09 05:54:10,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:10,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:10,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:10,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:10,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:10,087 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:54:10,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:10,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:10,087 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:10,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:10,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:10,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:10,088 INFO L87 Difference]: Start difference. First operand 901 states and 1344 transitions. Second operand 4 states. [2019-09-09 05:54:10,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:10,452 INFO L93 Difference]: Finished difference Result 981 states and 1450 transitions. [2019-09-09 05:54:10,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:10,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-09 05:54:10,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:10,454 INFO L225 Difference]: With dead ends: 981 [2019-09-09 05:54:10,454 INFO L226 Difference]: Without dead ends: 981 [2019-09-09 05:54:10,454 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:10,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-09-09 05:54:10,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 901. [2019-09-09 05:54:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-09-09 05:54:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1342 transitions. [2019-09-09 05:54:10,463 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1342 transitions. Word has length 167 [2019-09-09 05:54:10,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:10,463 INFO L475 AbstractCegarLoop]: Abstraction has 901 states and 1342 transitions. [2019-09-09 05:54:10,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1342 transitions. [2019-09-09 05:54:10,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-09 05:54:10,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:10,465 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, 1, 1, 1, 1] [2019-09-09 05:54:10,465 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:10,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:10,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1621820048, now seen corresponding path program 1 times [2019-09-09 05:54:10,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:10,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:10,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:10,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:10,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:10,541 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:54:10,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:10,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:10,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:10,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:10,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:10,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:10,542 INFO L87 Difference]: Start difference. First operand 901 states and 1342 transitions. Second operand 4 states. [2019-09-09 05:54:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:10,874 INFO L93 Difference]: Finished difference Result 967 states and 1429 transitions. [2019-09-09 05:54:10,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:10,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-09 05:54:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:10,876 INFO L225 Difference]: With dead ends: 967 [2019-09-09 05:54:10,876 INFO L226 Difference]: Without dead ends: 967 [2019-09-09 05:54:10,877 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:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-09-09 05:54:10,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 901. [2019-09-09 05:54:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-09-09 05:54:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1340 transitions. [2019-09-09 05:54:10,886 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1340 transitions. Word has length 168 [2019-09-09 05:54:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:10,886 INFO L475 AbstractCegarLoop]: Abstraction has 901 states and 1340 transitions. [2019-09-09 05:54:10,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1340 transitions. [2019-09-09 05:54:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-09 05:54:10,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:10,888 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, 1, 1] [2019-09-09 05:54:10,888 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:10,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:10,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1880196680, now seen corresponding path program 1 times [2019-09-09 05:54:10,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:10,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:10,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:10,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:10,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:10,946 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:54:10,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:10,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:10,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:10,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:10,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:10,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:10,947 INFO L87 Difference]: Start difference. First operand 901 states and 1340 transitions. Second operand 4 states. [2019-09-09 05:54:11,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:11,319 INFO L93 Difference]: Finished difference Result 981 states and 1446 transitions. [2019-09-09 05:54:11,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:11,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-09 05:54:11,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:11,321 INFO L225 Difference]: With dead ends: 981 [2019-09-09 05:54:11,321 INFO L226 Difference]: Without dead ends: 981 [2019-09-09 05:54:11,321 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:11,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-09-09 05:54:11,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 901. [2019-09-09 05:54:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-09-09 05:54:11,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1338 transitions. [2019-09-09 05:54:11,330 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1338 transitions. Word has length 168 [2019-09-09 05:54:11,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:11,331 INFO L475 AbstractCegarLoop]: Abstraction has 901 states and 1338 transitions. [2019-09-09 05:54:11,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:11,331 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1338 transitions. [2019-09-09 05:54:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-09 05:54:11,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:11,333 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, 1, 1, 1, 1] [2019-09-09 05:54:11,333 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:11,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:11,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1636269502, now seen corresponding path program 1 times [2019-09-09 05:54:11,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:11,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:11,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:11,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:11,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:11,413 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:54:11,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:11,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:11,413 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:11,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:11,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:11,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:11,414 INFO L87 Difference]: Start difference. First operand 901 states and 1338 transitions. Second operand 4 states. [2019-09-09 05:54:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:11,732 INFO L93 Difference]: Finished difference Result 961 states and 1418 transitions. [2019-09-09 05:54:11,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:11,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-09 05:54:11,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:11,734 INFO L225 Difference]: With dead ends: 961 [2019-09-09 05:54:11,734 INFO L226 Difference]: Without dead ends: 961 [2019-09-09 05:54:11,734 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:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-09-09 05:54:11,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 885. [2019-09-09 05:54:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-09-09 05:54:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1318 transitions. [2019-09-09 05:54:11,743 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1318 transitions. Word has length 169 [2019-09-09 05:54:11,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:11,743 INFO L475 AbstractCegarLoop]: Abstraction has 885 states and 1318 transitions. [2019-09-09 05:54:11,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:11,743 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1318 transitions. [2019-09-09 05:54:11,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-09 05:54:11,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:11,745 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, 1, 1] [2019-09-09 05:54:11,745 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:11,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:11,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2065014188, now seen corresponding path program 1 times [2019-09-09 05:54:11,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:11,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:11,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:11,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:11,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:11,821 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:54:11,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:11,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:11,822 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:11,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:11,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:11,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:11,823 INFO L87 Difference]: Start difference. First operand 885 states and 1318 transitions. Second operand 4 states. [2019-09-09 05:54:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:12,142 INFO L93 Difference]: Finished difference Result 935 states and 1388 transitions. [2019-09-09 05:54:12,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:12,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-09 05:54:12,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:12,145 INFO L225 Difference]: With dead ends: 935 [2019-09-09 05:54:12,145 INFO L226 Difference]: Without dead ends: 935 [2019-09-09 05:54:12,145 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:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-09-09 05:54:12,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 885. [2019-09-09 05:54:12,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-09-09 05:54:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1316 transitions. [2019-09-09 05:54:12,154 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1316 transitions. Word has length 169 [2019-09-09 05:54:12,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:12,154 INFO L475 AbstractCegarLoop]: Abstraction has 885 states and 1316 transitions. [2019-09-09 05:54:12,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1316 transitions. [2019-09-09 05:54:12,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-09 05:54:12,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:12,155 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:12,155 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:12,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:12,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1971016812, now seen corresponding path program 1 times [2019-09-09 05:54:12,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:12,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:12,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:12,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:12,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-09 05:54:12,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:12,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:12,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:12,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:12,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:12,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:12,212 INFO L87 Difference]: Start difference. First operand 885 states and 1316 transitions. Second operand 4 states. [2019-09-09 05:54:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:12,530 INFO L93 Difference]: Finished difference Result 957 states and 1410 transitions. [2019-09-09 05:54:12,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:12,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-09-09 05:54:12,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:12,533 INFO L225 Difference]: With dead ends: 957 [2019-09-09 05:54:12,533 INFO L226 Difference]: Without dead ends: 957 [2019-09-09 05:54:12,533 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:12,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2019-09-09 05:54:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 887. [2019-09-09 05:54:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-09-09 05:54:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1318 transitions. [2019-09-09 05:54:12,541 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1318 transitions. Word has length 170 [2019-09-09 05:54:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:12,541 INFO L475 AbstractCegarLoop]: Abstraction has 887 states and 1318 transitions. [2019-09-09 05:54:12,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1318 transitions. [2019-09-09 05:54:12,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-09 05:54:12,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:12,543 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:12,543 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:12,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:12,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1146087709, now seen corresponding path program 1 times [2019-09-09 05:54:12,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:12,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:12,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:12,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:12,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:12,700 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:54:12,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:12,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:54:12,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:12,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:54:12,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:54:12,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:12,703 INFO L87 Difference]: Start difference. First operand 887 states and 1318 transitions. Second operand 5 states. [2019-09-09 05:54:13,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:13,302 INFO L93 Difference]: Finished difference Result 1045 states and 1560 transitions. [2019-09-09 05:54:13,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:54:13,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2019-09-09 05:54:13,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:13,304 INFO L225 Difference]: With dead ends: 1045 [2019-09-09 05:54:13,305 INFO L226 Difference]: Without dead ends: 1045 [2019-09-09 05:54:13,305 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:54:13,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-09-09 05:54:13,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 953. [2019-09-09 05:54:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-09-09 05:54:13,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1436 transitions. [2019-09-09 05:54:13,311 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1436 transitions. Word has length 170 [2019-09-09 05:54:13,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:13,312 INFO L475 AbstractCegarLoop]: Abstraction has 953 states and 1436 transitions. [2019-09-09 05:54:13,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:54:13,312 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1436 transitions. [2019-09-09 05:54:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-09 05:54:13,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:13,313 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, 1, 1] [2019-09-09 05:54:13,313 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:13,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:13,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1686599201, now seen corresponding path program 1 times [2019-09-09 05:54:13,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:13,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:13,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:13,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:13,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:13,378 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:54:13,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:13,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:13,379 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:13,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:13,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:13,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:13,380 INFO L87 Difference]: Start difference. First operand 953 states and 1436 transitions. Second operand 4 states. [2019-09-09 05:54:13,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:13,692 INFO L93 Difference]: Finished difference Result 999 states and 1502 transitions. [2019-09-09 05:54:13,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:13,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-09-09 05:54:13,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:13,694 INFO L225 Difference]: With dead ends: 999 [2019-09-09 05:54:13,694 INFO L226 Difference]: Without dead ends: 999 [2019-09-09 05:54:13,694 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:13,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-09-09 05:54:13,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 953. [2019-09-09 05:54:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-09-09 05:54:13,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1434 transitions. [2019-09-09 05:54:13,702 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1434 transitions. Word has length 170 [2019-09-09 05:54:13,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:13,702 INFO L475 AbstractCegarLoop]: Abstraction has 953 states and 1434 transitions. [2019-09-09 05:54:13,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:13,703 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1434 transitions. [2019-09-09 05:54:13,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-09 05:54:13,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:13,704 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, 1, 1, 1] [2019-09-09 05:54:13,704 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:13,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:13,704 INFO L82 PathProgramCache]: Analyzing trace with hash 449809476, now seen corresponding path program 1 times [2019-09-09 05:54:13,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:13,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:13,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:13,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:13,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:13,763 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:54:13,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:13,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:13,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:13,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:13,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:13,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:13,764 INFO L87 Difference]: Start difference. First operand 953 states and 1434 transitions. Second operand 4 states. [2019-09-09 05:54:14,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:14,038 INFO L93 Difference]: Finished difference Result 981 states and 1472 transitions. [2019-09-09 05:54:14,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:14,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-09-09 05:54:14,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:14,040 INFO L225 Difference]: With dead ends: 981 [2019-09-09 05:54:14,040 INFO L226 Difference]: Without dead ends: 981 [2019-09-09 05:54:14,041 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:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-09-09 05:54:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 953. [2019-09-09 05:54:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-09-09 05:54:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1432 transitions. [2019-09-09 05:54:14,047 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1432 transitions. Word has length 170 [2019-09-09 05:54:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:14,047 INFO L475 AbstractCegarLoop]: Abstraction has 953 states and 1432 transitions. [2019-09-09 05:54:14,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1432 transitions. [2019-09-09 05:54:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-09 05:54:14,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:14,049 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, 1, 1, 1, 1] [2019-09-09 05:54:14,049 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:14,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:14,052 INFO L82 PathProgramCache]: Analyzing trace with hash 784350577, now seen corresponding path program 1 times [2019-09-09 05:54:14,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:14,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:14,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:14,129 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:54:14,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:14,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:14,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:14,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:14,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:14,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:14,130 INFO L87 Difference]: Start difference. First operand 953 states and 1432 transitions. Second operand 4 states. [2019-09-09 05:54:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:14,546 INFO L93 Difference]: Finished difference Result 1027 states and 1526 transitions. [2019-09-09 05:54:14,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:14,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-09-09 05:54:14,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:14,549 INFO L225 Difference]: With dead ends: 1027 [2019-09-09 05:54:14,549 INFO L226 Difference]: Without dead ends: 1027 [2019-09-09 05:54:14,549 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:14,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-09-09 05:54:14,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 953. [2019-09-09 05:54:14,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-09-09 05:54:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1430 transitions. [2019-09-09 05:54:14,559 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1430 transitions. Word has length 177 [2019-09-09 05:54:14,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:14,560 INFO L475 AbstractCegarLoop]: Abstraction has 953 states and 1430 transitions. [2019-09-09 05:54:14,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:14,560 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1430 transitions. [2019-09-09 05:54:14,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-09 05:54:14,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:14,561 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:14,562 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:14,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:14,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1434870690, now seen corresponding path program 1 times [2019-09-09 05:54:14,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:14,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:14,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:14,652 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-09 05:54:14,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:14,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:14,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:14,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:14,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:14,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:14,654 INFO L87 Difference]: Start difference. First operand 953 states and 1430 transitions. Second operand 4 states. [2019-09-09 05:54:14,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:14,981 INFO L93 Difference]: Finished difference Result 1023 states and 1520 transitions. [2019-09-09 05:54:14,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:14,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-09-09 05:54:14,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:14,984 INFO L225 Difference]: With dead ends: 1023 [2019-09-09 05:54:14,984 INFO L226 Difference]: Without dead ends: 1023 [2019-09-09 05:54:14,984 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:14,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-09-09 05:54:14,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 891. [2019-09-09 05:54:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-09-09 05:54:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1336 transitions. [2019-09-09 05:54:14,993 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1336 transitions. Word has length 178 [2019-09-09 05:54:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:14,993 INFO L475 AbstractCegarLoop]: Abstraction has 891 states and 1336 transitions. [2019-09-09 05:54:14,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1336 transitions. [2019-09-09 05:54:14,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-09 05:54:14,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:14,994 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, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:14,994 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:14,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:14,995 INFO L82 PathProgramCache]: Analyzing trace with hash -203441222, now seen corresponding path program 1 times [2019-09-09 05:54:14,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:14,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:14,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:15,885 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 174 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:15,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:54:15,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:54:15,886 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2019-09-09 05:54:15,888 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], [563], [568], [583], [588], [593], [598], [603], [608], [614], [619], [621], [626], [631], [636], [641], [647], [650], [654], [675], [709], [711], [723], [726], [727], [739], [747], [748], [749] [2019-09-09 05:54:15,970 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:54:15,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:54:16,041 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:54:16,043 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:54:16,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:16,048 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:54:16,146 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-09 05:54:16,146 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:54:16,155 INFO L420 sIntCurrentIteration]: We unified 178 AI predicates to 178 [2019-09-09 05:54:16,155 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:54:16,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:54:16,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-09-09 05:54:16,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:16,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-09 05:54:16,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-09 05:54:16,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:54:16,159 INFO L87 Difference]: Start difference. First operand 891 states and 1336 transitions. Second operand 2 states. [2019-09-09 05:54:16,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:16,160 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-09 05:54:16,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-09 05:54:16,160 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 179 [2019-09-09 05:54:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:16,161 INFO L225 Difference]: With dead ends: 2 [2019-09-09 05:54:16,161 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:54:16,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 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:54:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:54:16,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:54:16,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:54:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:54:16,162 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 179 [2019-09-09 05:54:16,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:16,162 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:54:16,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-09 05:54:16,162 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:54:16,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:54:16,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:54:16 BoogieIcfgContainer [2019-09-09 05:54:16,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:54:16,172 INFO L168 Benchmark]: Toolchain (without parser) took 53684.13 ms. Allocated memory was 142.6 MB in the beginning and 654.8 MB in the end (delta: 512.2 MB). Free memory was 88.6 MB in the beginning and 377.9 MB in the end (delta: -289.3 MB). Peak memory consumption was 222.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:16,177 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 142.6 MB. Free memory was 108.8 MB in the beginning and 108.6 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:54:16,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 955.47 ms. Allocated memory was 142.6 MB in the beginning and 203.4 MB in the end (delta: 60.8 MB). Free memory was 88.3 MB in the beginning and 160.1 MB in the end (delta: -71.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:16,182 INFO L168 Benchmark]: Boogie Preprocessor took 194.83 ms. Allocated memory is still 203.4 MB. Free memory was 160.1 MB in the beginning and 151.6 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:16,183 INFO L168 Benchmark]: RCFGBuilder took 1309.65 ms. Allocated memory was 203.4 MB in the beginning and 233.8 MB in the end (delta: 30.4 MB). Free memory was 151.6 MB in the beginning and 167.1 MB in the end (delta: -15.5 MB). Peak memory consumption was 75.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:16,183 INFO L168 Benchmark]: TraceAbstraction took 51217.13 ms. Allocated memory was 233.8 MB in the beginning and 654.8 MB in the end (delta: 421.0 MB). Free memory was 165.7 MB in the beginning and 377.9 MB in the end (delta: -212.1 MB). Peak memory consumption was 208.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:16,189 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 142.6 MB. Free memory was 108.8 MB in the beginning and 108.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 955.47 ms. Allocated memory was 142.6 MB in the beginning and 203.4 MB in the end (delta: 60.8 MB). Free memory was 88.3 MB in the beginning and 160.1 MB in the end (delta: -71.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 194.83 ms. Allocated memory is still 203.4 MB. Free memory was 160.1 MB in the beginning and 151.6 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1309.65 ms. Allocated memory was 203.4 MB in the beginning and 233.8 MB in the end (delta: 30.4 MB). Free memory was 151.6 MB in the beginning and 167.1 MB in the end (delta: -15.5 MB). Peak memory consumption was 75.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51217.13 ms. Allocated memory was 233.8 MB in the beginning and 654.8 MB in the end (delta: 421.0 MB). Free memory was 165.7 MB in the beginning and 377.9 MB in the end (delta: -212.1 MB). Peak memory consumption was 208.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1774]: 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, 197 locations, 1 error locations. SAFE Result, 51.1s OverallTime, 110 OverallIterations, 7 TraceHistogramMax, 39.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 27109 SDtfs, 7653 SDslu, 41078 SDs, 0 SdLazy, 22748 SolverSat, 818 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 774 GetRequests, 402 SyntacticMatches, 46 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=953occurred 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.196629213483146 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 110 MinimizatonAttempts, 6624 StatesRemovedByMinimization, 109 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 13968 NumberOfCodeBlocks, 13968 NumberOfCodeBlocksAsserted, 110 NumberOfCheckSat, 13858 ConstructedInterpolants, 0 QuantifiedInterpolants, 5136249 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 110 InterpolantComputations, 109 PerfectInterpolantSequences, 13674/13848 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...