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.09.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:29,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:29,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:29,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:29,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:29,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:29,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:29,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:29,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:29,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:29,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:29,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:29,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:29,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:29,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:29,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:29,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:29,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:29,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:29,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:29,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:29,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:29,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:29,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:29,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:29,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:29,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:29,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:29,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:29,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:29,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:29,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:29,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:29,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:29,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:29,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:29,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:29,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:29,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:29,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:29,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:29,598 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:27:29,620 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:29,620 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:29,622 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:29,622 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:29,623 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:29,623 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:29,623 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:29,623 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:29,624 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:29,624 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:29,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:29,627 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:29,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:29,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:29,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:29,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:29,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:29,629 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:29,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:29,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:29,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:29,630 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:29,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:29,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:29,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:29,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:29,631 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:29,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:29,631 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:29,631 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:29,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:29,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:29,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:29,711 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:29,711 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:29,713 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.09.i.cil-2.c [2019-09-20 13:27:29,787 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bffcb893/5912472a731d41a68bb1e091007989c6/FLAG3b10a626d [2019-09-20 13:27:30,423 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:30,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.09.i.cil-2.c [2019-09-20 13:27:30,453 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bffcb893/5912472a731d41a68bb1e091007989c6/FLAG3b10a626d [2019-09-20 13:27:30,619 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bffcb893/5912472a731d41a68bb1e091007989c6 [2019-09-20 13:27:30,635 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:30,639 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:30,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:30,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:30,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:30,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:30" (1/1) ... [2019-09-20 13:27:30,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ccc3cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:30, skipping insertion in model container [2019-09-20 13:27:30,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:30" (1/1) ... [2019-09-20 13:27:30,665 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:30,750 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:31,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:31,401 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:31,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:31,660 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:31,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:31 WrapperNode [2019-09-20 13:27:31,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:31,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:31,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:31,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:31,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:31" (1/1) ... [2019-09-20 13:27:31,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:31" (1/1) ... [2019-09-20 13:27:31,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:31" (1/1) ... [2019-09-20 13:27:31,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:31" (1/1) ... [2019-09-20 13:27:31,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:31" (1/1) ... [2019-09-20 13:27:31,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:31" (1/1) ... [2019-09-20 13:27:31,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:31" (1/1) ... [2019-09-20 13:27:31,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:31,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:31,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:31,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:31,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:31,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:31,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:31,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:27:31,955 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:27:31,956 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:31,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:27:31,956 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:31,956 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:31,956 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:31,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:31,958 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:31,958 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:27:31,958 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:31,958 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:27:31,959 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:27:31,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:31,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:31,959 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:31,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:31,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:31,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:31,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:31,960 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:31,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:31,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:31,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:31,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:31,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:31,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:31,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:31,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:31,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:31,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:31,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:32,442 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:33,084 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:27:33,084 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:27:33,105 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:33,105 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:33,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:33 BoogieIcfgContainer [2019-09-20 13:27:33,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:33,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:33,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:33,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:33,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:30" (1/3) ... [2019-09-20 13:27:33,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ae7154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:33, skipping insertion in model container [2019-09-20 13:27:33,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:31" (2/3) ... [2019-09-20 13:27:33,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ae7154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:33, skipping insertion in model container [2019-09-20 13:27:33,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:33" (3/3) ... [2019-09-20 13:27:33,115 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-2.c [2019-09-20 13:27:33,126 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:33,134 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:33,152 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:33,180 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:33,181 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:33,181 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:33,181 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:33,181 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:33,181 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:33,181 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:33,182 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:33,201 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2019-09-20 13:27:33,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-20 13:27:33,214 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:33,215 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:33,218 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:33,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:33,224 INFO L82 PathProgramCache]: Analyzing trace with hash 514312201, now seen corresponding path program 1 times [2019-09-20 13:27:33,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:33,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:33,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:33,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:33,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:33,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:33,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:33,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:33,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:33,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:33,650 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2019-09-20 13:27:34,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,159 INFO L93 Difference]: Finished difference Result 190 states and 310 transitions. [2019-09-20 13:27:34,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:34,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-20 13:27:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,186 INFO L225 Difference]: With dead ends: 190 [2019-09-20 13:27:34,187 INFO L226 Difference]: Without dead ends: 169 [2019-09-20 13:27:34,191 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:34,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-20 13:27:34,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-20 13:27:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-20 13:27:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2019-09-20 13:27:34,254 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 41 [2019-09-20 13:27:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,254 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2019-09-20 13:27:34,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2019-09-20 13:27:34,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:27:34,260 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,260 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:34,261 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1818416469, now seen corresponding path program 1 times [2019-09-20 13:27:34,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:34,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:34,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:34,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:34,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:34,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:34,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:34,409 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2019-09-20 13:27:34,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,777 INFO L93 Difference]: Finished difference Result 169 states and 252 transitions. [2019-09-20 13:27:34,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:34,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-09-20 13:27:34,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,780 INFO L225 Difference]: With dead ends: 169 [2019-09-20 13:27:34,780 INFO L226 Difference]: Without dead ends: 169 [2019-09-20 13:27:34,781 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:34,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-20 13:27:34,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-20 13:27:34,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-20 13:27:34,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2019-09-20 13:27:34,792 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 54 [2019-09-20 13:27:34,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,792 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2019-09-20 13:27:34,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,793 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2019-09-20 13:27:34,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:27:34,795 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,795 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:34,795 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,796 INFO L82 PathProgramCache]: Analyzing trace with hash 737556739, now seen corresponding path program 1 times [2019-09-20 13:27:34,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:34,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:34,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:34,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:34,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:34,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:34,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:34,922 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 4 states. [2019-09-20 13:27:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:35,241 INFO L93 Difference]: Finished difference Result 168 states and 250 transitions. [2019-09-20 13:27:35,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:35,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-20 13:27:35,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:35,243 INFO L225 Difference]: With dead ends: 168 [2019-09-20 13:27:35,243 INFO L226 Difference]: Without dead ends: 168 [2019-09-20 13:27:35,244 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:35,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-20 13:27:35,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 152. [2019-09-20 13:27:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-20 13:27:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 230 transitions. [2019-09-20 13:27:35,264 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 230 transitions. Word has length 55 [2019-09-20 13:27:35,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:35,264 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 230 transitions. [2019-09-20 13:27:35,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:35,265 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 230 transitions. [2019-09-20 13:27:35,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:27:35,271 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:35,272 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:35,272 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:35,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:35,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1603135895, now seen corresponding path program 1 times [2019-09-20 13:27:35,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:35,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:35,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:35,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:35,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:35,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:27:35,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:35,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:27:35,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:27:35,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:35,388 INFO L87 Difference]: Start difference. First operand 152 states and 230 transitions. Second operand 5 states. [2019-09-20 13:27:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:35,951 INFO L93 Difference]: Finished difference Result 173 states and 258 transitions. [2019-09-20 13:27:35,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:35,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-20 13:27:35,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:35,959 INFO L225 Difference]: With dead ends: 173 [2019-09-20 13:27:35,960 INFO L226 Difference]: Without dead ends: 173 [2019-09-20 13:27:35,960 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:27:35,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-20 13:27:35,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-09-20 13:27:35,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:27:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2019-09-20 13:27:35,980 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 55 [2019-09-20 13:27:35,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:35,981 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2019-09-20 13:27:35,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:27:35,981 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2019-09-20 13:27:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:27:35,983 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:35,983 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:35,983 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:35,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:35,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1781246799, now seen corresponding path program 1 times [2019-09-20 13:27:35,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:35,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:35,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:36,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:36,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:36,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:36,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:36,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:36,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:36,117 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2019-09-20 13:27:36,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:36,452 INFO L93 Difference]: Finished difference Result 187 states and 274 transitions. [2019-09-20 13:27:36,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:36,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-20 13:27:36,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:36,455 INFO L225 Difference]: With dead ends: 187 [2019-09-20 13:27:36,455 INFO L226 Difference]: Without dead ends: 187 [2019-09-20 13:27:36,456 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:36,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-20 13:27:36,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2019-09-20 13:27:36,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:27:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2019-09-20 13:27:36,464 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 55 [2019-09-20 13:27:36,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:36,464 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2019-09-20 13:27:36,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:36,464 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2019-09-20 13:27:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:27:36,466 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:36,466 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:36,466 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:36,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:36,467 INFO L82 PathProgramCache]: Analyzing trace with hash -870189042, now seen corresponding path program 1 times [2019-09-20 13:27:36,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:36,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:36,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:36,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:36,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:36,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:36,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:36,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:36,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:36,540 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2019-09-20 13:27:36,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:36,830 INFO L93 Difference]: Finished difference Result 185 states and 271 transitions. [2019-09-20 13:27:36,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:36,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-20 13:27:36,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:36,833 INFO L225 Difference]: With dead ends: 185 [2019-09-20 13:27:36,833 INFO L226 Difference]: Without dead ends: 185 [2019-09-20 13:27:36,834 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:36,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-20 13:27:36,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-20 13:27:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:27:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2019-09-20 13:27:36,840 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 55 [2019-09-20 13:27:36,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:36,841 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2019-09-20 13:27:36,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:36,841 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2019-09-20 13:27:36,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-20 13:27:36,842 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:36,842 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:36,842 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:36,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:36,843 INFO L82 PathProgramCache]: Analyzing trace with hash 987281320, now seen corresponding path program 1 times [2019-09-20 13:27:36,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:36,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:36,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:36,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:36,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:36,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:36,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:36,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:36,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:36,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:36,915 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand 4 states. [2019-09-20 13:27:37,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:37,195 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2019-09-20 13:27:37,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:37,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-09-20 13:27:37,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:37,197 INFO L225 Difference]: With dead ends: 185 [2019-09-20 13:27:37,197 INFO L226 Difference]: Without dead ends: 185 [2019-09-20 13:27:37,197 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:37,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-20 13:27:37,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-20 13:27:37,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:27:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 254 transitions. [2019-09-20 13:27:37,203 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 254 transitions. Word has length 56 [2019-09-20 13:27:37,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:37,204 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 254 transitions. [2019-09-20 13:27:37,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:37,204 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 254 transitions. [2019-09-20 13:27:37,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-20 13:27:37,205 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:37,205 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:37,205 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:37,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:37,206 INFO L82 PathProgramCache]: Analyzing trace with hash -365258357, now seen corresponding path program 1 times [2019-09-20 13:27:37,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:37,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:37,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:37,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:37,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:37,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:37,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:37,261 INFO L87 Difference]: Start difference. First operand 172 states and 254 transitions. Second operand 4 states. [2019-09-20 13:27:37,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:37,537 INFO L93 Difference]: Finished difference Result 185 states and 269 transitions. [2019-09-20 13:27:37,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:37,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-09-20 13:27:37,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:37,540 INFO L225 Difference]: With dead ends: 185 [2019-09-20 13:27:37,540 INFO L226 Difference]: Without dead ends: 185 [2019-09-20 13:27:37,540 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:37,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-20 13:27:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-20 13:27:37,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:27:37,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2019-09-20 13:27:37,546 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 57 [2019-09-20 13:27:37,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:37,547 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2019-09-20 13:27:37,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:37,547 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2019-09-20 13:27:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-20 13:27:37,548 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:37,548 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:37,548 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:37,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:37,548 INFO L82 PathProgramCache]: Analyzing trace with hash -626349981, now seen corresponding path program 1 times [2019-09-20 13:27:37,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:37,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:37,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:37,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:37,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:37,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:37,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:37,616 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 4 states. [2019-09-20 13:27:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:37,897 INFO L93 Difference]: Finished difference Result 185 states and 268 transitions. [2019-09-20 13:27:37,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:37,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-20 13:27:37,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:37,899 INFO L225 Difference]: With dead ends: 185 [2019-09-20 13:27:37,899 INFO L226 Difference]: Without dead ends: 185 [2019-09-20 13:27:37,900 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:37,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-20 13:27:37,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-20 13:27:37,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:27:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 252 transitions. [2019-09-20 13:27:37,908 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 252 transitions. Word has length 58 [2019-09-20 13:27:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:37,908 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 252 transitions. [2019-09-20 13:27:37,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:37,909 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 252 transitions. [2019-09-20 13:27:37,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-20 13:27:37,912 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:37,913 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:37,913 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:37,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:37,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1341820354, now seen corresponding path program 1 times [2019-09-20 13:27:37,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:37,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:37,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:38,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:38,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:38,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:38,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:38,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:38,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:38,010 INFO L87 Difference]: Start difference. First operand 172 states and 252 transitions. Second operand 4 states. [2019-09-20 13:27:38,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:38,328 INFO L93 Difference]: Finished difference Result 214 states and 314 transitions. [2019-09-20 13:27:38,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:38,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-20 13:27:38,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:38,330 INFO L225 Difference]: With dead ends: 214 [2019-09-20 13:27:38,330 INFO L226 Difference]: Without dead ends: 214 [2019-09-20 13:27:38,331 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-20 13:27:38,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-20 13:27:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:27:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2019-09-20 13:27:38,337 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 58 [2019-09-20 13:27:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:38,337 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2019-09-20 13:27:38,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:38,338 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2019-09-20 13:27:38,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-20 13:27:38,339 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:38,339 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:38,339 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:38,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:38,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1412290330, now seen corresponding path program 1 times [2019-09-20 13:27:38,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:38,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:38,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:38,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:38,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:38,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:38,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:38,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:38,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:38,394 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 4 states. [2019-09-20 13:27:38,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:38,618 INFO L93 Difference]: Finished difference Result 197 states and 292 transitions. [2019-09-20 13:27:38,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:38,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-09-20 13:27:38,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:38,621 INFO L225 Difference]: With dead ends: 197 [2019-09-20 13:27:38,621 INFO L226 Difference]: Without dead ends: 197 [2019-09-20 13:27:38,621 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:38,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-20 13:27:38,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2019-09-20 13:27:38,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:27:38,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2019-09-20 13:27:38,628 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 59 [2019-09-20 13:27:38,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:38,628 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2019-09-20 13:27:38,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:38,628 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2019-09-20 13:27:38,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-20 13:27:38,629 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:38,630 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:38,630 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:38,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:38,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2096707986, now seen corresponding path program 1 times [2019-09-20 13:27:38,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:38,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:38,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:38,687 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:38,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:38,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:38,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:38,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:38,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:38,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:38,689 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand 4 states. [2019-09-20 13:27:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:38,992 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2019-09-20 13:27:38,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:38,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-09-20 13:27:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:38,995 INFO L225 Difference]: With dead ends: 214 [2019-09-20 13:27:38,995 INFO L226 Difference]: Without dead ends: 214 [2019-09-20 13:27:38,995 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:38,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-20 13:27:39,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-20 13:27:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:27:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2019-09-20 13:27:39,001 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 71 [2019-09-20 13:27:39,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:39,002 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2019-09-20 13:27:39,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2019-09-20 13:27:39,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-20 13:27:39,003 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:39,003 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:39,004 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:39,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:39,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1403946680, now seen corresponding path program 1 times [2019-09-20 13:27:39,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:39,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:39,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:39,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:39,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:39,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:39,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:39,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:39,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:39,068 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 4 states. [2019-09-20 13:27:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:39,370 INFO L93 Difference]: Finished difference Result 213 states and 310 transitions. [2019-09-20 13:27:39,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:39,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-20 13:27:39,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:39,373 INFO L225 Difference]: With dead ends: 213 [2019-09-20 13:27:39,373 INFO L226 Difference]: Without dead ends: 213 [2019-09-20 13:27:39,373 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:39,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-20 13:27:39,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2019-09-20 13:27:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:27:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2019-09-20 13:27:39,379 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 72 [2019-09-20 13:27:39,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:39,380 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2019-09-20 13:27:39,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:39,380 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2019-09-20 13:27:39,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-20 13:27:39,381 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:39,382 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:39,382 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:39,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:39,382 INFO L82 PathProgramCache]: Analyzing trace with hash 239584775, now seen corresponding path program 1 times [2019-09-20 13:27:39,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:39,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:39,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:39,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:39,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:39,448 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:39,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:39,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:39,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:39,450 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand 4 states. [2019-09-20 13:27:39,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:39,771 INFO L93 Difference]: Finished difference Result 211 states and 307 transitions. [2019-09-20 13:27:39,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:39,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-20 13:27:39,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:39,773 INFO L225 Difference]: With dead ends: 211 [2019-09-20 13:27:39,774 INFO L226 Difference]: Without dead ends: 211 [2019-09-20 13:27:39,774 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:39,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-20 13:27:39,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-20 13:27:39,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:27:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2019-09-20 13:27:39,780 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 72 [2019-09-20 13:27:39,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:39,781 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2019-09-20 13:27:39,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:39,781 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2019-09-20 13:27:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-20 13:27:39,782 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:39,783 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:39,783 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:39,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:39,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1030531279, now seen corresponding path program 1 times [2019-09-20 13:27:39,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:39,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:39,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:39,847 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:39,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:39,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:39,848 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:39,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:39,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:39,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:39,849 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand 4 states. [2019-09-20 13:27:40,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:40,114 INFO L93 Difference]: Finished difference Result 211 states and 306 transitions. [2019-09-20 13:27:40,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:40,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-20 13:27:40,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:40,117 INFO L225 Difference]: With dead ends: 211 [2019-09-20 13:27:40,117 INFO L226 Difference]: Without dead ends: 211 [2019-09-20 13:27:40,118 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:40,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-20 13:27:40,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-20 13:27:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:27:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2019-09-20 13:27:40,123 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 73 [2019-09-20 13:27:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:40,123 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2019-09-20 13:27:40,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2019-09-20 13:27:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-20 13:27:40,124 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:40,125 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:40,125 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:40,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:40,125 INFO L82 PathProgramCache]: Analyzing trace with hash 975490372, now seen corresponding path program 1 times [2019-09-20 13:27:40,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:40,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:40,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:40,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:40,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:40,182 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:40,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:40,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:40,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:40,183 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 4 states. [2019-09-20 13:27:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:40,454 INFO L93 Difference]: Finished difference Result 211 states and 305 transitions. [2019-09-20 13:27:40,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:40,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-09-20 13:27:40,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:40,455 INFO L225 Difference]: With dead ends: 211 [2019-09-20 13:27:40,456 INFO L226 Difference]: Without dead ends: 211 [2019-09-20 13:27:40,456 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:40,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-20 13:27:40,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-20 13:27:40,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:27:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2019-09-20 13:27:40,462 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 74 [2019-09-20 13:27:40,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:40,463 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2019-09-20 13:27:40,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2019-09-20 13:27:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-20 13:27:40,464 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:40,464 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:40,464 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:40,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:40,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2012812342, now seen corresponding path program 1 times [2019-09-20 13:27:40,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:40,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:40,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:40,515 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:40,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:40,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:40,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:40,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:40,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:40,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:40,517 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 4 states. [2019-09-20 13:27:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:40,790 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2019-09-20 13:27:40,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:40,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-20 13:27:40,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:40,792 INFO L225 Difference]: With dead ends: 211 [2019-09-20 13:27:40,793 INFO L226 Difference]: Without dead ends: 211 [2019-09-20 13:27:40,793 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:40,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-20 13:27:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-20 13:27:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:27:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2019-09-20 13:27:40,798 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 75 [2019-09-20 13:27:40,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:40,799 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2019-09-20 13:27:40,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:40,799 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2019-09-20 13:27:40,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-20 13:27:40,800 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:40,800 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:40,800 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:40,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:40,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1442950561, now seen corresponding path program 1 times [2019-09-20 13:27:40,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:40,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:40,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:40,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:40,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:40,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:40,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:40,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:40,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:40,866 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand 4 states. [2019-09-20 13:27:41,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:41,113 INFO L93 Difference]: Finished difference Result 201 states and 291 transitions. [2019-09-20 13:27:41,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:41,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-09-20 13:27:41,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:41,115 INFO L225 Difference]: With dead ends: 201 [2019-09-20 13:27:41,115 INFO L226 Difference]: Without dead ends: 201 [2019-09-20 13:27:41,116 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:41,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-20 13:27:41,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2019-09-20 13:27:41,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:27:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2019-09-20 13:27:41,122 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 76 [2019-09-20 13:27:41,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:41,123 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2019-09-20 13:27:41,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:41,123 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2019-09-20 13:27:41,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:41,125 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:41,125 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:41,125 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:41,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:41,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1893403063, now seen corresponding path program 1 times [2019-09-20 13:27:41,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:41,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:41,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:41,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:41,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:41,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:41,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:41,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:41,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:41,252 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 4 states. [2019-09-20 13:27:41,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:41,752 INFO L93 Difference]: Finished difference Result 300 states and 442 transitions. [2019-09-20 13:27:41,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:41,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:41,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:41,756 INFO L225 Difference]: With dead ends: 300 [2019-09-20 13:27:41,756 INFO L226 Difference]: Without dead ends: 300 [2019-09-20 13:27:41,757 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:41,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-20 13:27:41,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 224. [2019-09-20 13:27:41,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-20 13:27:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2019-09-20 13:27:41,768 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 80 [2019-09-20 13:27:41,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:41,768 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2019-09-20 13:27:41,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:41,769 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2019-09-20 13:27:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:41,770 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:41,770 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:41,770 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:41,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:41,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1821016505, now seen corresponding path program 1 times [2019-09-20 13:27:41,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:41,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:41,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:41,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:41,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:41,887 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:41,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:41,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:41,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:41,888 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand 4 states. [2019-09-20 13:27:42,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:42,224 INFO L93 Difference]: Finished difference Result 273 states and 405 transitions. [2019-09-20 13:27:42,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:42,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:42,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:42,227 INFO L225 Difference]: With dead ends: 273 [2019-09-20 13:27:42,227 INFO L226 Difference]: Without dead ends: 273 [2019-09-20 13:27:42,227 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:42,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-09-20 13:27:42,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 248. [2019-09-20 13:27:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-20 13:27:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2019-09-20 13:27:42,241 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 80 [2019-09-20 13:27:42,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:42,241 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2019-09-20 13:27:42,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:42,242 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2019-09-20 13:27:42,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:42,243 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:42,243 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:42,244 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:42,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:42,244 INFO L82 PathProgramCache]: Analyzing trace with hash -852863592, now seen corresponding path program 1 times [2019-09-20 13:27:42,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:42,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:42,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:42,330 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:42,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:42,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:42,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:42,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:42,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:42,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:42,333 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand 4 states. [2019-09-20 13:27:42,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:42,886 INFO L93 Difference]: Finished difference Result 316 states and 469 transitions. [2019-09-20 13:27:42,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:42,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:42,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:42,889 INFO L225 Difference]: With dead ends: 316 [2019-09-20 13:27:42,889 INFO L226 Difference]: Without dead ends: 316 [2019-09-20 13:27:42,890 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:42,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-20 13:27:42,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 249. [2019-09-20 13:27:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-20 13:27:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 374 transitions. [2019-09-20 13:27:42,901 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 374 transitions. Word has length 81 [2019-09-20 13:27:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:42,902 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 374 transitions. [2019-09-20 13:27:42,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:42,902 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 374 transitions. [2019-09-20 13:27:42,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-20 13:27:42,904 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:42,905 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:42,905 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:42,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:42,906 INFO L82 PathProgramCache]: Analyzing trace with hash 69064469, now seen corresponding path program 1 times [2019-09-20 13:27:42,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:42,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:42,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:43,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:43,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:43,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:43,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:43,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:43,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:43,008 INFO L87 Difference]: Start difference. First operand 249 states and 374 transitions. Second operand 4 states. [2019-09-20 13:27:43,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:43,424 INFO L93 Difference]: Finished difference Result 316 states and 468 transitions. [2019-09-20 13:27:43,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:43,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-20 13:27:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:43,427 INFO L225 Difference]: With dead ends: 316 [2019-09-20 13:27:43,427 INFO L226 Difference]: Without dead ends: 316 [2019-09-20 13:27:43,428 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:43,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-20 13:27:43,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 259. [2019-09-20 13:27:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-20 13:27:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2019-09-20 13:27:43,436 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 86 [2019-09-20 13:27:43,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:43,437 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2019-09-20 13:27:43,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:43,437 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2019-09-20 13:27:43,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-20 13:27:43,438 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:43,438 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:43,439 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:43,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:43,439 INFO L82 PathProgramCache]: Analyzing trace with hash 2133991217, now seen corresponding path program 1 times [2019-09-20 13:27:43,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:43,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:43,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:43,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:43,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:43,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:43,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:43,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:43,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:43,522 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2019-09-20 13:27:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:43,974 INFO L93 Difference]: Finished difference Result 310 states and 460 transitions. [2019-09-20 13:27:43,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:43,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-20 13:27:43,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:43,977 INFO L225 Difference]: With dead ends: 310 [2019-09-20 13:27:43,977 INFO L226 Difference]: Without dead ends: 310 [2019-09-20 13:27:43,977 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:43,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-20 13:27:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2019-09-20 13:27:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2019-09-20 13:27:43,984 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 87 [2019-09-20 13:27:43,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:43,985 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2019-09-20 13:27:43,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:43,985 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2019-09-20 13:27:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-20 13:27:43,986 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:43,986 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:43,986 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:43,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:43,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2126867523, now seen corresponding path program 1 times [2019-09-20 13:27:43,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:43,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:43,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:44,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:44,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:44,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:44,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:44,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:44,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:44,054 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2019-09-20 13:27:44,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:44,432 INFO L93 Difference]: Finished difference Result 310 states and 459 transitions. [2019-09-20 13:27:44,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:44,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-20 13:27:44,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:44,435 INFO L225 Difference]: With dead ends: 310 [2019-09-20 13:27:44,435 INFO L226 Difference]: Without dead ends: 310 [2019-09-20 13:27:44,435 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-20 13:27:44,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2019-09-20 13:27:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2019-09-20 13:27:44,441 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 93 [2019-09-20 13:27:44,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:44,442 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2019-09-20 13:27:44,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:44,442 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2019-09-20 13:27:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-20 13:27:44,443 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:44,443 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:44,444 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:44,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:44,444 INFO L82 PathProgramCache]: Analyzing trace with hash -198594821, now seen corresponding path program 1 times [2019-09-20 13:27:44,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:44,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:44,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:44,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:44,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:44,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:44,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:44,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:44,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:44,510 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2019-09-20 13:27:44,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:44,845 INFO L93 Difference]: Finished difference Result 285 states and 424 transitions. [2019-09-20 13:27:44,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:44,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-20 13:27:44,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:44,848 INFO L225 Difference]: With dead ends: 285 [2019-09-20 13:27:44,848 INFO L226 Difference]: Without dead ends: 285 [2019-09-20 13:27:44,848 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:44,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-20 13:27:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2019-09-20 13:27:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2019-09-20 13:27:44,856 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 93 [2019-09-20 13:27:44,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:44,856 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2019-09-20 13:27:44,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2019-09-20 13:27:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-20 13:27:44,858 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:44,858 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:44,858 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:44,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:44,859 INFO L82 PathProgramCache]: Analyzing trace with hash 809198717, now seen corresponding path program 1 times [2019-09-20 13:27:44,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:44,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:44,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:44,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:44,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:44,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:44,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:44,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:44,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:44,937 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2019-09-20 13:27:45,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:45,337 INFO L93 Difference]: Finished difference Result 309 states and 456 transitions. [2019-09-20 13:27:45,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:45,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-20 13:27:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:45,340 INFO L225 Difference]: With dead ends: 309 [2019-09-20 13:27:45,340 INFO L226 Difference]: Without dead ends: 309 [2019-09-20 13:27:45,340 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:45,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-20 13:27:45,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 260. [2019-09-20 13:27:45,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:45,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2019-09-20 13:27:45,347 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 94 [2019-09-20 13:27:45,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:45,347 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2019-09-20 13:27:45,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:45,347 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2019-09-20 13:27:45,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-20 13:27:45,349 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:45,349 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:45,349 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:45,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:45,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1842237124, now seen corresponding path program 1 times [2019-09-20 13:27:45,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:45,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:45,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:45,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:45,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:45,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:45,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:45,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:45,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:45,422 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2019-09-20 13:27:45,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:45,866 INFO L93 Difference]: Finished difference Result 307 states and 453 transitions. [2019-09-20 13:27:45,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:45,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-20 13:27:45,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:45,869 INFO L225 Difference]: With dead ends: 307 [2019-09-20 13:27:45,869 INFO L226 Difference]: Without dead ends: 307 [2019-09-20 13:27:45,870 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:45,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-20 13:27:45,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-20 13:27:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:45,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2019-09-20 13:27:45,877 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 94 [2019-09-20 13:27:45,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:45,877 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2019-09-20 13:27:45,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:45,877 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2019-09-20 13:27:45,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-20 13:27:45,879 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:45,879 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:45,879 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:45,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:45,880 INFO L82 PathProgramCache]: Analyzing trace with hash 456110335, now seen corresponding path program 1 times [2019-09-20 13:27:45,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:45,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:45,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:45,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:45,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:45,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:45,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:45,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:45,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:45,948 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2019-09-20 13:27:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:46,287 INFO L93 Difference]: Finished difference Result 284 states and 420 transitions. [2019-09-20 13:27:46,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:46,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-20 13:27:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:46,290 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:27:46,290 INFO L226 Difference]: Without dead ends: 284 [2019-09-20 13:27:46,291 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-20 13:27:46,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2019-09-20 13:27:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2019-09-20 13:27:46,298 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 94 [2019-09-20 13:27:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:46,299 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2019-09-20 13:27:46,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2019-09-20 13:27:46,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-20 13:27:46,300 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:46,300 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:46,300 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:46,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:46,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2099641790, now seen corresponding path program 1 times [2019-09-20 13:27:46,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:46,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:46,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:46,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:46,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:46,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:46,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:46,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:46,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:46,385 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2019-09-20 13:27:46,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:46,681 INFO L93 Difference]: Finished difference Result 282 states and 417 transitions. [2019-09-20 13:27:46,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:46,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-20 13:27:46,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:46,683 INFO L225 Difference]: With dead ends: 282 [2019-09-20 13:27:46,683 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:27:46,684 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:46,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:27:46,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-20 13:27:46,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:46,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2019-09-20 13:27:46,690 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 94 [2019-09-20 13:27:46,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:46,691 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2019-09-20 13:27:46,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:46,691 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2019-09-20 13:27:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-20 13:27:46,693 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:46,693 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:46,693 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:46,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:46,694 INFO L82 PathProgramCache]: Analyzing trace with hash 918561850, now seen corresponding path program 1 times [2019-09-20 13:27:46,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:46,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:46,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:46,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:46,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:46,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:46,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:46,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:46,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:46,756 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2019-09-20 13:27:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:47,139 INFO L93 Difference]: Finished difference Result 307 states and 450 transitions. [2019-09-20 13:27:47,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:47,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-20 13:27:47,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:47,141 INFO L225 Difference]: With dead ends: 307 [2019-09-20 13:27:47,141 INFO L226 Difference]: Without dead ends: 307 [2019-09-20 13:27:47,141 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:47,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-20 13:27:47,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-20 13:27:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:47,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2019-09-20 13:27:47,149 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 95 [2019-09-20 13:27:47,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:47,149 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2019-09-20 13:27:47,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:47,149 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2019-09-20 13:27:47,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-20 13:27:47,150 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:47,151 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:47,151 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:47,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:47,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1437243400, now seen corresponding path program 1 times [2019-09-20 13:27:47,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:47,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:47,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:47,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:47,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:47,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:47,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:47,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:47,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:47,211 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 4 states. [2019-09-20 13:27:47,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:47,514 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2019-09-20 13:27:47,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:47,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-20 13:27:47,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:47,516 INFO L225 Difference]: With dead ends: 282 [2019-09-20 13:27:47,516 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:27:47,517 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:27:47,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-20 13:27:47,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:47,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 386 transitions. [2019-09-20 13:27:47,522 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 386 transitions. Word has length 95 [2019-09-20 13:27:47,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:47,523 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 386 transitions. [2019-09-20 13:27:47,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 386 transitions. [2019-09-20 13:27:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-20 13:27:47,524 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:47,524 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:47,524 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:47,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:47,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1799405369, now seen corresponding path program 1 times [2019-09-20 13:27:47,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:47,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:47,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:47,583 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:47,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:47,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:47,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:47,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:47,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:47,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:47,584 INFO L87 Difference]: Start difference. First operand 260 states and 386 transitions. Second operand 4 states. [2019-09-20 13:27:47,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:47,933 INFO L93 Difference]: Finished difference Result 307 states and 448 transitions. [2019-09-20 13:27:47,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:47,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-20 13:27:47,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:47,936 INFO L225 Difference]: With dead ends: 307 [2019-09-20 13:27:47,936 INFO L226 Difference]: Without dead ends: 307 [2019-09-20 13:27:47,937 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:47,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-20 13:27:47,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-20 13:27:47,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:47,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 385 transitions. [2019-09-20 13:27:47,943 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 385 transitions. Word has length 96 [2019-09-20 13:27:47,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:47,943 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 385 transitions. [2019-09-20 13:27:47,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:47,944 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 385 transitions. [2019-09-20 13:27:47,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-20 13:27:47,945 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:47,945 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:47,945 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:47,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:47,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1783886651, now seen corresponding path program 1 times [2019-09-20 13:27:47,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:47,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:47,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:48,020 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:48,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:48,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:48,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:48,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:48,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:48,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:48,022 INFO L87 Difference]: Start difference. First operand 260 states and 385 transitions. Second operand 4 states. [2019-09-20 13:27:48,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:48,337 INFO L93 Difference]: Finished difference Result 282 states and 413 transitions. [2019-09-20 13:27:48,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:48,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-20 13:27:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:48,339 INFO L225 Difference]: With dead ends: 282 [2019-09-20 13:27:48,340 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:27:48,340 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:48,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:27:48,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-20 13:27:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:48,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2019-09-20 13:27:48,347 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 96 [2019-09-20 13:27:48,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:48,347 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2019-09-20 13:27:48,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:48,347 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2019-09-20 13:27:48,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-20 13:27:48,348 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:48,349 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:48,349 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:48,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:48,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2053716085, now seen corresponding path program 1 times [2019-09-20 13:27:48,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:48,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:48,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:48,411 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:48,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:48,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:48,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:48,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:48,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:48,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:48,413 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand 4 states. [2019-09-20 13:27:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:48,757 INFO L93 Difference]: Finished difference Result 307 states and 446 transitions. [2019-09-20 13:27:48,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:48,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-20 13:27:48,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:48,760 INFO L225 Difference]: With dead ends: 307 [2019-09-20 13:27:48,760 INFO L226 Difference]: Without dead ends: 307 [2019-09-20 13:27:48,761 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:48,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-20 13:27:48,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-20 13:27:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2019-09-20 13:27:48,767 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 97 [2019-09-20 13:27:48,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:48,768 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2019-09-20 13:27:48,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:48,768 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2019-09-20 13:27:48,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-20 13:27:48,769 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:48,769 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:48,769 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:48,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:48,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1572635827, now seen corresponding path program 1 times [2019-09-20 13:27:48,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:48,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:48,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:48,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:48,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:48,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:48,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:48,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:48,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:48,845 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand 4 states. [2019-09-20 13:27:49,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,134 INFO L93 Difference]: Finished difference Result 282 states and 411 transitions. [2019-09-20 13:27:49,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:49,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-20 13:27:49,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,137 INFO L225 Difference]: With dead ends: 282 [2019-09-20 13:27:49,137 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:27:49,138 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:27:49,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-20 13:27:49,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2019-09-20 13:27:49,143 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 97 [2019-09-20 13:27:49,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:49,144 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2019-09-20 13:27:49,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:49,144 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2019-09-20 13:27:49,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-20 13:27:49,145 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:49,145 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:49,145 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:49,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:49,146 INFO L82 PathProgramCache]: Analyzing trace with hash 65379092, now seen corresponding path program 1 times [2019-09-20 13:27:49,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:49,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:49,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:49,222 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:49,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:49,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:49,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:49,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:49,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:49,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,224 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand 4 states. [2019-09-20 13:27:49,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,561 INFO L93 Difference]: Finished difference Result 297 states and 432 transitions. [2019-09-20 13:27:49,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:49,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-20 13:27:49,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,564 INFO L225 Difference]: With dead ends: 297 [2019-09-20 13:27:49,565 INFO L226 Difference]: Without dead ends: 297 [2019-09-20 13:27:49,565 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-20 13:27:49,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 260. [2019-09-20 13:27:49,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:49,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 381 transitions. [2019-09-20 13:27:49,571 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 381 transitions. Word has length 98 [2019-09-20 13:27:49,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:49,571 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 381 transitions. [2019-09-20 13:27:49,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:49,571 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 381 transitions. [2019-09-20 13:27:49,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-20 13:27:49,572 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:49,573 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:49,573 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:49,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:49,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1963207018, now seen corresponding path program 1 times [2019-09-20 13:27:49,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:49,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:49,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:49,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:49,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:49,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:49,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:49,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:49,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,648 INFO L87 Difference]: Start difference. First operand 260 states and 381 transitions. Second operand 4 states. [2019-09-20 13:27:49,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,934 INFO L93 Difference]: Finished difference Result 272 states and 397 transitions. [2019-09-20 13:27:49,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:49,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-20 13:27:49,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,937 INFO L225 Difference]: With dead ends: 272 [2019-09-20 13:27:49,937 INFO L226 Difference]: Without dead ends: 272 [2019-09-20 13:27:49,937 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:49,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-20 13:27:49,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2019-09-20 13:27:49,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 380 transitions. [2019-09-20 13:27:49,945 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 380 transitions. Word has length 98 [2019-09-20 13:27:49,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:49,947 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 380 transitions. [2019-09-20 13:27:49,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:49,948 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2019-09-20 13:27:49,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:27:49,949 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:49,949 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:49,950 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:49,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:49,950 INFO L82 PathProgramCache]: Analyzing trace with hash 445820602, now seen corresponding path program 1 times [2019-09-20 13:27:49,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:49,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:49,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:50,031 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:50,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:50,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:50,032 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:50,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:50,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:50,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:50,033 INFO L87 Difference]: Start difference. First operand 260 states and 380 transitions. Second operand 4 states. [2019-09-20 13:27:50,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:50,367 INFO L93 Difference]: Finished difference Result 297 states and 430 transitions. [2019-09-20 13:27:50,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:50,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:27:50,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:50,370 INFO L225 Difference]: With dead ends: 297 [2019-09-20 13:27:50,370 INFO L226 Difference]: Without dead ends: 297 [2019-09-20 13:27:50,370 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:50,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-20 13:27:50,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 260. [2019-09-20 13:27:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:50,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 379 transitions. [2019-09-20 13:27:50,376 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 379 transitions. Word has length 102 [2019-09-20 13:27:50,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:50,377 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 379 transitions. [2019-09-20 13:27:50,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 379 transitions. [2019-09-20 13:27:50,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:27:50,378 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:50,378 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:50,378 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:50,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:50,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1832606012, now seen corresponding path program 1 times [2019-09-20 13:27:50,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:50,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:50,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:50,483 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-20 13:27:50,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:50,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:50,484 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:50,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:50,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:50,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:50,485 INFO L87 Difference]: Start difference. First operand 260 states and 379 transitions. Second operand 3 states. [2019-09-20 13:27:50,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:50,525 INFO L93 Difference]: Finished difference Result 493 states and 723 transitions. [2019-09-20 13:27:50,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:50,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-20 13:27:50,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:50,528 INFO L225 Difference]: With dead ends: 493 [2019-09-20 13:27:50,528 INFO L226 Difference]: Without dead ends: 493 [2019-09-20 13:27:50,528 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:50,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-20 13:27:50,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-09-20 13:27:50,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-09-20 13:27:50,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 723 transitions. [2019-09-20 13:27:50,536 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 723 transitions. Word has length 102 [2019-09-20 13:27:50,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:50,537 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 723 transitions. [2019-09-20 13:27:50,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:50,537 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 723 transitions. [2019-09-20 13:27:50,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:50,538 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:50,538 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:50,538 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:50,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:50,539 INFO L82 PathProgramCache]: Analyzing trace with hash 881301798, now seen corresponding path program 1 times [2019-09-20 13:27:50,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:50,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:50,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:50,597 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:50,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:50,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:50,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:50,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:50,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:50,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:50,598 INFO L87 Difference]: Start difference. First operand 493 states and 723 transitions. Second operand 3 states. [2019-09-20 13:27:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:50,638 INFO L93 Difference]: Finished difference Result 728 states and 1072 transitions. [2019-09-20 13:27:50,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:50,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-20 13:27:50,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:50,641 INFO L225 Difference]: With dead ends: 728 [2019-09-20 13:27:50,642 INFO L226 Difference]: Without dead ends: 728 [2019-09-20 13:27:50,642 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:50,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-09-20 13:27:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2019-09-20 13:27:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-09-20 13:27:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1071 transitions. [2019-09-20 13:27:50,653 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1071 transitions. Word has length 104 [2019-09-20 13:27:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:50,654 INFO L475 AbstractCegarLoop]: Abstraction has 726 states and 1071 transitions. [2019-09-20 13:27:50,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1071 transitions. [2019-09-20 13:27:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-20 13:27:50,656 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:50,656 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:50,656 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:50,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:50,656 INFO L82 PathProgramCache]: Analyzing trace with hash -508111036, now seen corresponding path program 1 times [2019-09-20 13:27:50,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:50,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:50,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:50,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:50,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:50,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:50,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:50,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:50,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:50,725 INFO L87 Difference]: Start difference. First operand 726 states and 1071 transitions. Second operand 3 states. [2019-09-20 13:27:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:50,779 INFO L93 Difference]: Finished difference Result 961 states and 1406 transitions. [2019-09-20 13:27:50,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:50,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-20 13:27:50,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:50,783 INFO L225 Difference]: With dead ends: 961 [2019-09-20 13:27:50,783 INFO L226 Difference]: Without dead ends: 961 [2019-09-20 13:27:50,784 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-09-20 13:27:50,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2019-09-20 13:27:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-09-20 13:27:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1405 transitions. [2019-09-20 13:27:50,798 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1405 transitions. Word has length 110 [2019-09-20 13:27:50,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:50,799 INFO L475 AbstractCegarLoop]: Abstraction has 959 states and 1405 transitions. [2019-09-20 13:27:50,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:50,799 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1405 transitions. [2019-09-20 13:27:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-20 13:27:50,801 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:50,802 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:50,802 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:50,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:50,802 INFO L82 PathProgramCache]: Analyzing trace with hash 340355395, now seen corresponding path program 1 times [2019-09-20 13:27:50,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:50,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:50,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:50,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:50,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:50,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:50,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:50,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:50,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:50,876 INFO L87 Difference]: Start difference. First operand 959 states and 1405 transitions. Second operand 4 states. [2019-09-20 13:27:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:51,336 INFO L93 Difference]: Finished difference Result 1369 states and 2020 transitions. [2019-09-20 13:27:51,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:51,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-20 13:27:51,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:51,344 INFO L225 Difference]: With dead ends: 1369 [2019-09-20 13:27:51,344 INFO L226 Difference]: Without dead ends: 1369 [2019-09-20 13:27:51,344 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:51,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2019-09-20 13:27:51,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1115. [2019-09-20 13:27:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-09-20 13:27:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1689 transitions. [2019-09-20 13:27:51,363 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1689 transitions. Word has length 127 [2019-09-20 13:27:51,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:51,363 INFO L475 AbstractCegarLoop]: Abstraction has 1115 states and 1689 transitions. [2019-09-20 13:27:51,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:51,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1689 transitions. [2019-09-20 13:27:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-20 13:27:51,365 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:51,366 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:51,366 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:51,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:51,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1954075331, now seen corresponding path program 1 times [2019-09-20 13:27:51,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:51,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:51,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:51,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:51,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:51,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:51,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:51,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:51,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:51,455 INFO L87 Difference]: Start difference. First operand 1115 states and 1689 transitions. Second operand 4 states. [2019-09-20 13:27:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:51,909 INFO L93 Difference]: Finished difference Result 1351 states and 1994 transitions. [2019-09-20 13:27:51,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:51,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-20 13:27:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:51,915 INFO L225 Difference]: With dead ends: 1351 [2019-09-20 13:27:51,915 INFO L226 Difference]: Without dead ends: 1351 [2019-09-20 13:27:51,915 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-09-20 13:27:51,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1075. [2019-09-20 13:27:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-09-20 13:27:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1613 transitions. [2019-09-20 13:27:51,933 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1613 transitions. Word has length 128 [2019-09-20 13:27:51,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:51,934 INFO L475 AbstractCegarLoop]: Abstraction has 1075 states and 1613 transitions. [2019-09-20 13:27:51,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:51,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1613 transitions. [2019-09-20 13:27:51,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-20 13:27:51,936 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:51,937 INFO L407 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] [2019-09-20 13:27:51,937 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:51,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:51,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1490307687, now seen corresponding path program 1 times [2019-09-20 13:27:51,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:51,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:51,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:52,011 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-20 13:27:52,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:52,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:52,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:52,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:52,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:52,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:52,013 INFO L87 Difference]: Start difference. First operand 1075 states and 1613 transitions. Second operand 3 states. [2019-09-20 13:27:52,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:52,056 INFO L93 Difference]: Finished difference Result 1339 states and 2008 transitions. [2019-09-20 13:27:52,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:52,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-09-20 13:27:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:52,066 INFO L225 Difference]: With dead ends: 1339 [2019-09-20 13:27:52,066 INFO L226 Difference]: Without dead ends: 1339 [2019-09-20 13:27:52,067 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:52,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-09-20 13:27:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2019-09-20 13:27:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:27:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2007 transitions. [2019-09-20 13:27:52,088 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2007 transitions. Word has length 133 [2019-09-20 13:27:52,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:52,089 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 2007 transitions. [2019-09-20 13:27:52,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:52,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2007 transitions. [2019-09-20 13:27:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-20 13:27:52,092 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:52,093 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2019-09-20 13:27:52,093 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:52,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:52,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1260334381, now seen corresponding path program 1 times [2019-09-20 13:27:52,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:52,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:52,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:52,179 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:52,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:52,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:52,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:52,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:52,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:52,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:52,180 INFO L87 Difference]: Start difference. First operand 1337 states and 2007 transitions. Second operand 4 states. [2019-09-20 13:27:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:52,640 INFO L93 Difference]: Finished difference Result 1682 states and 2477 transitions. [2019-09-20 13:27:52,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:52,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-20 13:27:52,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:52,647 INFO L225 Difference]: With dead ends: 1682 [2019-09-20 13:27:52,648 INFO L226 Difference]: Without dead ends: 1682 [2019-09-20 13:27:52,648 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:52,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2019-09-20 13:27:52,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1337. [2019-09-20 13:27:52,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:27:52,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2002 transitions. [2019-09-20 13:27:52,668 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2002 transitions. Word has length 140 [2019-09-20 13:27:52,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:52,669 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 2002 transitions. [2019-09-20 13:27:52,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2002 transitions. [2019-09-20 13:27:52,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-20 13:27:52,672 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:52,672 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-09-20 13:27:52,672 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:52,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:52,673 INFO L82 PathProgramCache]: Analyzing trace with hash -950685943, now seen corresponding path program 1 times [2019-09-20 13:27:52,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:52,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:52,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:52,748 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:52,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:52,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:52,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:52,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:52,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:52,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:52,750 INFO L87 Difference]: Start difference. First operand 1337 states and 2002 transitions. Second operand 4 states. [2019-09-20 13:27:53,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:53,182 INFO L93 Difference]: Finished difference Result 1677 states and 2467 transitions. [2019-09-20 13:27:53,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:53,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-20 13:27:53,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:53,190 INFO L225 Difference]: With dead ends: 1677 [2019-09-20 13:27:53,190 INFO L226 Difference]: Without dead ends: 1677 [2019-09-20 13:27:53,191 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2019-09-20 13:27:53,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1337. [2019-09-20 13:27:53,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:27:53,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1997 transitions. [2019-09-20 13:27:53,210 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1997 transitions. Word has length 141 [2019-09-20 13:27:53,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:53,210 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1997 transitions. [2019-09-20 13:27:53,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:53,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1997 transitions. [2019-09-20 13:27:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-20 13:27:53,213 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:53,213 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-09-20 13:27:53,213 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:53,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:53,214 INFO L82 PathProgramCache]: Analyzing trace with hash 707342472, now seen corresponding path program 1 times [2019-09-20 13:27:53,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:53,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:53,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:53,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:53,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:53,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:53,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:53,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:53,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:53,295 INFO L87 Difference]: Start difference. First operand 1337 states and 1997 transitions. Second operand 4 states. [2019-09-20 13:27:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:53,736 INFO L93 Difference]: Finished difference Result 1667 states and 2452 transitions. [2019-09-20 13:27:53,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:53,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-20 13:27:53,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:53,743 INFO L225 Difference]: With dead ends: 1667 [2019-09-20 13:27:53,743 INFO L226 Difference]: Without dead ends: 1667 [2019-09-20 13:27:53,744 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:53,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-20 13:27:53,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-20 13:27:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:27:53,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1992 transitions. [2019-09-20 13:27:53,762 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1992 transitions. Word has length 141 [2019-09-20 13:27:53,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:53,762 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1992 transitions. [2019-09-20 13:27:53,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1992 transitions. [2019-09-20 13:27:53,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-20 13:27:53,765 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:53,765 INFO L407 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] [2019-09-20 13:27:53,765 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:53,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:53,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1800130410, now seen corresponding path program 1 times [2019-09-20 13:27:53,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:53,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:53,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:53,843 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-20 13:27:53,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:53,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:53,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:53,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:53,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:53,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:53,846 INFO L87 Difference]: Start difference. First operand 1337 states and 1992 transitions. Second operand 4 states. [2019-09-20 13:27:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:54,275 INFO L93 Difference]: Finished difference Result 1667 states and 2447 transitions. [2019-09-20 13:27:54,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:54,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-20 13:27:54,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:54,284 INFO L225 Difference]: With dead ends: 1667 [2019-09-20 13:27:54,284 INFO L226 Difference]: Without dead ends: 1667 [2019-09-20 13:27:54,284 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:54,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-20 13:27:54,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-20 13:27:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:27:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1987 transitions. [2019-09-20 13:27:54,303 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1987 transitions. Word has length 142 [2019-09-20 13:27:54,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:54,303 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1987 transitions. [2019-09-20 13:27:54,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1987 transitions. [2019-09-20 13:27:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-20 13:27:54,305 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:54,306 INFO L407 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] [2019-09-20 13:27:54,306 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:54,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:54,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1021270341, now seen corresponding path program 1 times [2019-09-20 13:27:54,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:54,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:54,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:54,373 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-20 13:27:54,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:54,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:54,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:54,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:54,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:54,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:54,374 INFO L87 Difference]: Start difference. First operand 1337 states and 1987 transitions. Second operand 4 states. [2019-09-20 13:27:54,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:54,831 INFO L93 Difference]: Finished difference Result 1667 states and 2442 transitions. [2019-09-20 13:27:54,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:54,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-20 13:27:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:54,839 INFO L225 Difference]: With dead ends: 1667 [2019-09-20 13:27:54,839 INFO L226 Difference]: Without dead ends: 1667 [2019-09-20 13:27:54,839 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:54,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-20 13:27:54,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-20 13:27:54,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:27:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1982 transitions. [2019-09-20 13:27:54,852 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1982 transitions. Word has length 143 [2019-09-20 13:27:54,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:54,852 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1982 transitions. [2019-09-20 13:27:54,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:54,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1982 transitions. [2019-09-20 13:27:54,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-20 13:27:54,855 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:54,855 INFO L407 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] [2019-09-20 13:27:54,855 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:54,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:54,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1024642789, now seen corresponding path program 1 times [2019-09-20 13:27:54,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:54,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:54,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:54,923 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-20 13:27:54,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:54,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:54,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:54,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:54,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:54,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:54,928 INFO L87 Difference]: Start difference. First operand 1337 states and 1982 transitions. Second operand 4 states. [2019-09-20 13:27:55,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:55,353 INFO L93 Difference]: Finished difference Result 1667 states and 2437 transitions. [2019-09-20 13:27:55,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:55,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-09-20 13:27:55,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:55,361 INFO L225 Difference]: With dead ends: 1667 [2019-09-20 13:27:55,362 INFO L226 Difference]: Without dead ends: 1667 [2019-09-20 13:27:55,362 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:55,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-20 13:27:55,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-20 13:27:55,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:27:55,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1977 transitions. [2019-09-20 13:27:55,379 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1977 transitions. Word has length 144 [2019-09-20 13:27:55,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:55,380 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1977 transitions. [2019-09-20 13:27:55,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:55,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1977 transitions. [2019-09-20 13:27:55,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-20 13:27:55,382 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:55,382 INFO L407 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] [2019-09-20 13:27:55,383 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:55,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:55,383 INFO L82 PathProgramCache]: Analyzing trace with hash -492580512, now seen corresponding path program 1 times [2019-09-20 13:27:55,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:55,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:55,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:55,454 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-20 13:27:55,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:55,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:55,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:55,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:55,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:55,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:55,456 INFO L87 Difference]: Start difference. First operand 1337 states and 1977 transitions. Second operand 4 states. [2019-09-20 13:27:55,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:55,850 INFO L93 Difference]: Finished difference Result 1617 states and 2372 transitions. [2019-09-20 13:27:55,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:55,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-20 13:27:55,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:55,855 INFO L225 Difference]: With dead ends: 1617 [2019-09-20 13:27:55,855 INFO L226 Difference]: Without dead ends: 1617 [2019-09-20 13:27:55,856 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:55,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-09-20 13:27:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1337. [2019-09-20 13:27:55,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:27:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1972 transitions. [2019-09-20 13:27:55,873 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1972 transitions. Word has length 145 [2019-09-20 13:27:55,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:55,873 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1972 transitions. [2019-09-20 13:27:55,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1972 transitions. [2019-09-20 13:27:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-20 13:27:55,875 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:55,875 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2019-09-20 13:27:55,876 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:55,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:55,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1212937850, now seen corresponding path program 1 times [2019-09-20 13:27:55,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:55,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:55,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:55,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:55,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:55,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:55,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:55,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:55,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:55,975 INFO L87 Difference]: Start difference. First operand 1337 states and 1972 transitions. Second operand 4 states. [2019-09-20 13:27:56,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:56,386 INFO L93 Difference]: Finished difference Result 1617 states and 2367 transitions. [2019-09-20 13:27:56,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:56,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-09-20 13:27:56,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:56,389 INFO L225 Difference]: With dead ends: 1617 [2019-09-20 13:27:56,390 INFO L226 Difference]: Without dead ends: 1617 [2019-09-20 13:27:56,390 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:56,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-09-20 13:27:56,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1337. [2019-09-20 13:27:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:27:56,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1967 transitions. [2019-09-20 13:27:56,405 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1967 transitions. Word has length 149 [2019-09-20 13:27:56,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:56,405 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1967 transitions. [2019-09-20 13:27:56,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:56,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1967 transitions. [2019-09-20 13:27:56,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-20 13:27:56,407 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:56,407 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2019-09-20 13:27:56,407 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:56,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:56,408 INFO L82 PathProgramCache]: Analyzing trace with hash 338308875, now seen corresponding path program 1 times [2019-09-20 13:27:56,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:56,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:56,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:56,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:56,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:56,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:56,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:56,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:56,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:56,481 INFO L87 Difference]: Start difference. First operand 1337 states and 1967 transitions. Second operand 4 states. [2019-09-20 13:27:56,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:56,887 INFO L93 Difference]: Finished difference Result 1592 states and 2330 transitions. [2019-09-20 13:27:56,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:56,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-20 13:27:56,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:56,890 INFO L225 Difference]: With dead ends: 1592 [2019-09-20 13:27:56,890 INFO L226 Difference]: Without dead ends: 1592 [2019-09-20 13:27:56,890 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:56,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2019-09-20 13:27:56,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1337. [2019-09-20 13:27:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:27:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1962 transitions. [2019-09-20 13:27:56,907 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1962 transitions. Word has length 150 [2019-09-20 13:27:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:56,908 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1962 transitions. [2019-09-20 13:27:56,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:56,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1962 transitions. [2019-09-20 13:27:56,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-20 13:27:56,910 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:56,910 INFO L407 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] [2019-09-20 13:27:56,911 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:56,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:56,911 INFO L82 PathProgramCache]: Analyzing trace with hash 582401643, now seen corresponding path program 1 times [2019-09-20 13:27:56,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:56,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:56,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:57,006 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-20 13:27:57,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:57,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:57,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:57,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:57,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:57,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:57,008 INFO L87 Difference]: Start difference. First operand 1337 states and 1962 transitions. Second operand 4 states. [2019-09-20 13:27:57,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:57,444 INFO L93 Difference]: Finished difference Result 1592 states and 2325 transitions. [2019-09-20 13:27:57,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:57,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-20 13:27:57,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:57,448 INFO L225 Difference]: With dead ends: 1592 [2019-09-20 13:27:57,448 INFO L226 Difference]: Without dead ends: 1592 [2019-09-20 13:27:57,448 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2019-09-20 13:27:57,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1337. [2019-09-20 13:27:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:27:57,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1957 transitions. [2019-09-20 13:27:57,469 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1957 transitions. Word has length 152 [2019-09-20 13:27:57,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:57,469 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1957 transitions. [2019-09-20 13:27:57,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:57,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1957 transitions. [2019-09-20 13:27:57,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-20 13:27:57,475 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:57,475 INFO L407 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] [2019-09-20 13:27:57,476 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:57,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:57,477 INFO L82 PathProgramCache]: Analyzing trace with hash 226930054, now seen corresponding path program 1 times [2019-09-20 13:27:57,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:57,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:57,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:57,572 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-20 13:27:57,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:57,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:57,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:57,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:57,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:57,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:57,573 INFO L87 Difference]: Start difference. First operand 1337 states and 1957 transitions. Second operand 4 states. [2019-09-20 13:27:57,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:57,965 INFO L93 Difference]: Finished difference Result 1552 states and 2255 transitions. [2019-09-20 13:27:57,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:57,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-20 13:27:57,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:57,969 INFO L225 Difference]: With dead ends: 1552 [2019-09-20 13:27:57,969 INFO L226 Difference]: Without dead ends: 1552 [2019-09-20 13:27:57,969 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-09-20 13:27:57,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1317. [2019-09-20 13:27:57,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2019-09-20 13:27:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1922 transitions. [2019-09-20 13:27:57,984 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1922 transitions. Word has length 153 [2019-09-20 13:27:57,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:57,984 INFO L475 AbstractCegarLoop]: Abstraction has 1317 states and 1922 transitions. [2019-09-20 13:27:57,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1922 transitions. [2019-09-20 13:27:57,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-20 13:27:57,987 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:57,987 INFO L407 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:57,987 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:57,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:57,988 INFO L82 PathProgramCache]: Analyzing trace with hash -955663798, now seen corresponding path program 1 times [2019-09-20 13:27:57,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:57,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:57,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:58,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:58,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:58,071 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:58,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:58,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:58,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:58,072 INFO L87 Difference]: Start difference. First operand 1317 states and 1922 transitions. Second operand 4 states. [2019-09-20 13:27:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:58,436 INFO L93 Difference]: Finished difference Result 1552 states and 2250 transitions. [2019-09-20 13:27:58,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:58,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-20 13:27:58,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:58,441 INFO L225 Difference]: With dead ends: 1552 [2019-09-20 13:27:58,441 INFO L226 Difference]: Without dead ends: 1552 [2019-09-20 13:27:58,442 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:58,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-09-20 13:27:58,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1342. [2019-09-20 13:27:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-09-20 13:27:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1957 transitions. [2019-09-20 13:27:58,458 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1957 transitions. Word has length 154 [2019-09-20 13:27:58,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:58,458 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 1957 transitions. [2019-09-20 13:27:58,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:58,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1957 transitions. [2019-09-20 13:27:58,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-20 13:27:58,461 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:58,461 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2019-09-20 13:27:58,461 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:58,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:58,461 INFO L82 PathProgramCache]: Analyzing trace with hash -943372069, now seen corresponding path program 1 times [2019-09-20 13:27:58,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:58,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:58,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:58,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:58,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:58,547 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:58,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:58,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:58,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:58,548 INFO L87 Difference]: Start difference. First operand 1342 states and 1957 transitions. Second operand 4 states. [2019-09-20 13:27:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:58,917 INFO L93 Difference]: Finished difference Result 1552 states and 2245 transitions. [2019-09-20 13:27:58,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:58,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-20 13:27:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:58,922 INFO L225 Difference]: With dead ends: 1552 [2019-09-20 13:27:58,923 INFO L226 Difference]: Without dead ends: 1552 [2019-09-20 13:27:58,923 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:58,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-09-20 13:27:58,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1342. [2019-09-20 13:27:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-09-20 13:27:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1952 transitions. [2019-09-20 13:27:58,939 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1952 transitions. Word has length 155 [2019-09-20 13:27:58,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:58,940 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 1952 transitions. [2019-09-20 13:27:58,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:58,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1952 transitions. [2019-09-20 13:27:58,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-20 13:27:58,942 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:58,943 INFO L407 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:58,943 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:58,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:58,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1336878587, now seen corresponding path program 1 times [2019-09-20 13:27:58,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:58,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:58,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:59,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:59,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:59,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:59,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:59,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:59,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:59,028 INFO L87 Difference]: Start difference. First operand 1342 states and 1952 transitions. Second operand 4 states. [2019-09-20 13:27:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:59,392 INFO L93 Difference]: Finished difference Result 1542 states and 2230 transitions. [2019-09-20 13:27:59,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:59,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-20 13:27:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:59,396 INFO L225 Difference]: With dead ends: 1542 [2019-09-20 13:27:59,397 INFO L226 Difference]: Without dead ends: 1542 [2019-09-20 13:27:59,397 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-09-20 13:27:59,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1347. [2019-09-20 13:27:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-09-20 13:27:59,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1957 transitions. [2019-09-20 13:27:59,413 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1957 transitions. Word has length 155 [2019-09-20 13:27:59,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:59,413 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 1957 transitions. [2019-09-20 13:27:59,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:59,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1957 transitions. [2019-09-20 13:27:59,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-20 13:27:59,415 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:59,416 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2019-09-20 13:27:59,416 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:59,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:59,416 INFO L82 PathProgramCache]: Analyzing trace with hash -631109824, now seen corresponding path program 1 times [2019-09-20 13:27:59,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:59,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:59,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:59,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:59,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:59,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:59,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:59,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:59,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:59,510 INFO L87 Difference]: Start difference. First operand 1347 states and 1957 transitions. Second operand 4 states. [2019-09-20 13:27:59,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:59,898 INFO L93 Difference]: Finished difference Result 1532 states and 2210 transitions. [2019-09-20 13:27:59,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:59,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-20 13:27:59,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:59,904 INFO L225 Difference]: With dead ends: 1532 [2019-09-20 13:27:59,904 INFO L226 Difference]: Without dead ends: 1532 [2019-09-20 13:27:59,904 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-09-20 13:27:59,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1347. [2019-09-20 13:27:59,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-09-20 13:27:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1952 transitions. [2019-09-20 13:27:59,920 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1952 transitions. Word has length 156 [2019-09-20 13:27:59,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:59,921 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 1952 transitions. [2019-09-20 13:27:59,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:59,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1952 transitions. [2019-09-20 13:27:59,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-20 13:27:59,923 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:59,923 INFO L407 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] [2019-09-20 13:27:59,924 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:59,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:59,924 INFO L82 PathProgramCache]: Analyzing trace with hash 616877608, now seen corresponding path program 1 times [2019-09-20 13:27:59,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:59,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:59,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:00,006 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-20 13:28:00,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:00,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:00,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:00,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:00,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:00,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:00,008 INFO L87 Difference]: Start difference. First operand 1347 states and 1952 transitions. Second operand 4 states. [2019-09-20 13:28:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:00,338 INFO L93 Difference]: Finished difference Result 1517 states and 2185 transitions. [2019-09-20 13:28:00,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:00,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-20 13:28:00,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:00,343 INFO L225 Difference]: With dead ends: 1517 [2019-09-20 13:28:00,344 INFO L226 Difference]: Without dead ends: 1517 [2019-09-20 13:28:00,344 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:00,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-09-20 13:28:00,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1352. [2019-09-20 13:28:00,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-09-20 13:28:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1957 transitions. [2019-09-20 13:28:00,364 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1957 transitions. Word has length 156 [2019-09-20 13:28:00,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:00,365 INFO L475 AbstractCegarLoop]: Abstraction has 1352 states and 1957 transitions. [2019-09-20 13:28:00,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1957 transitions. [2019-09-20 13:28:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-20 13:28:00,367 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:00,368 INFO L407 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] [2019-09-20 13:28:00,369 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:00,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:00,369 INFO L82 PathProgramCache]: Analyzing trace with hash -680355751, now seen corresponding path program 1 times [2019-09-20 13:28:00,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:00,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:00,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:00,448 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-20 13:28:00,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:00,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:00,448 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:00,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:00,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:00,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:00,449 INFO L87 Difference]: Start difference. First operand 1352 states and 1957 transitions. Second operand 4 states. [2019-09-20 13:28:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:00,770 INFO L93 Difference]: Finished difference Result 1517 states and 2180 transitions. [2019-09-20 13:28:00,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:00,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-20 13:28:00,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:00,774 INFO L225 Difference]: With dead ends: 1517 [2019-09-20 13:28:00,775 INFO L226 Difference]: Without dead ends: 1517 [2019-09-20 13:28:00,775 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:00,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-09-20 13:28:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1357. [2019-09-20 13:28:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2019-09-20 13:28:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1962 transitions. [2019-09-20 13:28:00,791 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1962 transitions. Word has length 158 [2019-09-20 13:28:00,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:00,791 INFO L475 AbstractCegarLoop]: Abstraction has 1357 states and 1962 transitions. [2019-09-20 13:28:00,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:00,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1962 transitions. [2019-09-20 13:28:00,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-20 13:28:00,793 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:00,794 INFO L407 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] [2019-09-20 13:28:00,794 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:00,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:00,794 INFO L82 PathProgramCache]: Analyzing trace with hash -490771207, now seen corresponding path program 1 times [2019-09-20 13:28:00,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:00,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:00,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:00,874 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-20 13:28:00,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:00,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:00,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:00,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:00,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:00,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:00,876 INFO L87 Difference]: Start difference. First operand 1357 states and 1962 transitions. Second operand 4 states. [2019-09-20 13:28:01,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:01,200 INFO L93 Difference]: Finished difference Result 1497 states and 2150 transitions. [2019-09-20 13:28:01,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:01,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-20 13:28:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:01,202 INFO L225 Difference]: With dead ends: 1497 [2019-09-20 13:28:01,203 INFO L226 Difference]: Without dead ends: 1497 [2019-09-20 13:28:01,203 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:01,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2019-09-20 13:28:01,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1362. [2019-09-20 13:28:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-09-20 13:28:01,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1967 transitions. [2019-09-20 13:28:01,215 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1967 transitions. Word has length 159 [2019-09-20 13:28:01,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:01,215 INFO L475 AbstractCegarLoop]: Abstraction has 1362 states and 1967 transitions. [2019-09-20 13:28:01,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:01,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1967 transitions. [2019-09-20 13:28:01,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-20 13:28:01,217 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:01,217 INFO L407 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] [2019-09-20 13:28:01,217 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:01,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:01,217 INFO L82 PathProgramCache]: Analyzing trace with hash 888709627, now seen corresponding path program 1 times [2019-09-20 13:28:01,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:01,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:01,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:01,298 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-20 13:28:01,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:01,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:01,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:01,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:01,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:01,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:01,299 INFO L87 Difference]: Start difference. First operand 1362 states and 1967 transitions. Second operand 4 states. [2019-09-20 13:28:01,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:01,652 INFO L93 Difference]: Finished difference Result 1497 states and 2145 transitions. [2019-09-20 13:28:01,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:01,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-20 13:28:01,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:01,654 INFO L225 Difference]: With dead ends: 1497 [2019-09-20 13:28:01,654 INFO L226 Difference]: Without dead ends: 1497 [2019-09-20 13:28:01,654 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2019-09-20 13:28:01,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1367. [2019-09-20 13:28:01,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2019-09-20 13:28:01,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1972 transitions. [2019-09-20 13:28:01,670 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1972 transitions. Word has length 159 [2019-09-20 13:28:01,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:01,671 INFO L475 AbstractCegarLoop]: Abstraction has 1367 states and 1972 transitions. [2019-09-20 13:28:01,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:01,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1972 transitions. [2019-09-20 13:28:01,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-20 13:28:01,673 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:01,673 INFO L407 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] [2019-09-20 13:28:01,674 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:01,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:01,674 INFO L82 PathProgramCache]: Analyzing trace with hash 100461755, now seen corresponding path program 1 times [2019-09-20 13:28:01,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:01,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:01,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:01,770 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-20 13:28:01,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:01,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:01,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:01,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:01,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:01,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:01,773 INFO L87 Difference]: Start difference. First operand 1367 states and 1972 transitions. Second operand 4 states.