java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_srvr.blast.10.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:38,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:38,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:38,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:38,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:38,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:38,075 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:38,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:38,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:38,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:38,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:38,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:38,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:38,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:38,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:38,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:38,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:38,086 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:38,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:38,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:38,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:38,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:38,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:38,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:38,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:38,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:38,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:38,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:38,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:38,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:38,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:38,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:38,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:38,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:38,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:38,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:38,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:38,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:38,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:38,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:38,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:38,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:27:38,120 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:38,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:38,121 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:38,121 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:38,122 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:38,122 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:38,122 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:38,123 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:38,123 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:38,123 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:38,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:38,124 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:38,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:38,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:38,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:38,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:38,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:38,125 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:38,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:38,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:38,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:38,126 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:38,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:38,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:38,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:38,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:38,127 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:38,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:38,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:38,128 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:38,157 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:38,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:38,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:38,176 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:38,176 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:38,177 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.10.i.cil-1.c [2019-09-20 13:27:38,242 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8661dd037/7d4d2deeccea47558e8e59f9ec5f8120/FLAG7bdb966c4 [2019-09-20 13:27:38,820 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:38,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.10.i.cil-1.c [2019-09-20 13:27:38,847 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8661dd037/7d4d2deeccea47558e8e59f9ec5f8120/FLAG7bdb966c4 [2019-09-20 13:27:39,089 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8661dd037/7d4d2deeccea47558e8e59f9ec5f8120 [2019-09-20 13:27:39,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:39,100 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:39,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:39,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:39,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:39,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:39" (1/1) ... [2019-09-20 13:27:39,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d400030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:39, skipping insertion in model container [2019-09-20 13:27:39,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:39" (1/1) ... [2019-09-20 13:27:39,117 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:39,173 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:39,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:39,843 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:40,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:40,046 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:40,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40 WrapperNode [2019-09-20 13:27:40,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:40,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:40,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:40,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:40,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40" (1/1) ... [2019-09-20 13:27:40,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40" (1/1) ... [2019-09-20 13:27:40,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40" (1/1) ... [2019-09-20 13:27:40,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40" (1/1) ... [2019-09-20 13:27:40,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40" (1/1) ... [2019-09-20 13:27:40,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40" (1/1) ... [2019-09-20 13:27:40,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40" (1/1) ... [2019-09-20 13:27:40,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:40,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:40,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:40,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:40,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:40,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:40,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:40,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:27:40,283 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:27:40,283 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:40,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:27:40,283 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:40,284 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:40,284 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:40,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:40,284 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:40,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:40,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:40,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:40,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:40,285 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:40,285 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:27:40,285 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:40,286 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:27:40,286 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:27:40,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:40,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:40,286 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:40,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:40,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:40,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:40,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:40,287 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:40,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:40,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:40,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:40,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:40,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:40,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:40,787 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:41,464 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:27:41,465 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:27:41,486 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:41,487 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:41,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:41 BoogieIcfgContainer [2019-09-20 13:27:41,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:41,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:41,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:41,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:41,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:39" (1/3) ... [2019-09-20 13:27:41,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473bbbdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:41, skipping insertion in model container [2019-09-20 13:27:41,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:40" (2/3) ... [2019-09-20 13:27:41,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473bbbdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:41, skipping insertion in model container [2019-09-20 13:27:41,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:41" (3/3) ... [2019-09-20 13:27:41,497 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-1.c [2019-09-20 13:27:41,509 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:41,520 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:41,539 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:41,572 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:41,572 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:41,573 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:41,573 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:41,573 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:41,573 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:41,573 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:41,574 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:41,600 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2019-09-20 13:27:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-20 13:27:41,623 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:41,625 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:41,627 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:41,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:41,634 INFO L82 PathProgramCache]: Analyzing trace with hash -2093674288, now seen corresponding path program 1 times [2019-09-20 13:27:41,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:41,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:41,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:41,997 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:41,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:42,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:42,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:42,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:42,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:42,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:42,025 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 4 states. [2019-09-20 13:27:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:42,503 INFO L93 Difference]: Finished difference Result 188 states and 306 transitions. [2019-09-20 13:27:42,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:42,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-09-20 13:27:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:42,519 INFO L225 Difference]: With dead ends: 188 [2019-09-20 13:27:42,519 INFO L226 Difference]: Without dead ends: 167 [2019-09-20 13:27:42,521 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,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-20 13:27:42,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2019-09-20 13:27:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-20 13:27:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 228 transitions. [2019-09-20 13:27:42,571 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 228 transitions. Word has length 48 [2019-09-20 13:27:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:42,572 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 228 transitions. [2019-09-20 13:27:42,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 228 transitions. [2019-09-20 13:27:42,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-20 13:27:42,575 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:42,575 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:42,575 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:42,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:42,576 INFO L82 PathProgramCache]: Analyzing trace with hash -769657203, now seen corresponding path program 1 times [2019-09-20 13:27:42,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:42,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:42,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:42,694 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:42,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:42,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:42,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:42,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:42,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:42,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:42,698 INFO L87 Difference]: Start difference. First operand 150 states and 228 transitions. Second operand 4 states. [2019-09-20 13:27:43,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:43,134 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2019-09-20 13:27:43,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:43,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-09-20 13:27:43,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:43,137 INFO L225 Difference]: With dead ends: 167 [2019-09-20 13:27:43,137 INFO L226 Difference]: Without dead ends: 167 [2019-09-20 13:27:43,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:43,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-20 13:27:43,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2019-09-20 13:27:43,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-20 13:27:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2019-09-20 13:27:43,165 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 61 [2019-09-20 13:27:43,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:43,166 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2019-09-20 13:27:43,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2019-09-20 13:27:43,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:27:43,174 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:43,175 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:43,175 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:43,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:43,175 INFO L82 PathProgramCache]: Analyzing trace with hash -780515679, now seen corresponding path program 1 times [2019-09-20 13:27:43,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:43,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:43,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:43,360 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:43,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:43,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:43,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:43,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:43,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:43,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:43,363 INFO L87 Difference]: Start difference. First operand 150 states and 227 transitions. Second operand 4 states. [2019-09-20 13:27:43,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:43,693 INFO L93 Difference]: Finished difference Result 166 states and 246 transitions. [2019-09-20 13:27:43,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:43,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-20 13:27:43,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:43,696 INFO L225 Difference]: With dead ends: 166 [2019-09-20 13:27:43,696 INFO L226 Difference]: Without dead ends: 166 [2019-09-20 13:27:43,696 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,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-20 13:27:43,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 150. [2019-09-20 13:27:43,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-20 13:27:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 226 transitions. [2019-09-20 13:27:43,717 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 226 transitions. Word has length 62 [2019-09-20 13:27:43,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:43,717 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 226 transitions. [2019-09-20 13:27:43,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:43,719 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 226 transitions. [2019-09-20 13:27:43,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:27:43,720 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:43,723 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:43,724 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:43,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:43,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1828026483, now seen corresponding path program 1 times [2019-09-20 13:27:43,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:43,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:43,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:43,885 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:43,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:43,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:27:43,887 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:43,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:27:43,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:27:43,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:43,888 INFO L87 Difference]: Start difference. First operand 150 states and 226 transitions. Second operand 5 states. [2019-09-20 13:27:44,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:44,391 INFO L93 Difference]: Finished difference Result 171 states and 254 transitions. [2019-09-20 13:27:44,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:44,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-09-20 13:27:44,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:44,393 INFO L225 Difference]: With dead ends: 171 [2019-09-20 13:27:44,394 INFO L226 Difference]: Without dead ends: 171 [2019-09-20 13:27:44,394 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:44,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-20 13:27:44,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-09-20 13:27:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-20 13:27:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 253 transitions. [2019-09-20 13:27:44,402 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 253 transitions. Word has length 62 [2019-09-20 13:27:44,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:44,403 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 253 transitions. [2019-09-20 13:27:44,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:27:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 253 transitions. [2019-09-20 13:27:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:27:44,404 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:44,405 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:44,405 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:44,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:44,405 INFO L82 PathProgramCache]: Analyzing trace with hash 981067477, now seen corresponding path program 1 times [2019-09-20 13:27:44,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:44,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:44,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:44,516 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:44,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:44,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:44,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:44,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:44,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:44,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:44,520 INFO L87 Difference]: Start difference. First operand 170 states and 253 transitions. Second operand 4 states. [2019-09-20 13:27:44,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:44,856 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2019-09-20 13:27:44,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:44,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-20 13:27:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:44,859 INFO L225 Difference]: With dead ends: 185 [2019-09-20 13:27:44,859 INFO L226 Difference]: Without dead ends: 185 [2019-09-20 13:27:44,860 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,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-20 13:27:44,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 170. [2019-09-20 13:27:44,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-20 13:27:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 252 transitions. [2019-09-20 13:27:44,869 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 252 transitions. Word has length 62 [2019-09-20 13:27:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:44,869 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 252 transitions. [2019-09-20 13:27:44,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:44,870 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 252 transitions. [2019-09-20 13:27:44,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:27:44,871 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:44,871 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:44,871 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:44,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:44,872 INFO L82 PathProgramCache]: Analyzing trace with hash 840340790, now seen corresponding path program 1 times [2019-09-20 13:27:44,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:44,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:44,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:44,950 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:44,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:44,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:44,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:44,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:44,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:44,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:44,952 INFO L87 Difference]: Start difference. First operand 170 states and 252 transitions. Second operand 4 states. [2019-09-20 13:27:45,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:45,236 INFO L93 Difference]: Finished difference Result 183 states and 267 transitions. [2019-09-20 13:27:45,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:45,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-20 13:27:45,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:45,238 INFO L225 Difference]: With dead ends: 183 [2019-09-20 13:27:45,238 INFO L226 Difference]: Without dead ends: 183 [2019-09-20 13:27:45,239 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,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-20 13:27:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2019-09-20 13:27:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-20 13:27:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 251 transitions. [2019-09-20 13:27:45,247 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 251 transitions. Word has length 62 [2019-09-20 13:27:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:45,247 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 251 transitions. [2019-09-20 13:27:45,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 251 transitions. [2019-09-20 13:27:45,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:45,248 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:45,249 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:45,249 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:45,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:45,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1871605872, now seen corresponding path program 1 times [2019-09-20 13:27:45,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:45,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:45,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:45,307 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:45,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:45,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:45,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:45,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:45,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:45,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:45,308 INFO L87 Difference]: Start difference. First operand 170 states and 251 transitions. Second operand 4 states. [2019-09-20 13:27:45,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:45,616 INFO L93 Difference]: Finished difference Result 183 states and 266 transitions. [2019-09-20 13:27:45,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:45,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:27:45,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:45,618 INFO L225 Difference]: With dead ends: 183 [2019-09-20 13:27:45,619 INFO L226 Difference]: Without dead ends: 183 [2019-09-20 13:27:45,619 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,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-20 13:27:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2019-09-20 13:27:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-20 13:27:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 250 transitions. [2019-09-20 13:27:45,625 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 250 transitions. Word has length 63 [2019-09-20 13:27:45,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:45,625 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 250 transitions. [2019-09-20 13:27:45,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 250 transitions. [2019-09-20 13:27:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:45,626 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:45,626 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:45,627 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:45,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:45,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1090961511, now seen corresponding path program 1 times [2019-09-20 13:27:45,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:45,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:45,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:45,697 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:45,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:45,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:45,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:45,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:45,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:45,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:45,700 INFO L87 Difference]: Start difference. First operand 170 states and 250 transitions. Second operand 4 states. [2019-09-20 13:27:45,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:45,990 INFO L93 Difference]: Finished difference Result 183 states and 265 transitions. [2019-09-20 13:27:45,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:45,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:45,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:45,992 INFO L225 Difference]: With dead ends: 183 [2019-09-20 13:27:45,995 INFO L226 Difference]: Without dead ends: 183 [2019-09-20 13:27:45,995 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,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-20 13:27:46,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2019-09-20 13:27:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-20 13:27:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 249 transitions. [2019-09-20 13:27:46,003 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 249 transitions. Word has length 64 [2019-09-20 13:27:46,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:46,003 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 249 transitions. [2019-09-20 13:27:46,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:46,003 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 249 transitions. [2019-09-20 13:27:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:46,007 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:46,008 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:46,008 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:46,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:46,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1471474475, now seen corresponding path program 1 times [2019-09-20 13:27:46,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:46,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:46,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:46,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:46,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:46,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:46,122 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:46,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:46,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:46,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:46,123 INFO L87 Difference]: Start difference. First operand 170 states and 249 transitions. Second operand 4 states. [2019-09-20 13:27:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:46,440 INFO L93 Difference]: Finished difference Result 183 states and 264 transitions. [2019-09-20 13:27:46,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:46,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:46,443 INFO L225 Difference]: With dead ends: 183 [2019-09-20 13:27:46,443 INFO L226 Difference]: Without dead ends: 183 [2019-09-20 13:27:46,445 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,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-20 13:27:46,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2019-09-20 13:27:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-20 13:27:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 248 transitions. [2019-09-20 13:27:46,453 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 248 transitions. Word has length 65 [2019-09-20 13:27:46,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:46,453 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 248 transitions. [2019-09-20 13:27:46,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:46,457 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 248 transitions. [2019-09-20 13:27:46,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:46,458 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:46,461 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:46,461 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:46,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:46,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1708078742, now seen corresponding path program 1 times [2019-09-20 13:27:46,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:46,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:46,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:46,518 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:46,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:46,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:46,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:46,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:46,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:46,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:46,520 INFO L87 Difference]: Start difference. First operand 170 states and 248 transitions. Second operand 4 states. [2019-09-20 13:27:46,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:46,829 INFO L93 Difference]: Finished difference Result 212 states and 310 transitions. [2019-09-20 13:27:46,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:46,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:46,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:46,832 INFO L225 Difference]: With dead ends: 212 [2019-09-20 13:27:46,832 INFO L226 Difference]: Without dead ends: 212 [2019-09-20 13:27:46,832 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:46,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-20 13:27:46,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 192. [2019-09-20 13:27:46,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-20 13:27:46,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 285 transitions. [2019-09-20 13:27:46,839 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 285 transitions. Word has length 65 [2019-09-20 13:27:46,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:46,839 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 285 transitions. [2019-09-20 13:27:46,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:46,840 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 285 transitions. [2019-09-20 13:27:46,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:27:46,841 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:46,841 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:46,841 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:46,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:46,842 INFO L82 PathProgramCache]: Analyzing trace with hash 882288222, now seen corresponding path program 1 times [2019-09-20 13:27:46,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:46,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:46,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:46,896 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:46,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:46,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:46,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:46,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:46,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:46,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:46,898 INFO L87 Difference]: Start difference. First operand 192 states and 285 transitions. Second operand 4 states. [2019-09-20 13:27:47,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:47,170 INFO L93 Difference]: Finished difference Result 195 states and 288 transitions. [2019-09-20 13:27:47,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:47,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:27:47,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:47,172 INFO L225 Difference]: With dead ends: 195 [2019-09-20 13:27:47,172 INFO L226 Difference]: Without dead ends: 195 [2019-09-20 13:27:47,175 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,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-20 13:27:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2019-09-20 13:27:47,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-20 13:27:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 284 transitions. [2019-09-20 13:27:47,187 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 284 transitions. Word has length 66 [2019-09-20 13:27:47,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:47,187 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 284 transitions. [2019-09-20 13:27:47,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 284 transitions. [2019-09-20 13:27:47,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:47,188 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:47,189 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:47,189 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:47,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:47,189 INFO L82 PathProgramCache]: Analyzing trace with hash 963895943, now seen corresponding path program 1 times [2019-09-20 13:27:47,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:47,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:47,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:47,270 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:47,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:47,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:47,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:47,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:47,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:47,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:47,273 INFO L87 Difference]: Start difference. First operand 192 states and 284 transitions. Second operand 4 states. [2019-09-20 13:27:47,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:47,586 INFO L93 Difference]: Finished difference Result 212 states and 308 transitions. [2019-09-20 13:27:47,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:47,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:47,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:47,589 INFO L225 Difference]: With dead ends: 212 [2019-09-20 13:27:47,589 INFO L226 Difference]: Without dead ends: 212 [2019-09-20 13:27:47,590 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:47,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-20 13:27:47,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 192. [2019-09-20 13:27:47,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-20 13:27:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 283 transitions. [2019-09-20 13:27:47,595 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 283 transitions. Word has length 78 [2019-09-20 13:27:47,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:47,596 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 283 transitions. [2019-09-20 13:27:47,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:47,596 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 283 transitions. [2019-09-20 13:27:47,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:47,597 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:47,597 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:47,597 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:47,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:47,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1113359845, now seen corresponding path program 1 times [2019-09-20 13:27:47,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:47,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:47,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:47,660 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:47,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:47,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:47,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:47,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:47,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:47,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:47,662 INFO L87 Difference]: Start difference. First operand 192 states and 283 transitions. Second operand 4 states. [2019-09-20 13:27:47,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:47,991 INFO L93 Difference]: Finished difference Result 211 states and 306 transitions. [2019-09-20 13:27:47,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:47,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:47,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:47,993 INFO L225 Difference]: With dead ends: 211 [2019-09-20 13:27:47,993 INFO L226 Difference]: Without dead ends: 211 [2019-09-20 13:27:47,994 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:47,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-20 13:27:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 192. [2019-09-20 13:27:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-20 13:27:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 282 transitions. [2019-09-20 13:27:48,001 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 282 transitions. Word has length 79 [2019-09-20 13:27:48,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:48,003 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 282 transitions. [2019-09-20 13:27:48,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:48,003 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 282 transitions. [2019-09-20 13:27:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:48,004 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:48,004 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:48,005 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:48,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:48,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1254086532, now seen corresponding path program 1 times [2019-09-20 13:27:48,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:48,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:48,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:48,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:48,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:48,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:48,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:48,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:48,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:48,065 INFO L87 Difference]: Start difference. First operand 192 states and 282 transitions. Second operand 4 states. [2019-09-20 13:27:48,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:48,349 INFO L93 Difference]: Finished difference Result 209 states and 303 transitions. [2019-09-20 13:27:48,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:48,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:48,352 INFO L225 Difference]: With dead ends: 209 [2019-09-20 13:27:48,352 INFO L226 Difference]: Without dead ends: 209 [2019-09-20 13:27:48,353 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:48,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-20 13:27:48,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 192. [2019-09-20 13:27:48,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-20 13:27:48,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 281 transitions. [2019-09-20 13:27:48,358 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 281 transitions. Word has length 79 [2019-09-20 13:27:48,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:48,359 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 281 transitions. [2019-09-20 13:27:48,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:48,359 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 281 transitions. [2019-09-20 13:27:48,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:48,360 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:48,360 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:48,360 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:48,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:48,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1368868330, now seen corresponding path program 1 times [2019-09-20 13:27:48,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:48,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:48,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:48,427 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:48,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:48,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:48,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:48,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:48,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:48,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:48,429 INFO L87 Difference]: Start difference. First operand 192 states and 281 transitions. Second operand 4 states. [2019-09-20 13:27:48,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:48,769 INFO L93 Difference]: Finished difference Result 209 states and 302 transitions. [2019-09-20 13:27:48,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:48,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:48,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:48,771 INFO L225 Difference]: With dead ends: 209 [2019-09-20 13:27:48,772 INFO L226 Difference]: Without dead ends: 209 [2019-09-20 13:27:48,772 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:48,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-20 13:27:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 192. [2019-09-20 13:27:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-20 13:27:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 280 transitions. [2019-09-20 13:27:48,777 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 280 transitions. Word has length 80 [2019-09-20 13:27:48,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:48,778 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 280 transitions. [2019-09-20 13:27:48,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 280 transitions. [2019-09-20 13:27:48,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:48,779 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:48,779 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:48,779 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:48,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:48,780 INFO L82 PathProgramCache]: Analyzing trace with hash 504043871, now seen corresponding path program 1 times [2019-09-20 13:27:48,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:48,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:48,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:48,839 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:48,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:48,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:48,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:48,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:48,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:48,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:48,841 INFO L87 Difference]: Start difference. First operand 192 states and 280 transitions. Second operand 4 states. [2019-09-20 13:27:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,122 INFO L93 Difference]: Finished difference Result 209 states and 301 transitions. [2019-09-20 13:27:49,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:49,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:49,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,124 INFO L225 Difference]: With dead ends: 209 [2019-09-20 13:27:49,124 INFO L226 Difference]: Without dead ends: 209 [2019-09-20 13:27:49,124 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-20 13:27:49,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 192. [2019-09-20 13:27:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-20 13:27:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 279 transitions. [2019-09-20 13:27:49,131 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 279 transitions. Word has length 81 [2019-09-20 13:27:49,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:49,132 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 279 transitions. [2019-09-20 13:27:49,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:49,132 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 279 transitions. [2019-09-20 13:27:49,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:27:49,133 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:49,133 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:49,133 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:49,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:49,134 INFO L82 PathProgramCache]: Analyzing trace with hash 729052111, now seen corresponding path program 1 times [2019-09-20 13:27:49,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:49,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:49,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:49,201 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:49,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:49,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:49,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:49,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:49,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:49,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,203 INFO L87 Difference]: Start difference. First operand 192 states and 279 transitions. Second operand 4 states. [2019-09-20 13:27:49,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,557 INFO L93 Difference]: Finished difference Result 209 states and 300 transitions. [2019-09-20 13:27:49,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:49,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:27:49,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,559 INFO L225 Difference]: With dead ends: 209 [2019-09-20 13:27:49,559 INFO L226 Difference]: Without dead ends: 209 [2019-09-20 13:27:49,560 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:49,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-20 13:27:49,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 192. [2019-09-20 13:27:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-20 13:27:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 278 transitions. [2019-09-20 13:27:49,567 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 278 transitions. Word has length 82 [2019-09-20 13:27:49,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:49,567 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 278 transitions. [2019-09-20 13:27:49,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:49,568 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 278 transitions. [2019-09-20 13:27:49,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:27:49,569 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:49,569 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:49,569 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:49,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:49,569 INFO L82 PathProgramCache]: Analyzing trace with hash 379135652, now seen corresponding path program 1 times [2019-09-20 13:27:49,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:49,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:49,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:49,654 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:49,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:49,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:49,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:49,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:49,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:49,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,656 INFO L87 Difference]: Start difference. First operand 192 states and 278 transitions. Second operand 4 states. [2019-09-20 13:27:49,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,948 INFO L93 Difference]: Finished difference Result 199 states and 287 transitions. [2019-09-20 13:27:49,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:49,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-20 13:27:49,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,950 INFO L225 Difference]: With dead ends: 199 [2019-09-20 13:27:49,950 INFO L226 Difference]: Without dead ends: 199 [2019-09-20 13:27:49,951 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-20 13:27:49,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 192. [2019-09-20 13:27:49,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-20 13:27:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 277 transitions. [2019-09-20 13:27:49,956 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 277 transitions. Word has length 83 [2019-09-20 13:27:49,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:49,957 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 277 transitions. [2019-09-20 13:27:49,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 277 transitions. [2019-09-20 13:27:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-20 13:27:49,958 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:49,958 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:49,959 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:49,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:49,959 INFO L82 PathProgramCache]: Analyzing trace with hash -578102836, now seen corresponding path program 1 times [2019-09-20 13:27:49,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:49,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:49,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:50,049 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:50,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:50,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:50,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:50,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:50,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:50,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:50,053 INFO L87 Difference]: Start difference. First operand 192 states and 277 transitions. Second operand 4 states. [2019-09-20 13:27:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:50,523 INFO L93 Difference]: Finished difference Result 297 states and 436 transitions. [2019-09-20 13:27:50,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:50,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-20 13:27:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:50,526 INFO L225 Difference]: With dead ends: 297 [2019-09-20 13:27:50,526 INFO L226 Difference]: Without dead ends: 297 [2019-09-20 13:27:50,526 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,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-20 13:27:50,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 233. [2019-09-20 13:27:50,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-20 13:27:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 350 transitions. [2019-09-20 13:27:50,534 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 350 transitions. Word has length 87 [2019-09-20 13:27:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:50,534 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 350 transitions. [2019-09-20 13:27:50,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:50,534 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 350 transitions. [2019-09-20 13:27:50,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-20 13:27:50,536 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:50,536 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:50,536 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:50,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:50,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1949910134, now seen corresponding path program 1 times [2019-09-20 13:27:50,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:50,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:50,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:50,603 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:50,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:50,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:50,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:50,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:50,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:50,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:50,605 INFO L87 Difference]: Start difference. First operand 233 states and 350 transitions. Second operand 4 states. [2019-09-20 13:27:50,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:50,934 INFO L93 Difference]: Finished difference Result 281 states and 421 transitions. [2019-09-20 13:27:50,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:50,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-20 13:27:50,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:50,937 INFO L225 Difference]: With dead ends: 281 [2019-09-20 13:27:50,937 INFO L226 Difference]: Without dead ends: 281 [2019-09-20 13:27:50,938 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,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-20 13:27:50,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 257. [2019-09-20 13:27:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-20 13:27:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 391 transitions. [2019-09-20 13:27:50,945 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 391 transitions. Word has length 87 [2019-09-20 13:27:50,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:50,945 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 391 transitions. [2019-09-20 13:27:50,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 391 transitions. [2019-09-20 13:27:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 13:27:50,946 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:50,947 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, 1] [2019-09-20 13:27:50,947 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:50,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:50,947 INFO L82 PathProgramCache]: Analyzing trace with hash -942801744, now seen corresponding path program 1 times [2019-09-20 13:27:50,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:50,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:50,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:51,025 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:51,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:51,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:51,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:51,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:51,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:51,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:51,027 INFO L87 Difference]: Start difference. First operand 257 states and 391 transitions. Second operand 4 states. [2019-09-20 13:27:51,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:51,465 INFO L93 Difference]: Finished difference Result 314 states and 467 transitions. [2019-09-20 13:27:51,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:51,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-20 13:27:51,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:51,468 INFO L225 Difference]: With dead ends: 314 [2019-09-20 13:27:51,468 INFO L226 Difference]: Without dead ends: 314 [2019-09-20 13:27:51,468 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:51,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-20 13:27:51,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 258. [2019-09-20 13:27:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-20 13:27:51,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 392 transitions. [2019-09-20 13:27:51,477 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 392 transitions. Word has length 88 [2019-09-20 13:27:51,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:51,477 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 392 transitions. [2019-09-20 13:27:51,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:51,477 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 392 transitions. [2019-09-20 13:27:51,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-20 13:27:51,479 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:51,479 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:51,479 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:51,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:51,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1170319121, now seen corresponding path program 1 times [2019-09-20 13:27:51,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:51,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:51,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:51,575 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:51,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:51,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:51,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:51,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:51,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:51,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:51,576 INFO L87 Difference]: Start difference. First operand 258 states and 392 transitions. Second operand 4 states. [2019-09-20 13:27:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:52,109 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2019-09-20 13:27:52,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:52,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-20 13:27:52,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:52,113 INFO L225 Difference]: With dead ends: 314 [2019-09-20 13:27:52,114 INFO L226 Difference]: Without dead ends: 314 [2019-09-20 13:27:52,115 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-20 13:27:52,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 258. [2019-09-20 13:27:52,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-20 13:27:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 391 transitions. [2019-09-20 13:27:52,123 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 391 transitions. Word has length 100 [2019-09-20 13:27:52,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:52,123 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 391 transitions. [2019-09-20 13:27:52,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:52,123 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 391 transitions. [2019-09-20 13:27:52,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-20 13:27:52,125 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:52,125 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:52,125 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:52,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:52,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1614219795, now seen corresponding path program 1 times [2019-09-20 13:27:52,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:52,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:52,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:52,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:52,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:52,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:52,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:52,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:52,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:52,219 INFO L87 Difference]: Start difference. First operand 258 states and 391 transitions. Second operand 4 states. [2019-09-20 13:27:52,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:52,624 INFO L93 Difference]: Finished difference Result 282 states and 420 transitions. [2019-09-20 13:27:52,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:52,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-20 13:27:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:52,627 INFO L225 Difference]: With dead ends: 282 [2019-09-20 13:27:52,627 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:27:52,628 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:27:52,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 258. [2019-09-20 13:27:52,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-20 13:27:52,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 390 transitions. [2019-09-20 13:27:52,638 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 390 transitions. Word has length 100 [2019-09-20 13:27:52,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:52,638 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 390 transitions. [2019-09-20 13:27:52,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:52,638 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 390 transitions. [2019-09-20 13:27:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:27:52,640 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:52,640 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:52,640 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:52,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:52,641 INFO L82 PathProgramCache]: Analyzing trace with hash 990791377, now seen corresponding path program 1 times [2019-09-20 13:27:52,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:52,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:52,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:52,729 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:52,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:52,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:52,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:52,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:52,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:52,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:52,732 INFO L87 Difference]: Start difference. First operand 258 states and 390 transitions. Second operand 4 states. [2019-09-20 13:27:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:53,146 INFO L93 Difference]: Finished difference Result 313 states and 463 transitions. [2019-09-20 13:27:53,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:53,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:27:53,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:53,149 INFO L225 Difference]: With dead ends: 313 [2019-09-20 13:27:53,150 INFO L226 Difference]: Without dead ends: 313 [2019-09-20 13:27:53,150 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:53,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-20 13:27:53,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 258. [2019-09-20 13:27:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-20 13:27:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 389 transitions. [2019-09-20 13:27:53,157 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 389 transitions. Word has length 101 [2019-09-20 13:27:53,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:53,157 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 389 transitions. [2019-09-20 13:27:53,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 389 transitions. [2019-09-20 13:27:53,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:27:53,159 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:53,159 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:53,159 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:53,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:53,160 INFO L82 PathProgramCache]: Analyzing trace with hash 850064690, now seen corresponding path program 1 times [2019-09-20 13:27:53,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:53,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:53,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:53,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:53,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:53,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:53,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:53,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:53,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:53,232 INFO L87 Difference]: Start difference. First operand 258 states and 389 transitions. Second operand 4 states. [2019-09-20 13:27:53,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:53,662 INFO L93 Difference]: Finished difference Result 311 states and 460 transitions. [2019-09-20 13:27:53,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:53,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:27:53,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:53,666 INFO L225 Difference]: With dead ends: 311 [2019-09-20 13:27:53,666 INFO L226 Difference]: Without dead ends: 311 [2019-09-20 13:27:53,666 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:53,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-20 13:27:53,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 258. [2019-09-20 13:27:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-20 13:27:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 388 transitions. [2019-09-20 13:27:53,672 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 388 transitions. Word has length 101 [2019-09-20 13:27:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:53,673 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 388 transitions. [2019-09-20 13:27:53,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 388 transitions. [2019-09-20 13:27:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:27:53,674 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:53,675 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:53,675 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:53,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:53,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1866810383, now seen corresponding path program 1 times [2019-09-20 13:27:53,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:53,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:53,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:53,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:53,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:53,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:53,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:53,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:53,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:53,740 INFO L87 Difference]: Start difference. First operand 258 states and 388 transitions. Second operand 4 states. [2019-09-20 13:27:54,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:54,064 INFO L93 Difference]: Finished difference Result 281 states and 416 transitions. [2019-09-20 13:27:54,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:54,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:27:54,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:54,072 INFO L225 Difference]: With dead ends: 281 [2019-09-20 13:27:54,072 INFO L226 Difference]: Without dead ends: 281 [2019-09-20 13:27:54,072 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-20 13:27:54,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 258. [2019-09-20 13:27:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-20 13:27:54,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 387 transitions. [2019-09-20 13:27:54,079 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 387 transitions. Word has length 101 [2019-09-20 13:27:54,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:54,080 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 387 transitions. [2019-09-20 13:27:54,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:54,080 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 387 transitions. [2019-09-20 13:27:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:27:54,081 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:54,082 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:54,082 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:54,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:54,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1726083696, now seen corresponding path program 1 times [2019-09-20 13:27:54,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:54,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:54,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:54,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:54,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:54,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:54,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:54,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:54,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:54,157 INFO L87 Difference]: Start difference. First operand 258 states and 387 transitions. Second operand 4 states. [2019-09-20 13:27:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:54,469 INFO L93 Difference]: Finished difference Result 279 states and 413 transitions. [2019-09-20 13:27:54,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:54,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:27:54,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:54,471 INFO L225 Difference]: With dead ends: 279 [2019-09-20 13:27:54,471 INFO L226 Difference]: Without dead ends: 279 [2019-09-20 13:27:54,472 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-20 13:27:54,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 258. [2019-09-20 13:27:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-20 13:27:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 386 transitions. [2019-09-20 13:27:54,478 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 386 transitions. Word has length 101 [2019-09-20 13:27:54,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:54,478 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 386 transitions. [2019-09-20 13:27:54,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:54,478 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 386 transitions. [2019-09-20 13:27:54,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:27:54,479 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:54,480 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:54,480 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:54,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:54,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2121920524, now seen corresponding path program 1 times [2019-09-20 13:27:54,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:54,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:54,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:54,536 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:54,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:54,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:54,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:54,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:54,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:54,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:54,538 INFO L87 Difference]: Start difference. First operand 258 states and 386 transitions. Second operand 4 states. [2019-09-20 13:27:54,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:54,949 INFO L93 Difference]: Finished difference Result 311 states and 457 transitions. [2019-09-20 13:27:54,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:54,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:27:54,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:54,952 INFO L225 Difference]: With dead ends: 311 [2019-09-20 13:27:54,952 INFO L226 Difference]: Without dead ends: 311 [2019-09-20 13:27:54,953 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:54,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-20 13:27:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 258. [2019-09-20 13:27:54,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-20 13:27:54,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 385 transitions. [2019-09-20 13:27:54,960 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 385 transitions. Word has length 102 [2019-09-20 13:27:54,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:54,960 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 385 transitions. [2019-09-20 13:27:54,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:54,960 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 385 transitions. [2019-09-20 13:27:54,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:27:54,962 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:54,962 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:54,962 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:54,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:54,963 INFO L82 PathProgramCache]: Analyzing trace with hash -735135114, now seen corresponding path program 1 times [2019-09-20 13:27:54,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:54,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:54,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:55,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:55,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:55,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:55,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:55,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:55,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:55,019 INFO L87 Difference]: Start difference. First operand 258 states and 385 transitions. Second operand 4 states. [2019-09-20 13:27:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:55,311 INFO L93 Difference]: Finished difference Result 279 states and 411 transitions. [2019-09-20 13:27:55,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:55,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:27:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:55,314 INFO L225 Difference]: With dead ends: 279 [2019-09-20 13:27:55,314 INFO L226 Difference]: Without dead ends: 279 [2019-09-20 13:27:55,314 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:55,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-20 13:27:55,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 258. [2019-09-20 13:27:55,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-20 13:27:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 384 transitions. [2019-09-20 13:27:55,320 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 384 transitions. Word has length 102 [2019-09-20 13:27:55,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:55,320 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 384 transitions. [2019-09-20 13:27:55,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 384 transitions. [2019-09-20 13:27:55,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:55,322 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:55,322 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:55,322 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:55,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:55,323 INFO L82 PathProgramCache]: Analyzing trace with hash -336228203, now seen corresponding path program 1 times [2019-09-20 13:27:55,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:55,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:55,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:55,378 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:55,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:55,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:55,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:55,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:55,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:55,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:55,379 INFO L87 Difference]: Start difference. First operand 258 states and 384 transitions. Second operand 4 states. [2019-09-20 13:27:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:55,776 INFO L93 Difference]: Finished difference Result 311 states and 455 transitions. [2019-09-20 13:27:55,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:55,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:55,779 INFO L225 Difference]: With dead ends: 311 [2019-09-20 13:27:55,780 INFO L226 Difference]: Without dead ends: 311 [2019-09-20 13:27:55,780 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-20 13:27:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 258. [2019-09-20 13:27:55,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-20 13:27:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 383 transitions. [2019-09-20 13:27:55,786 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 383 transitions. Word has length 103 [2019-09-20 13:27:55,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:55,787 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 383 transitions. [2019-09-20 13:27:55,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:55,787 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 383 transitions. [2019-09-20 13:27:55,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:55,788 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:55,788 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:55,789 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:55,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:55,789 INFO L82 PathProgramCache]: Analyzing trace with hash -295553453, now seen corresponding path program 1 times [2019-09-20 13:27:55,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:55,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:55,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:55,855 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:55,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:55,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:55,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:55,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:55,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:55,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:55,857 INFO L87 Difference]: Start difference. First operand 258 states and 383 transitions. Second operand 4 states. [2019-09-20 13:27:56,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:56,176 INFO L93 Difference]: Finished difference Result 279 states and 409 transitions. [2019-09-20 13:27:56,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:56,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:56,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:56,179 INFO L225 Difference]: With dead ends: 279 [2019-09-20 13:27:56,180 INFO L226 Difference]: Without dead ends: 279 [2019-09-20 13:27:56,180 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:56,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-20 13:27:56,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 258. [2019-09-20 13:27:56,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-20 13:27:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 382 transitions. [2019-09-20 13:27:56,187 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 382 transitions. Word has length 103 [2019-09-20 13:27:56,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:56,187 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 382 transitions. [2019-09-20 13:27:56,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 382 transitions. [2019-09-20 13:27:56,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:56,189 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:56,189 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:56,190 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:56,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:56,190 INFO L82 PathProgramCache]: Analyzing trace with hash 450421593, now seen corresponding path program 1 times [2019-09-20 13:27:56,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:56,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:56,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:56,291 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:56,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:56,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:56,292 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:56,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:56,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:56,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:56,293 INFO L87 Difference]: Start difference. First operand 258 states and 382 transitions. Second operand 4 states. [2019-09-20 13:27:56,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:56,688 INFO L93 Difference]: Finished difference Result 311 states and 453 transitions. [2019-09-20 13:27:56,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:56,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:56,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:56,691 INFO L225 Difference]: With dead ends: 311 [2019-09-20 13:27:56,691 INFO L226 Difference]: Without dead ends: 311 [2019-09-20 13:27:56,692 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:56,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-20 13:27:56,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 258. [2019-09-20 13:27:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-20 13:27:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 381 transitions. [2019-09-20 13:27:56,698 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 381 transitions. Word has length 104 [2019-09-20 13:27:56,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:56,698 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 381 transitions. [2019-09-20 13:27:56,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:56,698 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 381 transitions. [2019-09-20 13:27:56,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:56,700 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:56,700 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:56,700 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:56,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:56,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1711338843, now seen corresponding path program 1 times [2019-09-20 13:27:56,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:56,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:56,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:56,760 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:56,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:56,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:56,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:56,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:56,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:56,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:56,765 INFO L87 Difference]: Start difference. First operand 258 states and 381 transitions. Second operand 4 states. [2019-09-20 13:27:57,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:57,026 INFO L93 Difference]: Finished difference Result 279 states and 407 transitions. [2019-09-20 13:27:57,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:57,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:57,028 INFO L225 Difference]: With dead ends: 279 [2019-09-20 13:27:57,029 INFO L226 Difference]: Without dead ends: 279 [2019-09-20 13:27:57,029 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:57,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-20 13:27:57,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 258. [2019-09-20 13:27:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-20 13:27:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 380 transitions. [2019-09-20 13:27:57,035 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 380 transitions. Word has length 104 [2019-09-20 13:27:57,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:57,035 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 380 transitions. [2019-09-20 13:27:57,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:57,036 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2019-09-20 13:27:57,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:57,037 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:57,037 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:57,037 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:57,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:57,037 INFO L82 PathProgramCache]: Analyzing trace with hash 331524186, now seen corresponding path program 1 times [2019-09-20 13:27:57,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:57,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:57,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:57,111 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:57,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:57,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:57,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:57,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:57,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:57,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:57,113 INFO L87 Difference]: Start difference. First operand 258 states and 380 transitions. Second operand 4 states. [2019-09-20 13:27:57,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:57,484 INFO L93 Difference]: Finished difference Result 301 states and 439 transitions. [2019-09-20 13:27:57,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:57,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:57,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:57,487 INFO L225 Difference]: With dead ends: 301 [2019-09-20 13:27:57,487 INFO L226 Difference]: Without dead ends: 301 [2019-09-20 13:27:57,488 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:57,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-20 13:27:57,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 258. [2019-09-20 13:27:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-20 13:27:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 379 transitions. [2019-09-20 13:27:57,494 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 379 transitions. Word has length 105 [2019-09-20 13:27:57,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:57,494 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 379 transitions. [2019-09-20 13:27:57,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 379 transitions. [2019-09-20 13:27:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:57,497 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:57,497 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:57,497 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:57,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:57,498 INFO L82 PathProgramCache]: Analyzing trace with hash 765253272, now seen corresponding path program 1 times [2019-09-20 13:27:57,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:57,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:57,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:57,589 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:57,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:57,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:57,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:57,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:57,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:57,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:57,590 INFO L87 Difference]: Start difference. First operand 258 states and 379 transitions. Second operand 4 states. [2019-09-20 13:27:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:57,930 INFO L93 Difference]: Finished difference Result 269 states and 393 transitions. [2019-09-20 13:27:57,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:57,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:57,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:57,933 INFO L225 Difference]: With dead ends: 269 [2019-09-20 13:27:57,933 INFO L226 Difference]: Without dead ends: 269 [2019-09-20 13:27:57,933 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:57,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-20 13:27:57,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 258. [2019-09-20 13:27:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-20 13:27:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 378 transitions. [2019-09-20 13:27:57,940 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 378 transitions. Word has length 105 [2019-09-20 13:27:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:57,941 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 378 transitions. [2019-09-20 13:27:57,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 378 transitions. [2019-09-20 13:27:57,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-20 13:27:57,942 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:57,943 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] [2019-09-20 13:27:57,943 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:57,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:57,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1993514386, now seen corresponding path program 1 times [2019-09-20 13:27:57,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:57,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:57,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:58,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:58,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:58,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:58,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:58,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:58,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:58,040 INFO L87 Difference]: Start difference. First operand 258 states and 378 transitions. Second operand 4 states. [2019-09-20 13:27:58,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:58,396 INFO L93 Difference]: Finished difference Result 301 states and 437 transitions. [2019-09-20 13:27:58,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:58,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-20 13:27:58,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:58,398 INFO L225 Difference]: With dead ends: 301 [2019-09-20 13:27:58,398 INFO L226 Difference]: Without dead ends: 301 [2019-09-20 13:27:58,399 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:58,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-20 13:27:58,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 258. [2019-09-20 13:27:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-20 13:27:58,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 377 transitions. [2019-09-20 13:27:58,404 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 377 transitions. Word has length 109 [2019-09-20 13:27:58,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:58,404 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 377 transitions. [2019-09-20 13:27:58,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:58,404 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 377 transitions. [2019-09-20 13:27:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-20 13:27:58,405 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:58,405 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] [2019-09-20 13:27:58,406 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:58,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:58,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1314242132, now seen corresponding path program 1 times [2019-09-20 13:27:58,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:58,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:58,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:58,550 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:58,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:58,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:58,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:58,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:58,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:58,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:58,553 INFO L87 Difference]: Start difference. First operand 258 states and 377 transitions. Second operand 3 states. [2019-09-20 13:27:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:58,588 INFO L93 Difference]: Finished difference Result 489 states and 720 transitions. [2019-09-20 13:27:58,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:58,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-20 13:27:58,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:58,590 INFO L225 Difference]: With dead ends: 489 [2019-09-20 13:27:58,590 INFO L226 Difference]: Without dead ends: 489 [2019-09-20 13:27:58,590 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:58,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-09-20 13:27:58,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2019-09-20 13:27:58,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-09-20 13:27:58,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 720 transitions. [2019-09-20 13:27:58,598 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 720 transitions. Word has length 109 [2019-09-20 13:27:58,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:58,598 INFO L475 AbstractCegarLoop]: Abstraction has 489 states and 720 transitions. [2019-09-20 13:27:58,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:58,598 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 720 transitions. [2019-09-20 13:27:58,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-20 13:27:58,600 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:58,600 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:58,600 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:58,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:58,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1497455874, now seen corresponding path program 1 times [2019-09-20 13:27:58,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:58,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:58,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:58,678 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:58,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:58,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:58,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:58,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:58,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:58,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:58,680 INFO L87 Difference]: Start difference. First operand 489 states and 720 transitions. Second operand 4 states. [2019-09-20 13:27:59,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:59,144 INFO L93 Difference]: Finished difference Result 693 states and 1029 transitions. [2019-09-20 13:27:59,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:59,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-20 13:27:59,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:59,151 INFO L225 Difference]: With dead ends: 693 [2019-09-20 13:27:59,151 INFO L226 Difference]: Without dead ends: 693 [2019-09-20 13:27:59,152 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,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2019-09-20 13:27:59,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 567. [2019-09-20 13:27:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-20 13:27:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 862 transitions. [2019-09-20 13:27:59,162 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 862 transitions. Word has length 128 [2019-09-20 13:27:59,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:59,162 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 862 transitions. [2019-09-20 13:27:59,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:59,162 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 862 transitions. [2019-09-20 13:27:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-20 13:27:59,164 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:59,164 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, 1] [2019-09-20 13:27:59,165 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:59,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:59,165 INFO L82 PathProgramCache]: Analyzing trace with hash 622025150, now seen corresponding path program 1 times [2019-09-20 13:27:59,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:59,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:59,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:59,256 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:59,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:59,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:59,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:59,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:59,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:59,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:59,257 INFO L87 Difference]: Start difference. First operand 567 states and 862 transitions. Second operand 4 states. [2019-09-20 13:27:59,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:59,735 INFO L93 Difference]: Finished difference Result 681 states and 1012 transitions. [2019-09-20 13:27:59,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:59,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-20 13:27:59,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:59,740 INFO L225 Difference]: With dead ends: 681 [2019-09-20 13:27:59,740 INFO L226 Difference]: Without dead ends: 681 [2019-09-20 13:27:59,741 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,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-09-20 13:27:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 537. [2019-09-20 13:27:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-20 13:27:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 804 transitions. [2019-09-20 13:27:59,751 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 804 transitions. Word has length 129 [2019-09-20 13:27:59,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:59,752 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 804 transitions. [2019-09-20 13:27:59,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 804 transitions. [2019-09-20 13:27:59,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-20 13:27:59,754 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:59,754 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, 1] [2019-09-20 13:27:59,754 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:59,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:59,755 INFO L82 PathProgramCache]: Analyzing trace with hash -2012356833, now seen corresponding path program 1 times [2019-09-20 13:27:59,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:59,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:59,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:59,839 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:59,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:59,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:59,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:59,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:59,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:59,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:59,841 INFO L87 Difference]: Start difference. First operand 537 states and 804 transitions. Second operand 4 states. [2019-09-20 13:28:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:00,334 INFO L93 Difference]: Finished difference Result 681 states and 1010 transitions. [2019-09-20 13:28:00,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:00,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-20 13:28:00,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:00,338 INFO L225 Difference]: With dead ends: 681 [2019-09-20 13:28:00,339 INFO L226 Difference]: Without dead ends: 681 [2019-09-20 13:28:00,339 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,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-09-20 13:28:00,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 537. [2019-09-20 13:28:00,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-20 13:28:00,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 802 transitions. [2019-09-20 13:28:00,350 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 802 transitions. Word has length 141 [2019-09-20 13:28:00,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:00,351 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 802 transitions. [2019-09-20 13:28:00,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:00,351 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 802 transitions. [2019-09-20 13:28:00,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-20 13:28:00,353 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:00,353 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, 1] [2019-09-20 13:28:00,353 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:00,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:00,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1112084611, now seen corresponding path program 1 times [2019-09-20 13:28:00,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:00,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:00,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:00,440 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:28:00,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:00,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:00,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:00,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:00,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:00,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:00,442 INFO L87 Difference]: Start difference. First operand 537 states and 802 transitions. Second operand 4 states. [2019-09-20 13:28:00,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:00,936 INFO L93 Difference]: Finished difference Result 679 states and 1006 transitions. [2019-09-20 13:28:00,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:00,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-20 13:28:00,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:00,940 INFO L225 Difference]: With dead ends: 679 [2019-09-20 13:28:00,940 INFO L226 Difference]: Without dead ends: 679 [2019-09-20 13:28:00,941 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,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-09-20 13:28:00,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 537. [2019-09-20 13:28:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-20 13:28:00,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 800 transitions. [2019-09-20 13:28:00,949 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 800 transitions. Word has length 142 [2019-09-20 13:28:00,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:00,950 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 800 transitions. [2019-09-20 13:28:00,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:00,950 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 800 transitions. [2019-09-20 13:28:00,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-20 13:28:00,952 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:00,952 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, 1] [2019-09-20 13:28:00,952 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:00,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:00,952 INFO L82 PathProgramCache]: Analyzing trace with hash 971357924, now seen corresponding path program 1 times [2019-09-20 13:28:00,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:00,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:00,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:01,026 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:28:01,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:01,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:01,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:01,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:01,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:01,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:01,027 INFO L87 Difference]: Start difference. First operand 537 states and 800 transitions. Second operand 4 states. [2019-09-20 13:28:01,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:01,487 INFO L93 Difference]: Finished difference Result 675 states and 1000 transitions. [2019-09-20 13:28:01,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:01,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-20 13:28:01,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:01,491 INFO L225 Difference]: With dead ends: 675 [2019-09-20 13:28:01,491 INFO L226 Difference]: Without dead ends: 675 [2019-09-20 13:28:01,491 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,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-09-20 13:28:01,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 537. [2019-09-20 13:28:01,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-20 13:28:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 798 transitions. [2019-09-20 13:28:01,501 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 798 transitions. Word has length 142 [2019-09-20 13:28:01,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:01,502 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 798 transitions. [2019-09-20 13:28:01,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:01,502 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 798 transitions. [2019-09-20 13:28:01,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-20 13:28:01,504 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:01,504 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, 1] [2019-09-20 13:28:01,505 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:01,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:01,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1638169730, now seen corresponding path program 1 times [2019-09-20 13:28:01,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:01,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:01,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:01,581 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:28:01,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:01,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:01,582 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:01,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:01,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:01,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:01,583 INFO L87 Difference]: Start difference. First operand 537 states and 798 transitions. Second operand 4 states. [2019-09-20 13:28:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:02,043 INFO L93 Difference]: Finished difference Result 675 states and 998 transitions. [2019-09-20 13:28:02,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:02,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-20 13:28:02,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:02,049 INFO L225 Difference]: With dead ends: 675 [2019-09-20 13:28:02,049 INFO L226 Difference]: Without dead ends: 675 [2019-09-20 13:28:02,049 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:02,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-09-20 13:28:02,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 537. [2019-09-20 13:28:02,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-20 13:28:02,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 796 transitions. [2019-09-20 13:28:02,062 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 796 transitions. Word has length 143 [2019-09-20 13:28:02,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:02,062 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 796 transitions. [2019-09-20 13:28:02,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:02,062 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 796 transitions. [2019-09-20 13:28:02,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-20 13:28:02,064 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:02,065 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, 1] [2019-09-20 13:28:02,065 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:02,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:02,066 INFO L82 PathProgramCache]: Analyzing trace with hash 262452679, now seen corresponding path program 1 times [2019-09-20 13:28:02,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:02,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:02,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:02,147 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:28:02,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:02,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:02,148 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:02,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:02,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:02,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:02,150 INFO L87 Difference]: Start difference. First operand 537 states and 796 transitions. Second operand 4 states. [2019-09-20 13:28:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:02,576 INFO L93 Difference]: Finished difference Result 675 states and 996 transitions. [2019-09-20 13:28:02,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:02,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-09-20 13:28:02,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:02,581 INFO L225 Difference]: With dead ends: 675 [2019-09-20 13:28:02,581 INFO L226 Difference]: Without dead ends: 675 [2019-09-20 13:28:02,581 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:02,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-09-20 13:28:02,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 537. [2019-09-20 13:28:02,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-20 13:28:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 794 transitions. [2019-09-20 13:28:02,591 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 794 transitions. Word has length 144 [2019-09-20 13:28:02,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:02,591 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 794 transitions. [2019-09-20 13:28:02,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 794 transitions. [2019-09-20 13:28:02,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-20 13:28:02,593 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:02,593 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, 1] [2019-09-20 13:28:02,594 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:02,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:02,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1829659751, now seen corresponding path program 1 times [2019-09-20 13:28:02,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:02,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:02,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:02,670 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:28:02,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:02,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:02,671 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:02,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:02,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:02,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:02,672 INFO L87 Difference]: Start difference. First operand 537 states and 794 transitions. Second operand 4 states. [2019-09-20 13:28:03,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:03,104 INFO L93 Difference]: Finished difference Result 675 states and 994 transitions. [2019-09-20 13:28:03,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:03,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-20 13:28:03,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:03,108 INFO L225 Difference]: With dead ends: 675 [2019-09-20 13:28:03,109 INFO L226 Difference]: Without dead ends: 675 [2019-09-20 13:28:03,109 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:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-09-20 13:28:03,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 537. [2019-09-20 13:28:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-20 13:28:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 792 transitions. [2019-09-20 13:28:03,119 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 792 transitions. Word has length 145 [2019-09-20 13:28:03,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:03,119 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 792 transitions. [2019-09-20 13:28:03,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 792 transitions. [2019-09-20 13:28:03,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-20 13:28:03,122 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:03,122 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, 1] [2019-09-20 13:28:03,122 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:03,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:03,123 INFO L82 PathProgramCache]: Analyzing trace with hash 138234124, now seen corresponding path program 1 times [2019-09-20 13:28:03,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:03,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:03,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:03,223 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:28:03,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:03,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:03,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:03,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:03,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:03,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:03,225 INFO L87 Difference]: Start difference. First operand 537 states and 792 transitions. Second operand 4 states. [2019-09-20 13:28:03,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:03,628 INFO L93 Difference]: Finished difference Result 655 states and 968 transitions. [2019-09-20 13:28:03,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:03,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-09-20 13:28:03,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:03,632 INFO L225 Difference]: With dead ends: 655 [2019-09-20 13:28:03,632 INFO L226 Difference]: Without dead ends: 655 [2019-09-20 13:28:03,632 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:03,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-09-20 13:28:03,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 537. [2019-09-20 13:28:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-20 13:28:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 790 transitions. [2019-09-20 13:28:03,640 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 790 transitions. Word has length 146 [2019-09-20 13:28:03,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:03,641 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 790 transitions. [2019-09-20 13:28:03,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:03,641 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 790 transitions. [2019-09-20 13:28:03,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-20 13:28:03,643 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:03,643 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, 1] [2019-09-20 13:28:03,643 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:03,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:03,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1994106336, now seen corresponding path program 1 times [2019-09-20 13:28:03,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:03,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:03,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:03,726 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:28:03,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:03,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:03,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:03,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:03,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:03,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:03,728 INFO L87 Difference]: Start difference. First operand 537 states and 790 transitions. Second operand 4 states. [2019-09-20 13:28:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:04,189 INFO L93 Difference]: Finished difference Result 655 states and 966 transitions. [2019-09-20 13:28:04,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:04,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-20 13:28:04,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:04,194 INFO L225 Difference]: With dead ends: 655 [2019-09-20 13:28:04,194 INFO L226 Difference]: Without dead ends: 655 [2019-09-20 13:28:04,195 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:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-09-20 13:28:04,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 489. [2019-09-20 13:28:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-09-20 13:28:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 720 transitions. [2019-09-20 13:28:04,207 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 720 transitions. Word has length 150 [2019-09-20 13:28:04,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:04,207 INFO L475 AbstractCegarLoop]: Abstraction has 489 states and 720 transitions. [2019-09-20 13:28:04,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 720 transitions. [2019-09-20 13:28:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-20 13:28:04,209 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:04,211 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, 1] [2019-09-20 13:28:04,211 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:04,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:04,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1805395323, now seen corresponding path program 1 times [2019-09-20 13:28:04,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:04,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:04,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:04,322 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:28:04,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:04,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:04,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:04,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:04,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:04,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:04,325 INFO L87 Difference]: Start difference. First operand 489 states and 720 transitions. Second operand 4 states. [2019-09-20 13:28:04,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:04,745 INFO L93 Difference]: Finished difference Result 647 states and 954 transitions. [2019-09-20 13:28:04,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:04,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-20 13:28:04,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:04,750 INFO L225 Difference]: With dead ends: 647 [2019-09-20 13:28:04,750 INFO L226 Difference]: Without dead ends: 647 [2019-09-20 13:28:04,750 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:04,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-20 13:28:04,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 539. [2019-09-20 13:28:04,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-09-20 13:28:04,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 790 transitions. [2019-09-20 13:28:04,759 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 790 transitions. Word has length 151 [2019-09-20 13:28:04,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:04,759 INFO L475 AbstractCegarLoop]: Abstraction has 539 states and 790 transitions. [2019-09-20 13:28:04,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:04,759 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 790 transitions. [2019-09-20 13:28:04,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-20 13:28:04,761 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:04,761 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, 1] [2019-09-20 13:28:04,761 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:04,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:04,762 INFO L82 PathProgramCache]: Analyzing trace with hash 369659868, now seen corresponding path program 1 times [2019-09-20 13:28:04,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:04,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:04,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:04,848 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:28:04,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:04,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:04,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:04,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:04,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:04,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:04,850 INFO L87 Difference]: Start difference. First operand 539 states and 790 transitions. Second operand 4 states. [2019-09-20 13:28:05,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:05,244 INFO L93 Difference]: Finished difference Result 647 states and 952 transitions. [2019-09-20 13:28:05,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:05,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-20 13:28:05,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:05,249 INFO L225 Difference]: With dead ends: 647 [2019-09-20 13:28:05,249 INFO L226 Difference]: Without dead ends: 647 [2019-09-20 13:28:05,250 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:05,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-20 13:28:05,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 545. [2019-09-20 13:28:05,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-09-20 13:28:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 800 transitions. [2019-09-20 13:28:05,256 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 800 transitions. Word has length 153 [2019-09-20 13:28:05,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:05,257 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 800 transitions. [2019-09-20 13:28:05,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 800 transitions. [2019-09-20 13:28:05,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-20 13:28:05,259 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:05,259 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, 1] [2019-09-20 13:28:05,259 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:05,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:05,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1784521759, now seen corresponding path program 1 times [2019-09-20 13:28:05,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:05,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:05,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:05,353 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:28:05,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:05,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:05,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:05,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:05,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:05,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:05,355 INFO L87 Difference]: Start difference. First operand 545 states and 800 transitions. Second operand 4 states. [2019-09-20 13:28:05,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:05,728 INFO L93 Difference]: Finished difference Result 631 states and 924 transitions. [2019-09-20 13:28:05,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:05,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-20 13:28:05,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:05,731 INFO L225 Difference]: With dead ends: 631 [2019-09-20 13:28:05,731 INFO L226 Difference]: Without dead ends: 631 [2019-09-20 13:28:05,731 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:05,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-09-20 13:28:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 547. [2019-09-20 13:28:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-20 13:28:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 802 transitions. [2019-09-20 13:28:05,738 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 802 transitions. Word has length 154 [2019-09-20 13:28:05,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:05,738 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 802 transitions. [2019-09-20 13:28:05,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 802 transitions. [2019-09-20 13:28:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-20 13:28:05,740 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:05,740 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, 1] [2019-09-20 13:28:05,740 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:05,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:05,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1442468738, now seen corresponding path program 1 times [2019-09-20 13:28:05,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:05,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:05,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:05,831 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:28:05,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:05,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:05,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:05,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:05,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:05,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:05,832 INFO L87 Difference]: Start difference. First operand 547 states and 802 transitions. Second operand 4 states. [2019-09-20 13:28:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:06,196 INFO L93 Difference]: Finished difference Result 631 states and 922 transitions. [2019-09-20 13:28:06,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:06,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-20 13:28:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:06,200 INFO L225 Difference]: With dead ends: 631 [2019-09-20 13:28:06,200 INFO L226 Difference]: Without dead ends: 631 [2019-09-20 13:28:06,201 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-09-20 13:28:06,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 549. [2019-09-20 13:28:06,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-09-20 13:28:06,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 804 transitions. [2019-09-20 13:28:06,206 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 804 transitions. Word has length 155 [2019-09-20 13:28:06,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:06,207 INFO L475 AbstractCegarLoop]: Abstraction has 549 states and 804 transitions. [2019-09-20 13:28:06,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:06,207 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 804 transitions. [2019-09-20 13:28:06,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-20 13:28:06,208 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:06,209 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, 1] [2019-09-20 13:28:06,209 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:06,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:06,209 INFO L82 PathProgramCache]: Analyzing trace with hash -147724341, now seen corresponding path program 1 times [2019-09-20 13:28:06,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:06,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:06,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:06,299 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:28:06,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:06,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:06,299 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:06,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:06,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:06,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:06,300 INFO L87 Difference]: Start difference. First operand 549 states and 804 transitions. Second operand 4 states. [2019-09-20 13:28:06,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:06,706 INFO L93 Difference]: Finished difference Result 631 states and 920 transitions. [2019-09-20 13:28:06,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:06,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-20 13:28:06,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:06,711 INFO L225 Difference]: With dead ends: 631 [2019-09-20 13:28:06,711 INFO L226 Difference]: Without dead ends: 631 [2019-09-20 13:28:06,712 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:06,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-09-20 13:28:06,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 549. [2019-09-20 13:28:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-09-20 13:28:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 802 transitions. [2019-09-20 13:28:06,718 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 802 transitions. Word has length 156 [2019-09-20 13:28:06,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:06,718 INFO L475 AbstractCegarLoop]: Abstraction has 549 states and 802 transitions. [2019-09-20 13:28:06,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 802 transitions. [2019-09-20 13:28:06,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-20 13:28:06,719 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:06,720 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, 1] [2019-09-20 13:28:06,720 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:06,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:06,720 INFO L82 PathProgramCache]: Analyzing trace with hash 980161255, now seen corresponding path program 1 times [2019-09-20 13:28:06,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:06,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:06,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:06,802 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:28:06,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:06,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:06,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:06,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:06,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:06,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:06,804 INFO L87 Difference]: Start difference. First operand 549 states and 802 transitions. Second operand 4 states. [2019-09-20 13:28:07,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,169 INFO L93 Difference]: Finished difference Result 627 states and 914 transitions. [2019-09-20 13:28:07,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-20 13:28:07,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,171 INFO L225 Difference]: With dead ends: 627 [2019-09-20 13:28:07,172 INFO L226 Difference]: Without dead ends: 627 [2019-09-20 13:28:07,172 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:07,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-09-20 13:28:07,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 551. [2019-09-20 13:28:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-20 13:28:07,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 804 transitions. [2019-09-20 13:28:07,182 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 804 transitions. Word has length 156 [2019-09-20 13:28:07,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,182 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 804 transitions. [2019-09-20 13:28:07,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,182 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 804 transitions. [2019-09-20 13:28:07,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-20 13:28:07,184 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,184 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, 1] [2019-09-20 13:28:07,184 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,186 INFO L82 PathProgramCache]: Analyzing trace with hash 771032646, now seen corresponding path program 1 times [2019-09-20 13:28:07,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,269 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:28:07,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,271 INFO L87 Difference]: Start difference. First operand 551 states and 804 transitions. Second operand 4 states. [2019-09-20 13:28:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,603 INFO L93 Difference]: Finished difference Result 623 states and 906 transitions. [2019-09-20 13:28:07,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-20 13:28:07,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,609 INFO L225 Difference]: With dead ends: 623 [2019-09-20 13:28:07,609 INFO L226 Difference]: Without dead ends: 623 [2019-09-20 13:28:07,610 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-20 13:28:07,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 551. [2019-09-20 13:28:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-20 13:28:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 802 transitions. [2019-09-20 13:28:07,617 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 802 transitions. Word has length 157 [2019-09-20 13:28:07,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,618 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 802 transitions. [2019-09-20 13:28:07,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 802 transitions. [2019-09-20 13:28:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-20 13:28:07,619 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,620 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, 1] [2019-09-20 13:28:07,620 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1245623140, now seen corresponding path program 1 times [2019-09-20 13:28:07,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,697 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:07,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,699 INFO L87 Difference]: Start difference. First operand 551 states and 802 transitions. Second operand 4 states. [2019-09-20 13:28:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,033 INFO L93 Difference]: Finished difference Result 617 states and 896 transitions. [2019-09-20 13:28:08,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-20 13:28:08,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,037 INFO L225 Difference]: With dead ends: 617 [2019-09-20 13:28:08,037 INFO L226 Difference]: Without dead ends: 617 [2019-09-20 13:28:08,037 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:08,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-20 13:28:08,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 553. [2019-09-20 13:28:08,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-09-20 13:28:08,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 804 transitions. [2019-09-20 13:28:08,046 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 804 transitions. Word has length 157 [2019-09-20 13:28:08,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,046 INFO L475 AbstractCegarLoop]: Abstraction has 553 states and 804 transitions. [2019-09-20 13:28:08,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,046 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 804 transitions. [2019-09-20 13:28:08,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-20 13:28:08,047 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,048 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, 1] [2019-09-20 13:28:08,048 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,048 INFO L82 PathProgramCache]: Analyzing trace with hash -35238846, now seen corresponding path program 1 times [2019-09-20 13:28:08,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,135 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:08,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,136 INFO L87 Difference]: Start difference. First operand 553 states and 804 transitions. Second operand 4 states. [2019-09-20 13:28:08,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,468 INFO L93 Difference]: Finished difference Result 617 states and 894 transitions. [2019-09-20 13:28:08,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-20 13:28:08,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,472 INFO L225 Difference]: With dead ends: 617 [2019-09-20 13:28:08,473 INFO L226 Difference]: Without dead ends: 617 [2019-09-20 13:28:08,473 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:08,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-20 13:28:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 555. [2019-09-20 13:28:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-09-20 13:28:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 806 transitions. [2019-09-20 13:28:08,479 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 806 transitions. Word has length 159 [2019-09-20 13:28:08,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,479 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 806 transitions. [2019-09-20 13:28:08,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 806 transitions. [2019-09-20 13:28:08,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-20 13:28:08,480 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,480 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, 1] [2019-09-20 13:28:08,480 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,481 INFO L82 PathProgramCache]: Analyzing trace with hash 953095010, now seen corresponding path program 1 times [2019-09-20 13:28:08,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,567 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:08,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,568 INFO L87 Difference]: Start difference. First operand 555 states and 806 transitions. Second operand 4 states. [2019-09-20 13:28:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,870 INFO L93 Difference]: Finished difference Result 609 states and 882 transitions. [2019-09-20 13:28:08,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-20 13:28:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,874 INFO L225 Difference]: With dead ends: 609 [2019-09-20 13:28:08,875 INFO L226 Difference]: Without dead ends: 609 [2019-09-20 13:28:08,875 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:08,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-09-20 13:28:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 557. [2019-09-20 13:28:08,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-09-20 13:28:08,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 808 transitions. [2019-09-20 13:28:08,881 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 808 transitions. Word has length 160 [2019-09-20 13:28:08,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,881 INFO L475 AbstractCegarLoop]: Abstraction has 557 states and 808 transitions. [2019-09-20 13:28:08,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,881 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 808 transitions. [2019-09-20 13:28:08,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-20 13:28:08,882 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,883 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, 1] [2019-09-20 13:28:08,883 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,883 INFO L82 PathProgramCache]: Analyzing trace with hash -2074125903, now seen corresponding path program 1 times [2019-09-20 13:28:08,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,977 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:08,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,978 INFO L87 Difference]: Start difference. First operand 557 states and 808 transitions. Second operand 4 states. [2019-09-20 13:28:09,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,292 INFO L93 Difference]: Finished difference Result 609 states and 880 transitions. [2019-09-20 13:28:09,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-20 13:28:09,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,295 INFO L225 Difference]: With dead ends: 609 [2019-09-20 13:28:09,296 INFO L226 Difference]: Without dead ends: 609 [2019-09-20 13:28:09,296 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:09,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-09-20 13:28:09,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 559. [2019-09-20 13:28:09,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-20 13:28:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 810 transitions. [2019-09-20 13:28:09,304 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 810 transitions. Word has length 160 [2019-09-20 13:28:09,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,304 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 810 transitions. [2019-09-20 13:28:09,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,305 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 810 transitions. [2019-09-20 13:28:09,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-20 13:28:09,306 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,306 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, 1] [2019-09-20 13:28:09,306 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1968548047, now seen corresponding path program 1 times [2019-09-20 13:28:09,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,416 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:09,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,418 INFO L87 Difference]: Start difference. First operand 559 states and 810 transitions. Second operand 4 states. [2019-09-20 13:28:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,733 INFO L93 Difference]: Finished difference Result 605 states and 874 transitions. [2019-09-20 13:28:09,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-20 13:28:09,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,737 INFO L225 Difference]: With dead ends: 605 [2019-09-20 13:28:09,737 INFO L226 Difference]: Without dead ends: 605 [2019-09-20 13:28:09,738 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:09,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-20 13:28:09,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 561. [2019-09-20 13:28:09,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-09-20 13:28:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 812 transitions. [2019-09-20 13:28:09,747 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 812 transitions. Word has length 161 [2019-09-20 13:28:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,747 INFO L475 AbstractCegarLoop]: Abstraction has 561 states and 812 transitions. [2019-09-20 13:28:09,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,747 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 812 transitions. [2019-09-20 13:28:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-20 13:28:09,749 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,749 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, 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] [2019-09-20 13:28:09,749 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,749 INFO L82 PathProgramCache]: Analyzing trace with hash -306693738, now seen corresponding path program 1 times [2019-09-20 13:28:09,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:09,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,834 INFO L87 Difference]: Start difference. First operand 561 states and 812 transitions. Second operand 4 states. [2019-09-20 13:28:10,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,189 INFO L93 Difference]: Finished difference Result 605 states and 872 transitions. [2019-09-20 13:28:10,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-20 13:28:10,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,193 INFO L225 Difference]: With dead ends: 605 [2019-09-20 13:28:10,193 INFO L226 Difference]: Without dead ends: 605 [2019-09-20 13:28:10,193 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:10,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-20 13:28:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 563. [2019-09-20 13:28:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-09-20 13:28:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 814 transitions. [2019-09-20 13:28:10,199 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 814 transitions. Word has length 162 [2019-09-20 13:28:10,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,199 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 814 transitions. [2019-09-20 13:28:10,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,200 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 814 transitions. [2019-09-20 13:28:10,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-20 13:28:10,201 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,201 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:10,201 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1901377462, now seen corresponding path program 1 times [2019-09-20 13:28:10,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:10,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,292 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,293 INFO L87 Difference]: Start difference. First operand 563 states and 814 transitions. Second operand 4 states. [2019-09-20 13:28:10,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,595 INFO L93 Difference]: Finished difference Result 601 states and 866 transitions. [2019-09-20 13:28:10,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-20 13:28:10,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,599 INFO L225 Difference]: With dead ends: 601 [2019-09-20 13:28:10,599 INFO L226 Difference]: Without dead ends: 601 [2019-09-20 13:28:10,600 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:10,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-20 13:28:10,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 565. [2019-09-20 13:28:10,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-09-20 13:28:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 816 transitions. [2019-09-20 13:28:10,607 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 816 transitions. Word has length 163 [2019-09-20 13:28:10,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,607 INFO L475 AbstractCegarLoop]: Abstraction has 565 states and 816 transitions. [2019-09-20 13:28:10,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,608 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 816 transitions. [2019-09-20 13:28:10,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-20 13:28:10,609 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,609 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, 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:28:10,609 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,609 INFO L82 PathProgramCache]: Analyzing trace with hash -783079604, now seen corresponding path program 1 times [2019-09-20 13:28:10,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-20 13:28:10,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:10,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:10,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:10,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:10,665 INFO L87 Difference]: Start difference. First operand 565 states and 816 transitions. Second operand 3 states. [2019-09-20 13:28:10,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,702 INFO L93 Difference]: Finished difference Result 829 states and 1198 transitions. [2019-09-20 13:28:10,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:10,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-20 13:28:10,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,706 INFO L225 Difference]: With dead ends: 829 [2019-09-20 13:28:10,706 INFO L226 Difference]: Without dead ends: 829 [2019-09-20 13:28:10,706 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:28:10,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2019-09-20 13:28:10,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2019-09-20 13:28:10,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-20 13:28:10,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1198 transitions. [2019-09-20 13:28:10,717 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1198 transitions. Word has length 171 [2019-09-20 13:28:10,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,717 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1198 transitions. [2019-09-20 13:28:10,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:10,717 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1198 transitions. [2019-09-20 13:28:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-20 13:28:10,719 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,719 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:10,719 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,720 INFO L82 PathProgramCache]: Analyzing trace with hash 674806226, now seen corresponding path program 1 times [2019-09-20 13:28:10,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-20 13:28:10,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,793 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,794 INFO L87 Difference]: Start difference. First operand 829 states and 1198 transitions. Second operand 4 states.