java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_srvr.blast.10.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:54:09,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:54:09,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:54:09,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:54:09,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:54:09,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:54:09,224 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:54:09,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:54:09,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:54:09,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:54:09,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:54:09,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:54:09,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:54:09,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:54:09,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:54:09,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:54:09,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:54:09,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:54:09,251 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:54:09,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:54:09,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:54:09,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:54:09,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:54:09,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:54:09,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:54:09,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:54:09,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:54:09,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:54:09,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:54:09,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:54:09,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:54:09,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:54:09,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:54:09,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:54:09,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:54:09,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:54:09,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:54:09,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:54:09,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:54:09,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:54:09,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:54:09,274 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:54:09,290 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:54:09,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:54:09,291 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:54:09,291 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:54:09,292 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:54:09,292 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:54:09,292 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:54:09,293 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:54:09,293 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:54:09,293 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:54:09,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:54:09,294 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:54:09,295 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:54:09,295 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:54:09,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:54:09,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:54:09,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:54:09,296 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:54:09,296 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:54:09,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:54:09,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:54:09,297 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:54:09,297 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:54:09,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:54:09,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:54:09,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:54:09,298 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:54:09,298 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:54:09,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:54:09,298 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:54:09,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:54:09,343 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:54:09,347 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:54:09,349 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:54:09,350 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:54:09,351 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.10.i.cil-2.c [2019-09-09 05:54:09,422 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b7eb1e8b/2ee4bb51fbb14d4790cdc78b38b43fde/FLAGf1d9a5c3f [2019-09-09 05:54:10,084 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:54:10,084 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.10.i.cil-2.c [2019-09-09 05:54:10,123 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b7eb1e8b/2ee4bb51fbb14d4790cdc78b38b43fde/FLAGf1d9a5c3f [2019-09-09 05:54:10,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b7eb1e8b/2ee4bb51fbb14d4790cdc78b38b43fde [2019-09-09 05:54:10,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:54:10,307 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:54:10,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:54:10,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:54:10,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:54:10,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:54:10" (1/1) ... [2019-09-09 05:54:10,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5662abae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:10, skipping insertion in model container [2019-09-09 05:54:10,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:54:10" (1/1) ... [2019-09-09 05:54:10,327 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:54:10,407 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:54:11,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:54:11,052 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:54:11,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:54:11,243 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:54:11,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:11 WrapperNode [2019-09-09 05:54:11,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:54:11,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:54:11,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:54:11,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:54:11,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:11" (1/1) ... [2019-09-09 05:54:11,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:11" (1/1) ... [2019-09-09 05:54:11,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:11" (1/1) ... [2019-09-09 05:54:11,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:11" (1/1) ... [2019-09-09 05:54:11,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:11" (1/1) ... [2019-09-09 05:54:11,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:11" (1/1) ... [2019-09-09 05:54:11,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:11" (1/1) ... [2019-09-09 05:54:11,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:54:11,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:54:11,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:54:11,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:54:11,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:54:11,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:54:11,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:54:11,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-09 05:54:11,474 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-09 05:54:11,474 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:54:11,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:54:11,474 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-09 05:54:11,474 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-09 05:54:11,474 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-09 05:54:11,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:54:11,475 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-09 05:54:11,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:54:11,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:54:11,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:54:11,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:54:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-09 05:54:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-09 05:54:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-09 05:54:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:54:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-09 05:54:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-09 05:54:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-09 05:54:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:54:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-09 05:54:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-09 05:54:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-09 05:54:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-09 05:54:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-09 05:54:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-09 05:54:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:54:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-09 05:54:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-09 05:54:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-09 05:54:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:54:11,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-09 05:54:11,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-09 05:54:11,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-09 05:54:11,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-09 05:54:11,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-09 05:54:11,986 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:54:12,737 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-09 05:54:12,738 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-09 05:54:12,764 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:54:12,764 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:54:12,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:54:12 BoogieIcfgContainer [2019-09-09 05:54:12,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:54:12,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:54:12,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:54:12,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:54:12,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:54:10" (1/3) ... [2019-09-09 05:54:12,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58554779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:54:12, skipping insertion in model container [2019-09-09 05:54:12,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:11" (2/3) ... [2019-09-09 05:54:12,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58554779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:54:12, skipping insertion in model container [2019-09-09 05:54:12,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:54:12" (3/3) ... [2019-09-09 05:54:12,776 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-2.c [2019-09-09 05:54:12,786 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:54:12,795 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:54:12,812 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:54:12,848 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:54:12,848 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:54:12,848 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:54:12,848 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:54:12,848 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:54:12,849 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:54:12,849 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:54:12,849 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:54:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-09-09 05:54:12,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-09 05:54:12,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:12,882 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:12,885 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:12,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:12,891 INFO L82 PathProgramCache]: Analyzing trace with hash 345716245, now seen corresponding path program 1 times [2019-09-09 05:54:12,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:12,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:12,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:12,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:12,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:13,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:13,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:13,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:13,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:13,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:13,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:13,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:13,276 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 4 states. [2019-09-09 05:54:13,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:13,713 INFO L93 Difference]: Finished difference Result 187 states and 304 transitions. [2019-09-09 05:54:13,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:13,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-09-09 05:54:13,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:13,729 INFO L225 Difference]: With dead ends: 187 [2019-09-09 05:54:13,729 INFO L226 Difference]: Without dead ends: 166 [2019-09-09 05:54:13,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:13,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-09 05:54:13,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2019-09-09 05:54:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-09 05:54:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 226 transitions. [2019-09-09 05:54:13,786 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 226 transitions. Word has length 47 [2019-09-09 05:54:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:13,787 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 226 transitions. [2019-09-09 05:54:13,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 226 transitions. [2019-09-09 05:54:13,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-09 05:54:13,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:13,791 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:13,791 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:13,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:13,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1955407513, now seen corresponding path program 1 times [2019-09-09 05:54:13,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:13,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:13,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:13,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:13,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:13,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:13,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:13,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:13,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:13,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:13,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:13,929 INFO L87 Difference]: Start difference. First operand 149 states and 226 transitions. Second operand 4 states. [2019-09-09 05:54:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:14,279 INFO L93 Difference]: Finished difference Result 166 states and 246 transitions. [2019-09-09 05:54:14,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:14,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-09-09 05:54:14,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:14,282 INFO L225 Difference]: With dead ends: 166 [2019-09-09 05:54:14,285 INFO L226 Difference]: Without dead ends: 166 [2019-09-09 05:54:14,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:14,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-09 05:54:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2019-09-09 05:54:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-09 05:54:14,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 225 transitions. [2019-09-09 05:54:14,312 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 225 transitions. Word has length 60 [2019-09-09 05:54:14,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:14,313 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 225 transitions. [2019-09-09 05:54:14,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:14,313 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 225 transitions. [2019-09-09 05:54:14,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-09 05:54:14,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:14,320 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:14,320 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:14,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:14,321 INFO L82 PathProgramCache]: Analyzing trace with hash -68451969, now seen corresponding path program 1 times [2019-09-09 05:54:14,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:14,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:14,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:14,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:14,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:14,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:14,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:14,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:14,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:14,436 INFO L87 Difference]: Start difference. First operand 149 states and 225 transitions. Second operand 4 states. [2019-09-09 05:54:14,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:14,775 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2019-09-09 05:54:14,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:14,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-09-09 05:54:14,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:14,778 INFO L225 Difference]: With dead ends: 165 [2019-09-09 05:54:14,778 INFO L226 Difference]: Without dead ends: 165 [2019-09-09 05:54:14,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:14,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-09 05:54:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2019-09-09 05:54:14,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-09 05:54:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2019-09-09 05:54:14,788 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 61 [2019-09-09 05:54:14,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:14,788 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2019-09-09 05:54:14,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:14,789 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2019-09-09 05:54:14,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-09 05:54:14,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:14,791 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:14,791 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:14,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:14,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1072073965, now seen corresponding path program 1 times [2019-09-09 05:54:14,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:14,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:14,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:14,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:14,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:54:14,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:14,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:54:14,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:54:14,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:14,894 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand 5 states. [2019-09-09 05:54:15,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:15,471 INFO L93 Difference]: Finished difference Result 170 states and 252 transitions. [2019-09-09 05:54:15,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:54:15,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-09 05:54:15,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:15,474 INFO L225 Difference]: With dead ends: 170 [2019-09-09 05:54:15,474 INFO L226 Difference]: Without dead ends: 170 [2019-09-09 05:54:15,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:54:15,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-09 05:54:15,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-09-09 05:54:15,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-09 05:54:15,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 251 transitions. [2019-09-09 05:54:15,484 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 251 transitions. Word has length 61 [2019-09-09 05:54:15,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:15,484 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 251 transitions. [2019-09-09 05:54:15,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:54:15,484 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 251 transitions. [2019-09-09 05:54:15,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-09 05:54:15,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:15,486 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:15,487 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:15,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:15,487 INFO L82 PathProgramCache]: Analyzing trace with hash 958204619, now seen corresponding path program 1 times [2019-09-09 05:54:15,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:15,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:15,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:15,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:15,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:15,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:15,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:15,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:15,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:15,570 INFO L87 Difference]: Start difference. First operand 169 states and 251 transitions. Second operand 4 states. [2019-09-09 05:54:15,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:15,937 INFO L93 Difference]: Finished difference Result 184 states and 268 transitions. [2019-09-09 05:54:15,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:15,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-09-09 05:54:15,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:15,939 INFO L225 Difference]: With dead ends: 184 [2019-09-09 05:54:15,939 INFO L226 Difference]: Without dead ends: 184 [2019-09-09 05:54:15,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:15,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-09 05:54:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 169. [2019-09-09 05:54:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-09 05:54:15,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 250 transitions. [2019-09-09 05:54:15,948 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 250 transitions. Word has length 61 [2019-09-09 05:54:15,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:15,948 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 250 transitions. [2019-09-09 05:54:15,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:15,948 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 250 transitions. [2019-09-09 05:54:15,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-09 05:54:15,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:15,951 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:15,951 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:15,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:15,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1678734262, now seen corresponding path program 1 times [2019-09-09 05:54:15,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:15,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:15,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:16,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:16,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:16,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:16,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:16,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:16,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:16,014 INFO L87 Difference]: Start difference. First operand 169 states and 250 transitions. Second operand 4 states. [2019-09-09 05:54:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:16,295 INFO L93 Difference]: Finished difference Result 182 states and 265 transitions. [2019-09-09 05:54:16,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:16,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-09-09 05:54:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:16,298 INFO L225 Difference]: With dead ends: 182 [2019-09-09 05:54:16,298 INFO L226 Difference]: Without dead ends: 182 [2019-09-09 05:54:16,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:16,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-09 05:54:16,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 169. [2019-09-09 05:54:16,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-09 05:54:16,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 249 transitions. [2019-09-09 05:54:16,305 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 249 transitions. Word has length 61 [2019-09-09 05:54:16,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:16,306 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 249 transitions. [2019-09-09 05:54:16,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 249 transitions. [2019-09-09 05:54:16,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:54:16,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:16,307 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:16,307 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:16,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:16,308 INFO L82 PathProgramCache]: Analyzing trace with hash -636130140, now seen corresponding path program 1 times [2019-09-09 05:54:16,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:16,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:16,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:16,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:16,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:16,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:16,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:16,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:16,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:16,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:16,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:16,369 INFO L87 Difference]: Start difference. First operand 169 states and 249 transitions. Second operand 4 states. [2019-09-09 05:54:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:16,660 INFO L93 Difference]: Finished difference Result 182 states and 264 transitions. [2019-09-09 05:54:16,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:16,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-09 05:54:16,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:16,662 INFO L225 Difference]: With dead ends: 182 [2019-09-09 05:54:16,663 INFO L226 Difference]: Without dead ends: 182 [2019-09-09 05:54:16,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:16,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-09 05:54:16,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 169. [2019-09-09 05:54:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-09 05:54:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 248 transitions. [2019-09-09 05:54:16,669 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 248 transitions. Word has length 62 [2019-09-09 05:54:16,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:16,669 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 248 transitions. [2019-09-09 05:54:16,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:16,670 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 248 transitions. [2019-09-09 05:54:16,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:54:16,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:16,671 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:16,671 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:16,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:16,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1324278791, now seen corresponding path program 1 times [2019-09-09 05:54:16,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:16,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:16,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:16,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:16,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:16,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:16,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:16,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:16,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:16,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:16,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:16,751 INFO L87 Difference]: Start difference. First operand 169 states and 248 transitions. Second operand 4 states. [2019-09-09 05:54:17,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:17,071 INFO L93 Difference]: Finished difference Result 182 states and 263 transitions. [2019-09-09 05:54:17,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:17,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:54:17,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:17,074 INFO L225 Difference]: With dead ends: 182 [2019-09-09 05:54:17,075 INFO L226 Difference]: Without dead ends: 182 [2019-09-09 05:54:17,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:17,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-09 05:54:17,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 169. [2019-09-09 05:54:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-09 05:54:17,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 247 transitions. [2019-09-09 05:54:17,082 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 247 transitions. Word has length 63 [2019-09-09 05:54:17,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:17,082 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 247 transitions. [2019-09-09 05:54:17,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:17,082 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 247 transitions. [2019-09-09 05:54:17,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:54:17,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:17,084 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:17,084 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:17,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:17,084 INFO L82 PathProgramCache]: Analyzing trace with hash 345644319, now seen corresponding path program 1 times [2019-09-09 05:54:17,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:17,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:17,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:17,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:17,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:17,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:17,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:17,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:17,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:17,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:17,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:17,152 INFO L87 Difference]: Start difference. First operand 169 states and 247 transitions. Second operand 4 states. [2019-09-09 05:54:17,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:17,468 INFO L93 Difference]: Finished difference Result 182 states and 262 transitions. [2019-09-09 05:54:17,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:17,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-09 05:54:17,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:17,470 INFO L225 Difference]: With dead ends: 182 [2019-09-09 05:54:17,470 INFO L226 Difference]: Without dead ends: 182 [2019-09-09 05:54:17,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:17,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-09 05:54:17,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 169. [2019-09-09 05:54:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-09 05:54:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 246 transitions. [2019-09-09 05:54:17,476 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 246 transitions. Word has length 64 [2019-09-09 05:54:17,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:17,477 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 246 transitions. [2019-09-09 05:54:17,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:17,477 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 246 transitions. [2019-09-09 05:54:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:54:17,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:17,478 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:17,478 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:17,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:17,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1491452098, now seen corresponding path program 1 times [2019-09-09 05:54:17,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:17,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:17,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:17,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:17,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:17,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:17,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:17,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:17,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:17,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:17,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:17,543 INFO L87 Difference]: Start difference. First operand 169 states and 246 transitions. Second operand 4 states. [2019-09-09 05:54:17,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:17,850 INFO L93 Difference]: Finished difference Result 211 states and 308 transitions. [2019-09-09 05:54:17,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:17,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-09 05:54:17,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:17,853 INFO L225 Difference]: With dead ends: 211 [2019-09-09 05:54:17,853 INFO L226 Difference]: Without dead ends: 211 [2019-09-09 05:54:17,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:17,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-09 05:54:17,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 191. [2019-09-09 05:54:17,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-09 05:54:17,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 283 transitions. [2019-09-09 05:54:17,860 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 283 transitions. Word has length 64 [2019-09-09 05:54:17,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:17,861 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 283 transitions. [2019-09-09 05:54:17,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:17,861 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 283 transitions. [2019-09-09 05:54:17,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:54:17,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:17,862 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:17,862 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:17,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:17,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1549022430, now seen corresponding path program 1 times [2019-09-09 05:54:17,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:17,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:17,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:17,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:17,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:17,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:17,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:17,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:17,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:17,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:17,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:17,927 INFO L87 Difference]: Start difference. First operand 191 states and 283 transitions. Second operand 4 states. [2019-09-09 05:54:18,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:18,186 INFO L93 Difference]: Finished difference Result 194 states and 286 transitions. [2019-09-09 05:54:18,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:18,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-09 05:54:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:18,188 INFO L225 Difference]: With dead ends: 194 [2019-09-09 05:54:18,189 INFO L226 Difference]: Without dead ends: 194 [2019-09-09 05:54:18,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:18,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-09 05:54:18,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-09-09 05:54:18,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-09 05:54:18,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 282 transitions. [2019-09-09 05:54:18,195 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 282 transitions. Word has length 65 [2019-09-09 05:54:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:18,197 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 282 transitions. [2019-09-09 05:54:18,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 282 transitions. [2019-09-09 05:54:18,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-09 05:54:18,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:18,198 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:18,199 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:18,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:18,199 INFO L82 PathProgramCache]: Analyzing trace with hash 938457822, now seen corresponding path program 1 times [2019-09-09 05:54:18,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:18,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:18,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:18,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:18,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:18,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:18,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:18,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:18,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:18,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:18,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:18,283 INFO L87 Difference]: Start difference. First operand 191 states and 282 transitions. Second operand 4 states. [2019-09-09 05:54:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:18,614 INFO L93 Difference]: Finished difference Result 211 states and 306 transitions. [2019-09-09 05:54:18,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:18,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-09 05:54:18,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:18,616 INFO L225 Difference]: With dead ends: 211 [2019-09-09 05:54:18,617 INFO L226 Difference]: Without dead ends: 211 [2019-09-09 05:54:18,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:18,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-09 05:54:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 191. [2019-09-09 05:54:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-09 05:54:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 281 transitions. [2019-09-09 05:54:18,631 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 281 transitions. Word has length 77 [2019-09-09 05:54:18,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:18,631 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 281 transitions. [2019-09-09 05:54:18,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 281 transitions. [2019-09-09 05:54:18,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-09 05:54:18,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:18,635 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:18,635 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:18,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:18,636 INFO L82 PathProgramCache]: Analyzing trace with hash 473716788, now seen corresponding path program 1 times [2019-09-09 05:54:18,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:18,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:18,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:18,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:18,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:18,730 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:18,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:18,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:18,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:18,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:18,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:18,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:18,739 INFO L87 Difference]: Start difference. First operand 191 states and 281 transitions. Second operand 4 states. [2019-09-09 05:54:19,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:19,060 INFO L93 Difference]: Finished difference Result 210 states and 304 transitions. [2019-09-09 05:54:19,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:19,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-09 05:54:19,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:19,062 INFO L225 Difference]: With dead ends: 210 [2019-09-09 05:54:19,062 INFO L226 Difference]: Without dead ends: 210 [2019-09-09 05:54:19,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:19,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-09 05:54:19,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 191. [2019-09-09 05:54:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-09 05:54:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 280 transitions. [2019-09-09 05:54:19,069 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 280 transitions. Word has length 78 [2019-09-09 05:54:19,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:19,069 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 280 transitions. [2019-09-09 05:54:19,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:19,069 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 280 transitions. [2019-09-09 05:54:19,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-09 05:54:19,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:19,071 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:19,071 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:19,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:19,072 INFO L82 PathProgramCache]: Analyzing trace with hash 2131745203, now seen corresponding path program 1 times [2019-09-09 05:54:19,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:19,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:19,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:19,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:19,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:19,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:19,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:19,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:19,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:19,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:19,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:19,130 INFO L87 Difference]: Start difference. First operand 191 states and 280 transitions. Second operand 4 states. [2019-09-09 05:54:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:19,433 INFO L93 Difference]: Finished difference Result 208 states and 301 transitions. [2019-09-09 05:54:19,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:19,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-09 05:54:19,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:19,435 INFO L225 Difference]: With dead ends: 208 [2019-09-09 05:54:19,436 INFO L226 Difference]: Without dead ends: 208 [2019-09-09 05:54:19,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:19,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-09 05:54:19,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-09-09 05:54:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-09 05:54:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 279 transitions. [2019-09-09 05:54:19,443 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 279 transitions. Word has length 78 [2019-09-09 05:54:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:19,443 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 279 transitions. [2019-09-09 05:54:19,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 279 transitions. [2019-09-09 05:54:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:54:19,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:19,445 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:19,445 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:19,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:19,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1524616283, now seen corresponding path program 1 times [2019-09-09 05:54:19,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:19,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:19,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:19,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:19,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:19,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:19,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:19,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:19,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:19,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:19,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:19,527 INFO L87 Difference]: Start difference. First operand 191 states and 279 transitions. Second operand 4 states. [2019-09-09 05:54:19,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:19,836 INFO L93 Difference]: Finished difference Result 208 states and 300 transitions. [2019-09-09 05:54:19,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:19,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-09 05:54:19,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:19,838 INFO L225 Difference]: With dead ends: 208 [2019-09-09 05:54:19,839 INFO L226 Difference]: Without dead ends: 208 [2019-09-09 05:54:19,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-09 05:54:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-09-09 05:54:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-09 05:54:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 278 transitions. [2019-09-09 05:54:19,850 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 278 transitions. Word has length 79 [2019-09-09 05:54:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:19,851 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 278 transitions. [2019-09-09 05:54:19,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 278 transitions. [2019-09-09 05:54:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:54:19,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:19,853 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:19,853 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:19,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:19,853 INFO L82 PathProgramCache]: Analyzing trace with hash -412058832, now seen corresponding path program 1 times [2019-09-09 05:54:19,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:19,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:19,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:19,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:19,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:19,949 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:19,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:19,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:19,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:19,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:19,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:19,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:19,952 INFO L87 Difference]: Start difference. First operand 191 states and 278 transitions. Second operand 4 states. [2019-09-09 05:54:20,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:20,262 INFO L93 Difference]: Finished difference Result 208 states and 299 transitions. [2019-09-09 05:54:20,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:20,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:54:20,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:20,264 INFO L225 Difference]: With dead ends: 208 [2019-09-09 05:54:20,264 INFO L226 Difference]: Without dead ends: 208 [2019-09-09 05:54:20,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-09 05:54:20,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-09-09 05:54:20,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-09 05:54:20,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 277 transitions. [2019-09-09 05:54:20,270 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 277 transitions. Word has length 80 [2019-09-09 05:54:20,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:20,270 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 277 transitions. [2019-09-09 05:54:20,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:20,270 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 277 transitions. [2019-09-09 05:54:20,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 05:54:20,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:20,271 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:20,272 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:20,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:20,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1941214442, now seen corresponding path program 1 times [2019-09-09 05:54:20,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:20,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:20,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:20,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:20,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:20,337 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:20,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:20,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:20,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:20,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:20,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:20,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:20,339 INFO L87 Difference]: Start difference. First operand 191 states and 277 transitions. Second operand 4 states. [2019-09-09 05:54:20,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:20,608 INFO L93 Difference]: Finished difference Result 208 states and 298 transitions. [2019-09-09 05:54:20,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:20,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-09 05:54:20,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:20,610 INFO L225 Difference]: With dead ends: 208 [2019-09-09 05:54:20,610 INFO L226 Difference]: Without dead ends: 208 [2019-09-09 05:54:20,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-09 05:54:20,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-09-09 05:54:20,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-09 05:54:20,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 276 transitions. [2019-09-09 05:54:20,615 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 276 transitions. Word has length 81 [2019-09-09 05:54:20,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:20,616 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 276 transitions. [2019-09-09 05:54:20,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:20,616 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 276 transitions. [2019-09-09 05:54:20,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-09 05:54:20,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:20,617 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:20,617 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:20,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:20,618 INFO L82 PathProgramCache]: Analyzing trace with hash 572800011, now seen corresponding path program 1 times [2019-09-09 05:54:20,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:20,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:20,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:20,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:20,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:20,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:20,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:20,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:20,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:20,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:20,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:20,679 INFO L87 Difference]: Start difference. First operand 191 states and 276 transitions. Second operand 4 states. [2019-09-09 05:54:20,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:20,925 INFO L93 Difference]: Finished difference Result 198 states and 285 transitions. [2019-09-09 05:54:20,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:20,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-09 05:54:20,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:20,927 INFO L225 Difference]: With dead ends: 198 [2019-09-09 05:54:20,927 INFO L226 Difference]: Without dead ends: 198 [2019-09-09 05:54:20,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:20,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-09 05:54:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2019-09-09 05:54:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-09 05:54:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 275 transitions. [2019-09-09 05:54:20,934 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 275 transitions. Word has length 82 [2019-09-09 05:54:20,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:20,935 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 275 transitions. [2019-09-09 05:54:20,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:20,935 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 275 transitions. [2019-09-09 05:54:20,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-09 05:54:20,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:20,937 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:20,937 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:20,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:20,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1238796643, now seen corresponding path program 1 times [2019-09-09 05:54:20,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:20,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:20,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:20,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:20,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:21,024 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:21,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:21,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:21,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:21,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:21,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:21,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:21,026 INFO L87 Difference]: Start difference. First operand 191 states and 275 transitions. Second operand 4 states. [2019-09-09 05:54:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:21,522 INFO L93 Difference]: Finished difference Result 295 states and 432 transitions. [2019-09-09 05:54:21,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:21,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-09 05:54:21,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:21,525 INFO L225 Difference]: With dead ends: 295 [2019-09-09 05:54:21,525 INFO L226 Difference]: Without dead ends: 295 [2019-09-09 05:54:21,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:21,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-09 05:54:21,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 232. [2019-09-09 05:54:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-09 05:54:21,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 348 transitions. [2019-09-09 05:54:21,532 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 348 transitions. Word has length 86 [2019-09-09 05:54:21,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:21,532 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 348 transitions. [2019-09-09 05:54:21,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:21,532 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 348 transitions. [2019-09-09 05:54:21,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-09 05:54:21,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:21,534 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:21,534 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:21,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:21,534 INFO L82 PathProgramCache]: Analyzing trace with hash -606570523, now seen corresponding path program 1 times [2019-09-09 05:54:21,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:21,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:21,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:21,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:21,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:21,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:21,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:21,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:21,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:21,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:21,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:21,597 INFO L87 Difference]: Start difference. First operand 232 states and 348 transitions. Second operand 4 states. [2019-09-09 05:54:21,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:21,970 INFO L93 Difference]: Finished difference Result 280 states and 419 transitions. [2019-09-09 05:54:21,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:21,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-09 05:54:21,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:21,973 INFO L225 Difference]: With dead ends: 280 [2019-09-09 05:54:21,973 INFO L226 Difference]: Without dead ends: 280 [2019-09-09 05:54:21,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-09 05:54:21,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2019-09-09 05:54:21,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-09 05:54:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 389 transitions. [2019-09-09 05:54:21,982 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 389 transitions. Word has length 86 [2019-09-09 05:54:21,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:21,982 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 389 transitions. [2019-09-09 05:54:21,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:21,983 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 389 transitions. [2019-09-09 05:54:21,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-09 05:54:21,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:21,984 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:21,985 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:21,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:21,985 INFO L82 PathProgramCache]: Analyzing trace with hash -258512513, now seen corresponding path program 1 times [2019-09-09 05:54:21,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:21,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:21,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:21,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:21,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:22,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:22,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:22,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:22,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:22,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:22,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:22,100 INFO L87 Difference]: Start difference. First operand 256 states and 389 transitions. Second operand 4 states. [2019-09-09 05:54:22,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:22,537 INFO L93 Difference]: Finished difference Result 313 states and 465 transitions. [2019-09-09 05:54:22,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:22,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-09 05:54:22,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:22,543 INFO L225 Difference]: With dead ends: 313 [2019-09-09 05:54:22,543 INFO L226 Difference]: Without dead ends: 313 [2019-09-09 05:54:22,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:22,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-09 05:54:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 257. [2019-09-09 05:54:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-09 05:54:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 390 transitions. [2019-09-09 05:54:22,552 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 390 transitions. Word has length 87 [2019-09-09 05:54:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:22,553 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 390 transitions. [2019-09-09 05:54:22,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:22,553 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 390 transitions. [2019-09-09 05:54:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-09 05:54:22,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:22,554 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:22,555 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:22,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:22,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1475750695, now seen corresponding path program 1 times [2019-09-09 05:54:22,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:22,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:22,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:22,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:22,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:22,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:22,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:22,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:22,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:22,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:22,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:22,637 INFO L87 Difference]: Start difference. First operand 257 states and 390 transitions. Second operand 4 states. [2019-09-09 05:54:23,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:23,103 INFO L93 Difference]: Finished difference Result 313 states and 464 transitions. [2019-09-09 05:54:23,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:23,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-09-09 05:54:23,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:23,107 INFO L225 Difference]: With dead ends: 313 [2019-09-09 05:54:23,107 INFO L226 Difference]: Without dead ends: 313 [2019-09-09 05:54:23,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:23,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-09 05:54:23,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 257. [2019-09-09 05:54:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-09 05:54:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 389 transitions. [2019-09-09 05:54:23,113 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 389 transitions. Word has length 99 [2019-09-09 05:54:23,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:23,113 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 389 transitions. [2019-09-09 05:54:23,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 389 transitions. [2019-09-09 05:54:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-09 05:54:23,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:23,115 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:23,115 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:23,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:23,116 INFO L82 PathProgramCache]: Analyzing trace with hash 62589335, now seen corresponding path program 1 times [2019-09-09 05:54:23,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:23,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:23,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:23,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:23,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:23,180 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:23,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:23,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:23,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:23,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:23,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:23,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:23,182 INFO L87 Difference]: Start difference. First operand 257 states and 389 transitions. Second operand 4 states. [2019-09-09 05:54:23,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:23,542 INFO L93 Difference]: Finished difference Result 281 states and 418 transitions. [2019-09-09 05:54:23,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:23,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-09-09 05:54:23,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:23,545 INFO L225 Difference]: With dead ends: 281 [2019-09-09 05:54:23,545 INFO L226 Difference]: Without dead ends: 281 [2019-09-09 05:54:23,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:23,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-09 05:54:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 257. [2019-09-09 05:54:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-09 05:54:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 388 transitions. [2019-09-09 05:54:23,554 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 388 transitions. Word has length 99 [2019-09-09 05:54:23,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:23,554 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 388 transitions. [2019-09-09 05:54:23,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 388 transitions. [2019-09-09 05:54:23,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-09 05:54:23,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:23,556 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:23,556 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:23,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:23,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1352303207, now seen corresponding path program 1 times [2019-09-09 05:54:23,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:23,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:23,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:23,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:23,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:23,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:23,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:23,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:23,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:23,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:23,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:23,632 INFO L87 Difference]: Start difference. First operand 257 states and 388 transitions. Second operand 4 states. [2019-09-09 05:54:24,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:24,170 INFO L93 Difference]: Finished difference Result 312 states and 461 transitions. [2019-09-09 05:54:24,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:24,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-09 05:54:24,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:24,174 INFO L225 Difference]: With dead ends: 312 [2019-09-09 05:54:24,174 INFO L226 Difference]: Without dead ends: 312 [2019-09-09 05:54:24,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:24,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-09-09 05:54:24,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 257. [2019-09-09 05:54:24,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-09 05:54:24,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 387 transitions. [2019-09-09 05:54:24,186 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 387 transitions. Word has length 100 [2019-09-09 05:54:24,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:24,186 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 387 transitions. [2019-09-09 05:54:24,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 387 transitions. [2019-09-09 05:54:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-09 05:54:24,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:24,191 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:24,191 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:24,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:24,192 INFO L82 PathProgramCache]: Analyzing trace with hash 305725208, now seen corresponding path program 1 times [2019-09-09 05:54:24,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:24,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:24,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:24,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:24,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:24,303 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:24,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:24,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:24,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:24,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:24,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:24,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:24,305 INFO L87 Difference]: Start difference. First operand 257 states and 387 transitions. Second operand 4 states. [2019-09-09 05:54:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:24,773 INFO L93 Difference]: Finished difference Result 310 states and 458 transitions. [2019-09-09 05:54:24,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:24,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-09 05:54:24,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:24,776 INFO L225 Difference]: With dead ends: 310 [2019-09-09 05:54:24,776 INFO L226 Difference]: Without dead ends: 310 [2019-09-09 05:54:24,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:24,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-09 05:54:24,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 257. [2019-09-09 05:54:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-09 05:54:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 386 transitions. [2019-09-09 05:54:24,784 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 386 transitions. Word has length 100 [2019-09-09 05:54:24,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:24,784 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 386 transitions. [2019-09-09 05:54:24,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 386 transitions. [2019-09-09 05:54:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-09 05:54:24,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:24,786 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:24,786 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:24,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:24,787 INFO L82 PathProgramCache]: Analyzing trace with hash -908402533, now seen corresponding path program 1 times [2019-09-09 05:54:24,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:24,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:24,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:24,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:24,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:24,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:24,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:24,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:24,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:24,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:24,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:24,856 INFO L87 Difference]: Start difference. First operand 257 states and 386 transitions. Second operand 4 states. [2019-09-09 05:54:25,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:25,188 INFO L93 Difference]: Finished difference Result 280 states and 414 transitions. [2019-09-09 05:54:25,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:25,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-09 05:54:25,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:25,190 INFO L225 Difference]: With dead ends: 280 [2019-09-09 05:54:25,191 INFO L226 Difference]: Without dead ends: 280 [2019-09-09 05:54:25,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:25,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-09 05:54:25,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 257. [2019-09-09 05:54:25,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-09 05:54:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 385 transitions. [2019-09-09 05:54:25,198 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 385 transitions. Word has length 100 [2019-09-09 05:54:25,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:25,198 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 385 transitions. [2019-09-09 05:54:25,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 385 transitions. [2019-09-09 05:54:25,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-09 05:54:25,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:25,200 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:25,201 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:25,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:25,201 INFO L82 PathProgramCache]: Analyzing trace with hash 749625882, now seen corresponding path program 1 times [2019-09-09 05:54:25,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:25,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:25,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:25,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:25,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:25,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:25,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:25,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:25,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:25,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:25,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:25,298 INFO L87 Difference]: Start difference. First operand 257 states and 385 transitions. Second operand 4 states. [2019-09-09 05:54:25,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:25,579 INFO L93 Difference]: Finished difference Result 278 states and 411 transitions. [2019-09-09 05:54:25,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:25,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-09 05:54:25,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:25,584 INFO L225 Difference]: With dead ends: 278 [2019-09-09 05:54:25,584 INFO L226 Difference]: Without dead ends: 278 [2019-09-09 05:54:25,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:25,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-09 05:54:25,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-09-09 05:54:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-09 05:54:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 384 transitions. [2019-09-09 05:54:25,591 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 384 transitions. Word has length 100 [2019-09-09 05:54:25,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:25,591 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 384 transitions. [2019-09-09 05:54:25,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:25,591 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 384 transitions. [2019-09-09 05:54:25,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:54:25,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:25,593 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:25,593 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:25,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:25,593 INFO L82 PathProgramCache]: Analyzing trace with hash 752571286, now seen corresponding path program 1 times [2019-09-09 05:54:25,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:25,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:25,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:25,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:25,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:25,650 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:25,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:25,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:25,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:25,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:25,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:25,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:25,651 INFO L87 Difference]: Start difference. First operand 257 states and 384 transitions. Second operand 4 states. [2019-09-09 05:54:26,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:26,032 INFO L93 Difference]: Finished difference Result 310 states and 455 transitions. [2019-09-09 05:54:26,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:26,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-09 05:54:26,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:26,036 INFO L225 Difference]: With dead ends: 310 [2019-09-09 05:54:26,036 INFO L226 Difference]: Without dead ends: 310 [2019-09-09 05:54:26,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:26,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-09 05:54:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 257. [2019-09-09 05:54:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-09 05:54:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 383 transitions. [2019-09-09 05:54:26,044 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 383 transitions. Word has length 101 [2019-09-09 05:54:26,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:26,044 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 383 transitions. [2019-09-09 05:54:26,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 383 transitions. [2019-09-09 05:54:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:54:26,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:26,046 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:26,047 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:26,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:26,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1628590292, now seen corresponding path program 1 times [2019-09-09 05:54:26,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:26,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:26,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:26,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:26,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:26,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:26,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:26,104 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:26,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:26,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:26,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:26,107 INFO L87 Difference]: Start difference. First operand 257 states and 383 transitions. Second operand 4 states. [2019-09-09 05:54:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:26,422 INFO L93 Difference]: Finished difference Result 278 states and 409 transitions. [2019-09-09 05:54:26,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:26,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-09 05:54:26,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:26,425 INFO L225 Difference]: With dead ends: 278 [2019-09-09 05:54:26,425 INFO L226 Difference]: Without dead ends: 278 [2019-09-09 05:54:26,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:26,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-09 05:54:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-09-09 05:54:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-09 05:54:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 382 transitions. [2019-09-09 05:54:26,433 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 382 transitions. Word has length 101 [2019-09-09 05:54:26,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:26,434 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 382 transitions. [2019-09-09 05:54:26,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 382 transitions. [2019-09-09 05:54:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:54:26,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:26,436 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:26,436 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:26,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:26,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1424350037, now seen corresponding path program 1 times [2019-09-09 05:54:26,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:26,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:26,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:26,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:26,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:26,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:26,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:26,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:26,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:26,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:26,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:26,518 INFO L87 Difference]: Start difference. First operand 257 states and 382 transitions. Second operand 4 states. [2019-09-09 05:54:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:26,902 INFO L93 Difference]: Finished difference Result 310 states and 453 transitions. [2019-09-09 05:54:26,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:26,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:54:26,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:26,905 INFO L225 Difference]: With dead ends: 310 [2019-09-09 05:54:26,905 INFO L226 Difference]: Without dead ends: 310 [2019-09-09 05:54:26,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-09 05:54:26,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 257. [2019-09-09 05:54:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-09 05:54:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 381 transitions. [2019-09-09 05:54:26,912 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 381 transitions. Word has length 102 [2019-09-09 05:54:26,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:26,912 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 381 transitions. [2019-09-09 05:54:26,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:26,913 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 381 transitions. [2019-09-09 05:54:26,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:54:26,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:26,914 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:26,914 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:26,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:26,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1483831849, now seen corresponding path program 1 times [2019-09-09 05:54:26,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:26,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:26,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:26,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:26,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:26,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:26,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:26,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:26,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:26,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:26,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:26,971 INFO L87 Difference]: Start difference. First operand 257 states and 381 transitions. Second operand 4 states. [2019-09-09 05:54:27,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:27,247 INFO L93 Difference]: Finished difference Result 278 states and 407 transitions. [2019-09-09 05:54:27,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:27,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:54:27,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:27,250 INFO L225 Difference]: With dead ends: 278 [2019-09-09 05:54:27,250 INFO L226 Difference]: Without dead ends: 278 [2019-09-09 05:54:27,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-09 05:54:27,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-09-09 05:54:27,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-09 05:54:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 380 transitions. [2019-09-09 05:54:27,257 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 380 transitions. Word has length 102 [2019-09-09 05:54:27,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:27,257 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 380 transitions. [2019-09-09 05:54:27,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 380 transitions. [2019-09-09 05:54:27,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:54:27,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:27,259 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:27,259 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:27,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:27,260 INFO L82 PathProgramCache]: Analyzing trace with hash -847114351, now seen corresponding path program 1 times [2019-09-09 05:54:27,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:27,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:27,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:27,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:27,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:27,328 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:27,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:27,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:27,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:27,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:27,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:27,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:27,331 INFO L87 Difference]: Start difference. First operand 257 states and 380 transitions. Second operand 4 states. [2019-09-09 05:54:27,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:27,716 INFO L93 Difference]: Finished difference Result 310 states and 451 transitions. [2019-09-09 05:54:27,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:27,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:54:27,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:27,718 INFO L225 Difference]: With dead ends: 310 [2019-09-09 05:54:27,718 INFO L226 Difference]: Without dead ends: 310 [2019-09-09 05:54:27,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:27,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-09 05:54:27,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 257. [2019-09-09 05:54:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-09 05:54:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 379 transitions. [2019-09-09 05:54:27,724 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 379 transitions. Word has length 103 [2019-09-09 05:54:27,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:27,724 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 379 transitions. [2019-09-09 05:54:27,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 379 transitions. [2019-09-09 05:54:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:54:27,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:27,725 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:27,726 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:27,726 INFO L82 PathProgramCache]: Analyzing trace with hash -806439601, now seen corresponding path program 1 times [2019-09-09 05:54:27,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:27,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:27,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:27,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:27,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:27,793 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:27,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:27,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:27,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:27,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:27,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:27,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:27,798 INFO L87 Difference]: Start difference. First operand 257 states and 379 transitions. Second operand 4 states. [2019-09-09 05:54:28,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:28,077 INFO L93 Difference]: Finished difference Result 278 states and 405 transitions. [2019-09-09 05:54:28,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:28,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:54:28,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:28,083 INFO L225 Difference]: With dead ends: 278 [2019-09-09 05:54:28,083 INFO L226 Difference]: Without dead ends: 278 [2019-09-09 05:54:28,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:28,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-09 05:54:28,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-09-09 05:54:28,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-09 05:54:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 378 transitions. [2019-09-09 05:54:28,089 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 378 transitions. Word has length 103 [2019-09-09 05:54:28,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:28,089 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 378 transitions. [2019-09-09 05:54:28,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:28,089 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2019-09-09 05:54:28,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:54:28,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:28,091 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:28,091 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:28,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:28,091 INFO L82 PathProgramCache]: Analyzing trace with hash 130164464, now seen corresponding path program 1 times [2019-09-09 05:54:28,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:28,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:28,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:28,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:28,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:28,169 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:28,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:28,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:28,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:28,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:28,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:28,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:28,170 INFO L87 Difference]: Start difference. First operand 257 states and 378 transitions. Second operand 4 states. [2019-09-09 05:54:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:28,531 INFO L93 Difference]: Finished difference Result 300 states and 437 transitions. [2019-09-09 05:54:28,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:28,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:54:28,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:28,534 INFO L225 Difference]: With dead ends: 300 [2019-09-09 05:54:28,535 INFO L226 Difference]: Without dead ends: 300 [2019-09-09 05:54:28,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:28,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-09 05:54:28,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 257. [2019-09-09 05:54:28,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-09 05:54:28,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 377 transitions. [2019-09-09 05:54:28,541 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 377 transitions. Word has length 104 [2019-09-09 05:54:28,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:28,541 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 377 transitions. [2019-09-09 05:54:28,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 377 transitions. [2019-09-09 05:54:28,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:54:28,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:28,543 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:28,543 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:28,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:28,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1391081714, now seen corresponding path program 1 times [2019-09-09 05:54:28,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:28,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:28,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:28,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:28,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:28,597 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:28,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:28,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:28,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:28,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:28,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:28,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:28,599 INFO L87 Difference]: Start difference. First operand 257 states and 377 transitions. Second operand 4 states. [2019-09-09 05:54:28,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:28,845 INFO L93 Difference]: Finished difference Result 268 states and 391 transitions. [2019-09-09 05:54:28,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:28,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:54:28,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:28,847 INFO L225 Difference]: With dead ends: 268 [2019-09-09 05:54:28,847 INFO L226 Difference]: Without dead ends: 268 [2019-09-09 05:54:28,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-09-09 05:54:28,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 257. [2019-09-09 05:54:28,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-09 05:54:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 376 transitions. [2019-09-09 05:54:28,855 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 376 transitions. Word has length 104 [2019-09-09 05:54:28,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:28,855 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 376 transitions. [2019-09-09 05:54:28,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 376 transitions. [2019-09-09 05:54:28,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-09 05:54:28,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:28,856 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:28,857 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:28,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:28,857 INFO L82 PathProgramCache]: Analyzing trace with hash 156613212, now seen corresponding path program 1 times [2019-09-09 05:54:28,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:28,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:28,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:28,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:28,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:28,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:28,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:28,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:28,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:28,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:28,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:28,927 INFO L87 Difference]: Start difference. First operand 257 states and 376 transitions. Second operand 4 states. [2019-09-09 05:54:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:29,283 INFO L93 Difference]: Finished difference Result 300 states and 435 transitions. [2019-09-09 05:54:29,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:29,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-09 05:54:29,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:29,285 INFO L225 Difference]: With dead ends: 300 [2019-09-09 05:54:29,285 INFO L226 Difference]: Without dead ends: 300 [2019-09-09 05:54:29,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-09 05:54:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 257. [2019-09-09 05:54:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-09 05:54:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 375 transitions. [2019-09-09 05:54:29,291 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 375 transitions. Word has length 108 [2019-09-09 05:54:29,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:29,291 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 375 transitions. [2019-09-09 05:54:29,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:29,292 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 375 transitions. [2019-09-09 05:54:29,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-09 05:54:29,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:29,293 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:29,294 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:29,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:29,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2118187870, now seen corresponding path program 1 times [2019-09-09 05:54:29,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:29,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:29,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:29,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:29,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:29,371 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:29,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:29,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:29,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:29,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:29,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:29,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:29,374 INFO L87 Difference]: Start difference. First operand 257 states and 375 transitions. Second operand 4 states. [2019-09-09 05:54:29,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:29,660 INFO L93 Difference]: Finished difference Result 309 states and 453 transitions. [2019-09-09 05:54:29,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:29,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-09 05:54:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:29,664 INFO L225 Difference]: With dead ends: 309 [2019-09-09 05:54:29,664 INFO L226 Difference]: Without dead ends: 309 [2019-09-09 05:54:29,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:29,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-09 05:54:29,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2019-09-09 05:54:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-09 05:54:29,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 420 transitions. [2019-09-09 05:54:29,669 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 420 transitions. Word has length 108 [2019-09-09 05:54:29,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:29,670 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 420 transitions. [2019-09-09 05:54:29,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:29,670 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 420 transitions. [2019-09-09 05:54:29,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-09 05:54:29,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:29,671 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:29,671 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:29,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:29,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1678357372, now seen corresponding path program 1 times [2019-09-09 05:54:29,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:29,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:29,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:29,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:29,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:29,751 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:29,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:29,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:29,751 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:29,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:29,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:29,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:29,752 INFO L87 Difference]: Start difference. First operand 283 states and 420 transitions. Second operand 4 states. [2019-09-09 05:54:30,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:30,116 INFO L93 Difference]: Finished difference Result 326 states and 479 transitions. [2019-09-09 05:54:30,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:30,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-09 05:54:30,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:30,119 INFO L225 Difference]: With dead ends: 326 [2019-09-09 05:54:30,119 INFO L226 Difference]: Without dead ends: 326 [2019-09-09 05:54:30,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:30,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-09 05:54:30,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 283. [2019-09-09 05:54:30,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-09 05:54:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 419 transitions. [2019-09-09 05:54:30,129 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 419 transitions. Word has length 111 [2019-09-09 05:54:30,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:30,129 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 419 transitions. [2019-09-09 05:54:30,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:30,130 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 419 transitions. [2019-09-09 05:54:30,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-09 05:54:30,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:30,131 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:30,132 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:30,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:30,132 INFO L82 PathProgramCache]: Analyzing trace with hash 707236731, now seen corresponding path program 1 times [2019-09-09 05:54:30,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:30,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:30,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:30,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:30,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:30,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:30,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:30,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:30,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:30,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:30,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:30,229 INFO L87 Difference]: Start difference. First operand 283 states and 419 transitions. Second operand 4 states. [2019-09-09 05:54:30,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:30,555 INFO L93 Difference]: Finished difference Result 318 states and 465 transitions. [2019-09-09 05:54:30,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:30,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-09 05:54:30,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:30,558 INFO L225 Difference]: With dead ends: 318 [2019-09-09 05:54:30,558 INFO L226 Difference]: Without dead ends: 318 [2019-09-09 05:54:30,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:30,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-09 05:54:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 283. [2019-09-09 05:54:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-09 05:54:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 418 transitions. [2019-09-09 05:54:30,568 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 418 transitions. Word has length 112 [2019-09-09 05:54:30,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:30,568 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 418 transitions. [2019-09-09 05:54:30,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:30,569 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 418 transitions. [2019-09-09 05:54:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-09 05:54:30,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:30,570 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:30,570 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:30,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:30,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2062157930, now seen corresponding path program 1 times [2019-09-09 05:54:30,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:30,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:30,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:30,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:30,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:30,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:30,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:30,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:30,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:30,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:30,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:30,641 INFO L87 Difference]: Start difference. First operand 283 states and 418 transitions. Second operand 4 states. [2019-09-09 05:54:30,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:30,974 INFO L93 Difference]: Finished difference Result 318 states and 464 transitions. [2019-09-09 05:54:30,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:30,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-09 05:54:30,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:30,976 INFO L225 Difference]: With dead ends: 318 [2019-09-09 05:54:30,976 INFO L226 Difference]: Without dead ends: 318 [2019-09-09 05:54:30,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:30,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-09 05:54:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 283. [2019-09-09 05:54:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-09 05:54:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 417 transitions. [2019-09-09 05:54:30,982 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 417 transitions. Word has length 113 [2019-09-09 05:54:30,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:30,983 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 417 transitions. [2019-09-09 05:54:30,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 417 transitions. [2019-09-09 05:54:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-09 05:54:30,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:30,984 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:30,984 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:30,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:30,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1080843729, now seen corresponding path program 1 times [2019-09-09 05:54:30,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:30,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:30,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:30,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:30,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:31,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:31,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:31,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:31,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:31,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:31,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:31,058 INFO L87 Difference]: Start difference. First operand 283 states and 417 transitions. Second operand 4 states. [2019-09-09 05:54:31,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:31,365 INFO L93 Difference]: Finished difference Result 318 states and 463 transitions. [2019-09-09 05:54:31,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:31,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-09 05:54:31,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:31,368 INFO L225 Difference]: With dead ends: 318 [2019-09-09 05:54:31,368 INFO L226 Difference]: Without dead ends: 318 [2019-09-09 05:54:31,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:31,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-09 05:54:31,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 283. [2019-09-09 05:54:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-09 05:54:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 416 transitions. [2019-09-09 05:54:31,373 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 416 transitions. Word has length 114 [2019-09-09 05:54:31,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:31,373 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 416 transitions. [2019-09-09 05:54:31,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2019-09-09 05:54:31,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-09 05:54:31,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:31,374 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:31,375 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:31,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:31,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1376624843, now seen corresponding path program 1 times [2019-09-09 05:54:31,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:31,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:31,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:31,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:31,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:31,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:31,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:31,451 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:31,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:31,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:31,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:31,452 INFO L87 Difference]: Start difference. First operand 283 states and 416 transitions. Second operand 4 states. [2019-09-09 05:54:31,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:31,787 INFO L93 Difference]: Finished difference Result 316 states and 460 transitions. [2019-09-09 05:54:31,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:31,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-09 05:54:31,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:31,789 INFO L225 Difference]: With dead ends: 316 [2019-09-09 05:54:31,789 INFO L226 Difference]: Without dead ends: 316 [2019-09-09 05:54:31,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-09 05:54:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 283. [2019-09-09 05:54:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-09 05:54:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 415 transitions. [2019-09-09 05:54:31,795 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 415 transitions. Word has length 114 [2019-09-09 05:54:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:31,795 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 415 transitions. [2019-09-09 05:54:31,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 415 transitions. [2019-09-09 05:54:31,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-09 05:54:31,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:31,797 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:31,797 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:31,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:31,797 INFO L82 PathProgramCache]: Analyzing trace with hash 102551762, now seen corresponding path program 1 times [2019-09-09 05:54:31,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:31,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:31,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:31,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:31,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:31,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:31,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:31,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:31,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:31,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:31,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:31,875 INFO L87 Difference]: Start difference. First operand 283 states and 415 transitions. Second operand 4 states. [2019-09-09 05:54:32,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:32,244 INFO L93 Difference]: Finished difference Result 314 states and 456 transitions. [2019-09-09 05:54:32,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:32,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-09 05:54:32,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:32,247 INFO L225 Difference]: With dead ends: 314 [2019-09-09 05:54:32,247 INFO L226 Difference]: Without dead ends: 314 [2019-09-09 05:54:32,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:32,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-09 05:54:32,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 283. [2019-09-09 05:54:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-09 05:54:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 414 transitions. [2019-09-09 05:54:32,253 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 414 transitions. Word has length 115 [2019-09-09 05:54:32,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:32,253 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 414 transitions. [2019-09-09 05:54:32,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 414 transitions. [2019-09-09 05:54:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-09 05:54:32,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:32,254 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:32,255 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:32,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:32,255 INFO L82 PathProgramCache]: Analyzing trace with hash -713422860, now seen corresponding path program 1 times [2019-09-09 05:54:32,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:32,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:32,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:32,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:32,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:32,317 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:32,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:32,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:32,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:32,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:32,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:32,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:32,318 INFO L87 Difference]: Start difference. First operand 283 states and 414 transitions. Second operand 4 states. [2019-09-09 05:54:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:32,629 INFO L93 Difference]: Finished difference Result 311 states and 451 transitions. [2019-09-09 05:54:32,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:32,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-09 05:54:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:32,631 INFO L225 Difference]: With dead ends: 311 [2019-09-09 05:54:32,631 INFO L226 Difference]: Without dead ends: 311 [2019-09-09 05:54:32,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-09 05:54:32,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 283. [2019-09-09 05:54:32,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-09 05:54:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 413 transitions. [2019-09-09 05:54:32,635 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 413 transitions. Word has length 115 [2019-09-09 05:54:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:32,636 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 413 transitions. [2019-09-09 05:54:32,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 413 transitions. [2019-09-09 05:54:32,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-09 05:54:32,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:32,637 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:32,637 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:32,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:32,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1417236522, now seen corresponding path program 1 times [2019-09-09 05:54:32,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:32,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:32,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:32,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:32,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:32,720 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:32,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:32,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:32,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:32,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:32,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:32,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:32,722 INFO L87 Difference]: Start difference. First operand 283 states and 413 transitions. Second operand 4 states. [2019-09-09 05:54:33,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:33,073 INFO L93 Difference]: Finished difference Result 311 states and 450 transitions. [2019-09-09 05:54:33,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:33,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-09 05:54:33,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:33,075 INFO L225 Difference]: With dead ends: 311 [2019-09-09 05:54:33,075 INFO L226 Difference]: Without dead ends: 311 [2019-09-09 05:54:33,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:33,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-09 05:54:33,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 283. [2019-09-09 05:54:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-09 05:54:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 412 transitions. [2019-09-09 05:54:33,080 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 412 transitions. Word has length 117 [2019-09-09 05:54:33,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:33,080 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 412 transitions. [2019-09-09 05:54:33,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 412 transitions. [2019-09-09 05:54:33,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-09 05:54:33,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:33,082 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:33,082 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:33,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:33,082 INFO L82 PathProgramCache]: Analyzing trace with hash 419052122, now seen corresponding path program 1 times [2019-09-09 05:54:33,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:33,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:33,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:33,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:33,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:33,152 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:33,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:33,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:33,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:33,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:33,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:33,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:33,153 INFO L87 Difference]: Start difference. First operand 283 states and 412 transitions. Second operand 4 states. [2019-09-09 05:54:33,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:33,440 INFO L93 Difference]: Finished difference Result 307 states and 444 transitions. [2019-09-09 05:54:33,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:33,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-09-09 05:54:33,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:33,442 INFO L225 Difference]: With dead ends: 307 [2019-09-09 05:54:33,442 INFO L226 Difference]: Without dead ends: 307 [2019-09-09 05:54:33,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:33,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-09 05:54:33,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2019-09-09 05:54:33,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-09 05:54:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 411 transitions. [2019-09-09 05:54:33,447 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 411 transitions. Word has length 118 [2019-09-09 05:54:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:33,447 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 411 transitions. [2019-09-09 05:54:33,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:33,447 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 411 transitions. [2019-09-09 05:54:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-09 05:54:33,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:33,448 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:33,448 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:33,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:33,449 INFO L82 PathProgramCache]: Analyzing trace with hash 875589163, now seen corresponding path program 1 times [2019-09-09 05:54:33,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:33,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:33,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:33,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:33,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:33,529 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:33,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:33,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:33,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:33,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:33,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:33,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:33,531 INFO L87 Difference]: Start difference. First operand 283 states and 411 transitions. Second operand 4 states. [2019-09-09 05:54:33,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:33,827 INFO L93 Difference]: Finished difference Result 307 states and 443 transitions. [2019-09-09 05:54:33,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:33,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-09-09 05:54:33,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:33,829 INFO L225 Difference]: With dead ends: 307 [2019-09-09 05:54:33,829 INFO L226 Difference]: Without dead ends: 307 [2019-09-09 05:54:33,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:33,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-09 05:54:33,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2019-09-09 05:54:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-09 05:54:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 410 transitions. [2019-09-09 05:54:33,833 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 410 transitions. Word has length 118 [2019-09-09 05:54:33,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:33,834 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 410 transitions. [2019-09-09 05:54:33,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:33,834 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 410 transitions. [2019-09-09 05:54:33,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-09 05:54:33,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:33,835 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:33,835 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:33,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:33,836 INFO L82 PathProgramCache]: Analyzing trace with hash -404439161, now seen corresponding path program 1 times [2019-09-09 05:54:33,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:33,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:33,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:33,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:33,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:33,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:33,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:33,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:33,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:33,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:33,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:33,918 INFO L87 Difference]: Start difference. First operand 283 states and 410 transitions. Second operand 4 states. [2019-09-09 05:54:34,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:34,240 INFO L93 Difference]: Finished difference Result 305 states and 440 transitions. [2019-09-09 05:54:34,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:34,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-09-09 05:54:34,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:34,243 INFO L225 Difference]: With dead ends: 305 [2019-09-09 05:54:34,244 INFO L226 Difference]: Without dead ends: 305 [2019-09-09 05:54:34,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:34,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-09 05:54:34,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 283. [2019-09-09 05:54:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-09 05:54:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 409 transitions. [2019-09-09 05:54:34,249 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 409 transitions. Word has length 119 [2019-09-09 05:54:34,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:34,250 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 409 transitions. [2019-09-09 05:54:34,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:34,250 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 409 transitions. [2019-09-09 05:54:34,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-09 05:54:34,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:34,252 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:34,252 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:34,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:34,252 INFO L82 PathProgramCache]: Analyzing trace with hash -2036770522, now seen corresponding path program 1 times [2019-09-09 05:54:34,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:34,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:34,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:34,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:34,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:34,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:34,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:34,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:34,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:34,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:34,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:34,354 INFO L87 Difference]: Start difference. First operand 283 states and 409 transitions. Second operand 4 states. [2019-09-09 05:54:34,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:34,648 INFO L93 Difference]: Finished difference Result 305 states and 439 transitions. [2019-09-09 05:54:34,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:34,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-09 05:54:34,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:34,651 INFO L225 Difference]: With dead ends: 305 [2019-09-09 05:54:34,651 INFO L226 Difference]: Without dead ends: 305 [2019-09-09 05:54:34,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:34,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-09 05:54:34,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 283. [2019-09-09 05:54:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-09 05:54:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 408 transitions. [2019-09-09 05:54:34,656 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 408 transitions. Word has length 120 [2019-09-09 05:54:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:34,657 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 408 transitions. [2019-09-09 05:54:34,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:34,657 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 408 transitions. [2019-09-09 05:54:34,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-09 05:54:34,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:34,658 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:34,658 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:34,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:34,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1858777374, now seen corresponding path program 1 times [2019-09-09 05:54:34,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:34,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:34,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:34,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:34,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:34,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:34,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:34,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:34,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:34,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:34,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:34,731 INFO L87 Difference]: Start difference. First operand 283 states and 408 transitions. Second operand 4 states. [2019-09-09 05:54:35,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:35,032 INFO L93 Difference]: Finished difference Result 303 states and 436 transitions. [2019-09-09 05:54:35,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:35,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-09 05:54:35,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:35,035 INFO L225 Difference]: With dead ends: 303 [2019-09-09 05:54:35,036 INFO L226 Difference]: Without dead ends: 303 [2019-09-09 05:54:35,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:35,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-09 05:54:35,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 283. [2019-09-09 05:54:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-09 05:54:35,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 407 transitions. [2019-09-09 05:54:35,041 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 407 transitions. Word has length 121 [2019-09-09 05:54:35,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:35,041 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 407 transitions. [2019-09-09 05:54:35,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 407 transitions. [2019-09-09 05:54:35,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-09 05:54:35,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:35,042 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:35,043 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:35,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:35,043 INFO L82 PathProgramCache]: Analyzing trace with hash -900484418, now seen corresponding path program 1 times [2019-09-09 05:54:35,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:35,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:35,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:35,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:35,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-09 05:54:35,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:35,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:35,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:35,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:35,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:35,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:35,118 INFO L87 Difference]: Start difference. First operand 283 states and 407 transitions. Second operand 4 states. [2019-09-09 05:54:35,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:35,489 INFO L93 Difference]: Finished difference Result 354 states and 516 transitions. [2019-09-09 05:54:35,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:35,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-09 05:54:35,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:35,494 INFO L225 Difference]: With dead ends: 354 [2019-09-09 05:54:35,494 INFO L226 Difference]: Without dead ends: 354 [2019-09-09 05:54:35,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:35,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-09 05:54:35,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 315. [2019-09-09 05:54:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-09 05:54:35,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 464 transitions. [2019-09-09 05:54:35,499 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 464 transitions. Word has length 121 [2019-09-09 05:54:35,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:35,499 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 464 transitions. [2019-09-09 05:54:35,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:35,500 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 464 transitions. [2019-09-09 05:54:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-09 05:54:35,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:35,501 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:35,501 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:35,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:35,501 INFO L82 PathProgramCache]: Analyzing trace with hash -698917804, now seen corresponding path program 1 times [2019-09-09 05:54:35,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:35,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:35,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:35,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:35,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:54:35,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:35,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:35,577 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:35,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:35,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:35,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:35,578 INFO L87 Difference]: Start difference. First operand 315 states and 464 transitions. Second operand 4 states. [2019-09-09 05:54:35,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:35,985 INFO L93 Difference]: Finished difference Result 417 states and 619 transitions. [2019-09-09 05:54:35,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:35,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-09 05:54:35,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:35,988 INFO L225 Difference]: With dead ends: 417 [2019-09-09 05:54:35,988 INFO L226 Difference]: Without dead ends: 417 [2019-09-09 05:54:35,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:35,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-09-09 05:54:35,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 354. [2019-09-09 05:54:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-09-09 05:54:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 535 transitions. [2019-09-09 05:54:35,994 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 535 transitions. Word has length 122 [2019-09-09 05:54:35,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:35,995 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 535 transitions. [2019-09-09 05:54:35,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:35,995 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 535 transitions. [2019-09-09 05:54:35,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-09 05:54:35,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:35,996 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:35,996 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:35,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:35,997 INFO L82 PathProgramCache]: Analyzing trace with hash -467317701, now seen corresponding path program 1 times [2019-09-09 05:54:35,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:35,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:35,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:35,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:35,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:36,060 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:36,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:36,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:36,060 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:36,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:36,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:36,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:36,061 INFO L87 Difference]: Start difference. First operand 354 states and 535 transitions. Second operand 4 states. [2019-09-09 05:54:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:36,345 INFO L93 Difference]: Finished difference Result 380 states and 567 transitions. [2019-09-09 05:54:36,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:36,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-09 05:54:36,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:36,349 INFO L225 Difference]: With dead ends: 380 [2019-09-09 05:54:36,349 INFO L226 Difference]: Without dead ends: 380 [2019-09-09 05:54:36,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:36,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-09 05:54:36,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 354. [2019-09-09 05:54:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-09-09 05:54:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 534 transitions. [2019-09-09 05:54:36,353 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 534 transitions. Word has length 123 [2019-09-09 05:54:36,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:36,353 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 534 transitions. [2019-09-09 05:54:36,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:36,354 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 534 transitions. [2019-09-09 05:54:36,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-09 05:54:36,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:36,355 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:36,355 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:36,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:36,355 INFO L82 PathProgramCache]: Analyzing trace with hash -198118226, now seen corresponding path program 1 times [2019-09-09 05:54:36,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:36,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:36,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:36,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:36,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:36,454 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:54:36,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:36,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:36,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:36,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:36,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:36,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:36,456 INFO L87 Difference]: Start difference. First operand 354 states and 534 transitions. Second operand 4 states. [2019-09-09 05:54:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:36,864 INFO L93 Difference]: Finished difference Result 411 states and 610 transitions. [2019-09-09 05:54:36,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:36,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-09 05:54:36,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:36,867 INFO L225 Difference]: With dead ends: 411 [2019-09-09 05:54:36,867 INFO L226 Difference]: Without dead ends: 411 [2019-09-09 05:54:36,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:36,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-09-09 05:54:36,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 353. [2019-09-09 05:54:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-09 05:54:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 533 transitions. [2019-09-09 05:54:36,871 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 533 transitions. Word has length 123 [2019-09-09 05:54:36,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:36,871 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 533 transitions. [2019-09-09 05:54:36,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:36,871 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 533 transitions. [2019-09-09 05:54:36,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-09 05:54:36,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:36,872 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:36,873 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:36,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:36,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2032470192, now seen corresponding path program 1 times [2019-09-09 05:54:36,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:36,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:36,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:36,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:36,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:36,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:36,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:36,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:36,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:36,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:36,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:36,946 INFO L87 Difference]: Start difference. First operand 353 states and 533 transitions. Second operand 4 states. [2019-09-09 05:54:37,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:37,226 INFO L93 Difference]: Finished difference Result 379 states and 565 transitions. [2019-09-09 05:54:37,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:37,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-09 05:54:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:37,229 INFO L225 Difference]: With dead ends: 379 [2019-09-09 05:54:37,229 INFO L226 Difference]: Without dead ends: 379 [2019-09-09 05:54:37,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:37,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-09-09 05:54:37,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2019-09-09 05:54:37,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-09 05:54:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 532 transitions. [2019-09-09 05:54:37,234 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 532 transitions. Word has length 124 [2019-09-09 05:54:37,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:37,234 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 532 transitions. [2019-09-09 05:54:37,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 532 transitions. [2019-09-09 05:54:37,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-09 05:54:37,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:37,235 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:37,235 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:37,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:37,236 INFO L82 PathProgramCache]: Analyzing trace with hash -634359050, now seen corresponding path program 1 times [2019-09-09 05:54:37,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:37,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:37,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:37,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:37,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:37,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:37,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:37,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:37,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:37,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:37,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:37,297 INFO L87 Difference]: Start difference. First operand 353 states and 532 transitions. Second operand 4 states. [2019-09-09 05:54:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:37,585 INFO L93 Difference]: Finished difference Result 379 states and 564 transitions. [2019-09-09 05:54:37,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:37,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-09 05:54:37,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:37,587 INFO L225 Difference]: With dead ends: 379 [2019-09-09 05:54:37,587 INFO L226 Difference]: Without dead ends: 379 [2019-09-09 05:54:37,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:37,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-09-09 05:54:37,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2019-09-09 05:54:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-09 05:54:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 531 transitions. [2019-09-09 05:54:37,592 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 531 transitions. Word has length 125 [2019-09-09 05:54:37,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:37,592 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 531 transitions. [2019-09-09 05:54:37,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 531 transitions. [2019-09-09 05:54:37,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-09 05:54:37,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:37,593 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:37,593 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:37,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:37,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1864355797, now seen corresponding path program 1 times [2019-09-09 05:54:37,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:37,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:37,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:37,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:37,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:37,654 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:37,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:37,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:37,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:37,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:37,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:37,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:37,656 INFO L87 Difference]: Start difference. First operand 353 states and 531 transitions. Second operand 4 states. [2019-09-09 05:54:37,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:37,918 INFO L93 Difference]: Finished difference Result 369 states and 551 transitions. [2019-09-09 05:54:37,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:37,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-09 05:54:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:37,921 INFO L225 Difference]: With dead ends: 369 [2019-09-09 05:54:37,921 INFO L226 Difference]: Without dead ends: 369 [2019-09-09 05:54:37,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:37,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-09 05:54:37,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 353. [2019-09-09 05:54:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-09 05:54:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 530 transitions. [2019-09-09 05:54:37,926 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 530 transitions. Word has length 126 [2019-09-09 05:54:37,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:37,926 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 530 transitions. [2019-09-09 05:54:37,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:37,926 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 530 transitions. [2019-09-09 05:54:37,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-09 05:54:37,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:37,927 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:37,928 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:37,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:37,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1536585999, now seen corresponding path program 1 times [2019-09-09 05:54:37,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:37,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:37,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:37,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:37,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:37,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:37,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:37,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:37,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:37,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:37,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:37,999 INFO L87 Difference]: Start difference. First operand 353 states and 530 transitions. Second operand 4 states. [2019-09-09 05:54:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:38,432 INFO L93 Difference]: Finished difference Result 455 states and 685 transitions. [2019-09-09 05:54:38,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:38,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-09 05:54:38,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:38,435 INFO L225 Difference]: With dead ends: 455 [2019-09-09 05:54:38,435 INFO L226 Difference]: Without dead ends: 455 [2019-09-09 05:54:38,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:38,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-09 05:54:38,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 392. [2019-09-09 05:54:38,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-09 05:54:38,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 601 transitions. [2019-09-09 05:54:38,442 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 601 transitions. Word has length 127 [2019-09-09 05:54:38,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:38,442 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 601 transitions. [2019-09-09 05:54:38,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:38,442 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 601 transitions. [2019-09-09 05:54:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-09 05:54:38,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:38,445 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:38,445 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:38,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:38,445 INFO L82 PathProgramCache]: Analyzing trace with hash -396028495, now seen corresponding path program 1 times [2019-09-09 05:54:38,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:38,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:38,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:38,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:38,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:38,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:38,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:38,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:38,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:38,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:38,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:38,520 INFO L87 Difference]: Start difference. First operand 392 states and 601 transitions. Second operand 4 states. [2019-09-09 05:54:38,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:38,962 INFO L93 Difference]: Finished difference Result 449 states and 677 transitions. [2019-09-09 05:54:38,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:38,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-09 05:54:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:38,965 INFO L225 Difference]: With dead ends: 449 [2019-09-09 05:54:38,965 INFO L226 Difference]: Without dead ends: 449 [2019-09-09 05:54:38,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-09 05:54:38,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 353. [2019-09-09 05:54:38,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-09 05:54:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 530 transitions. [2019-09-09 05:54:38,971 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 530 transitions. Word has length 128 [2019-09-09 05:54:38,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:38,971 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 530 transitions. [2019-09-09 05:54:38,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:38,971 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 530 transitions. [2019-09-09 05:54:38,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-09 05:54:38,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:38,972 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:38,972 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:38,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:38,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1470901809, now seen corresponding path program 1 times [2019-09-09 05:54:38,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:38,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:38,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:38,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:38,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:39,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:39,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:39,096 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:39,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:39,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:39,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:39,097 INFO L87 Difference]: Start difference. First operand 353 states and 530 transitions. Second operand 4 states. [2019-09-09 05:54:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:39,389 INFO L93 Difference]: Finished difference Result 368 states and 549 transitions. [2019-09-09 05:54:39,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:39,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-09 05:54:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:39,392 INFO L225 Difference]: With dead ends: 368 [2019-09-09 05:54:39,392 INFO L226 Difference]: Without dead ends: 368 [2019-09-09 05:54:39,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:39,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-09 05:54:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 356. [2019-09-09 05:54:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-09 05:54:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 533 transitions. [2019-09-09 05:54:39,397 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 533 transitions. Word has length 129 [2019-09-09 05:54:39,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:39,397 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 533 transitions. [2019-09-09 05:54:39,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 533 transitions. [2019-09-09 05:54:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-09 05:54:39,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:39,398 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:39,399 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:39,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:39,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1910445861, now seen corresponding path program 1 times [2019-09-09 05:54:39,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:39,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:39,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:39,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:39,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:54:39,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:39,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:39,459 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:39,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:39,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:39,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:39,460 INFO L87 Difference]: Start difference. First operand 356 states and 533 transitions. Second operand 4 states. [2019-09-09 05:54:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:39,722 INFO L93 Difference]: Finished difference Result 372 states and 553 transitions. [2019-09-09 05:54:39,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:39,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-09 05:54:39,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:39,725 INFO L225 Difference]: With dead ends: 372 [2019-09-09 05:54:39,725 INFO L226 Difference]: Without dead ends: 372 [2019-09-09 05:54:39,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:39,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-09 05:54:39,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 356. [2019-09-09 05:54:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-09 05:54:39,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 532 transitions. [2019-09-09 05:54:39,730 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 532 transitions. Word has length 136 [2019-09-09 05:54:39,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:39,730 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 532 transitions. [2019-09-09 05:54:39,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:39,730 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 532 transitions. [2019-09-09 05:54:39,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-09 05:54:39,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:39,731 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:39,731 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:39,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:39,732 INFO L82 PathProgramCache]: Analyzing trace with hash -687318708, now seen corresponding path program 1 times [2019-09-09 05:54:39,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:39,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:39,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:39,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:39,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:54:39,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:39,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:39,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:39,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:39,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:39,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:39,802 INFO L87 Difference]: Start difference. First operand 356 states and 532 transitions. Second operand 4 states. [2019-09-09 05:54:40,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:40,143 INFO L93 Difference]: Finished difference Result 418 states and 627 transitions. [2019-09-09 05:54:40,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:40,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-09 05:54:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:40,146 INFO L225 Difference]: With dead ends: 418 [2019-09-09 05:54:40,146 INFO L226 Difference]: Without dead ends: 418 [2019-09-09 05:54:40,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:40,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-09-09 05:54:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 384. [2019-09-09 05:54:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-09 05:54:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 581 transitions. [2019-09-09 05:54:40,151 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 581 transitions. Word has length 136 [2019-09-09 05:54:40,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:40,152 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 581 transitions. [2019-09-09 05:54:40,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:40,152 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 581 transitions. [2019-09-09 05:54:40,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-09 05:54:40,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:40,153 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:40,153 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:40,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:40,154 INFO L82 PathProgramCache]: Analyzing trace with hash 313401477, now seen corresponding path program 1 times [2019-09-09 05:54:40,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:40,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:40,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:40,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:40,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:40,206 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:54:40,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:40,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:40,207 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:40,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:40,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:40,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:40,208 INFO L87 Difference]: Start difference. First operand 384 states and 581 transitions. Second operand 4 states. [2019-09-09 05:54:40,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:40,603 INFO L93 Difference]: Finished difference Result 480 states and 727 transitions. [2019-09-09 05:54:40,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:40,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-09-09 05:54:40,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:40,607 INFO L225 Difference]: With dead ends: 480 [2019-09-09 05:54:40,607 INFO L226 Difference]: Without dead ends: 480 [2019-09-09 05:54:40,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:40,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-09-09 05:54:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 396. [2019-09-09 05:54:40,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-09-09 05:54:40,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 598 transitions. [2019-09-09 05:54:40,612 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 598 transitions. Word has length 137 [2019-09-09 05:54:40,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:40,612 INFO L475 AbstractCegarLoop]: Abstraction has 396 states and 598 transitions. [2019-09-09 05:54:40,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:40,612 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 598 transitions. [2019-09-09 05:54:40,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-09 05:54:40,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:40,613 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:40,614 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:40,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:40,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1213886170, now seen corresponding path program 1 times [2019-09-09 05:54:40,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:40,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:40,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:40,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:40,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:40,687 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:54:40,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:40,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:40,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:40,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:40,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:40,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:40,689 INFO L87 Difference]: Start difference. First operand 396 states and 598 transitions. Second operand 4 states. [2019-09-09 05:54:40,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:40,931 INFO L93 Difference]: Finished difference Result 410 states and 616 transitions. [2019-09-09 05:54:40,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:40,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-09-09 05:54:40,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:40,934 INFO L225 Difference]: With dead ends: 410 [2019-09-09 05:54:40,934 INFO L226 Difference]: Without dead ends: 410 [2019-09-09 05:54:40,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:40,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-09-09 05:54:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 396. [2019-09-09 05:54:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-09-09 05:54:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 597 transitions. [2019-09-09 05:54:40,938 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 597 transitions. Word has length 137 [2019-09-09 05:54:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:40,939 INFO L475 AbstractCegarLoop]: Abstraction has 396 states and 597 transitions. [2019-09-09 05:54:40,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 597 transitions. [2019-09-09 05:54:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-09 05:54:40,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:40,940 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:40,940 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:40,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:40,940 INFO L82 PathProgramCache]: Analyzing trace with hash 694987846, now seen corresponding path program 1 times [2019-09-09 05:54:40,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:40,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:40,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:40,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:40,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:54:40,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:41,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:41,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:41,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:41,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:41,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:41,001 INFO L87 Difference]: Start difference. First operand 396 states and 597 transitions. Second operand 4 states. [2019-09-09 05:54:41,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:41,401 INFO L93 Difference]: Finished difference Result 480 states and 725 transitions. [2019-09-09 05:54:41,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:41,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-09 05:54:41,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:41,405 INFO L225 Difference]: With dead ends: 480 [2019-09-09 05:54:41,405 INFO L226 Difference]: Without dead ends: 480 [2019-09-09 05:54:41,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:41,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-09-09 05:54:41,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 397. [2019-09-09 05:54:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-09 05:54:41,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 598 transitions. [2019-09-09 05:54:41,409 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 598 transitions. Word has length 138 [2019-09-09 05:54:41,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:41,410 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 598 transitions. [2019-09-09 05:54:41,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:41,410 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 598 transitions. [2019-09-09 05:54:41,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-09 05:54:41,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:41,411 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:41,411 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:41,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:41,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1982505792, now seen corresponding path program 1 times [2019-09-09 05:54:41,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:41,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:41,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:41,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:41,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:54:41,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:41,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:41,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:41,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:41,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:41,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:41,480 INFO L87 Difference]: Start difference. First operand 397 states and 598 transitions. Second operand 4 states. [2019-09-09 05:54:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:41,860 INFO L93 Difference]: Finished difference Result 480 states and 724 transitions. [2019-09-09 05:54:41,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:41,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-09 05:54:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:41,864 INFO L225 Difference]: With dead ends: 480 [2019-09-09 05:54:41,864 INFO L226 Difference]: Without dead ends: 480 [2019-09-09 05:54:41,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:41,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-09-09 05:54:41,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 398. [2019-09-09 05:54:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-09-09 05:54:41,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 599 transitions. [2019-09-09 05:54:41,869 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 599 transitions. Word has length 139 [2019-09-09 05:54:41,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:41,869 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 599 transitions. [2019-09-09 05:54:41,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:41,869 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 599 transitions. [2019-09-09 05:54:41,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-09 05:54:41,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:41,870 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:41,870 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:41,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:41,871 INFO L82 PathProgramCache]: Analyzing trace with hash -707231839, now seen corresponding path program 1 times [2019-09-09 05:54:41,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:41,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:41,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:41,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:41,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:41,942 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:54:41,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:41,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:41,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:41,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:41,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:41,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:41,944 INFO L87 Difference]: Start difference. First operand 398 states and 599 transitions. Second operand 4 states. [2019-09-09 05:54:42,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:42,312 INFO L93 Difference]: Finished difference Result 470 states and 711 transitions. [2019-09-09 05:54:42,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:42,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-09 05:54:42,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:42,318 INFO L225 Difference]: With dead ends: 470 [2019-09-09 05:54:42,318 INFO L226 Difference]: Without dead ends: 470 [2019-09-09 05:54:42,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:42,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-09 05:54:42,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 399. [2019-09-09 05:54:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-09 05:54:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 600 transitions. [2019-09-09 05:54:42,324 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 600 transitions. Word has length 140 [2019-09-09 05:54:42,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:42,324 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 600 transitions. [2019-09-09 05:54:42,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:42,324 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 600 transitions. [2019-09-09 05:54:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-09 05:54:42,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:42,325 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:42,325 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:42,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:42,325 INFO L82 PathProgramCache]: Analyzing trace with hash -232341432, now seen corresponding path program 1 times [2019-09-09 05:54:42,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:42,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:42,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:42,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:42,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:42,379 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:42,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:42,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:42,379 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:42,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:42,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:42,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:42,380 INFO L87 Difference]: Start difference. First operand 399 states and 600 transitions. Second operand 4 states. [2019-09-09 05:54:42,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:42,805 INFO L93 Difference]: Finished difference Result 480 states and 722 transitions. [2019-09-09 05:54:42,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:42,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-09 05:54:42,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:42,808 INFO L225 Difference]: With dead ends: 480 [2019-09-09 05:54:42,808 INFO L226 Difference]: Without dead ends: 480 [2019-09-09 05:54:42,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:42,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-09-09 05:54:42,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 399. [2019-09-09 05:54:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-09 05:54:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 599 transitions. [2019-09-09 05:54:42,815 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 599 transitions. Word has length 142 [2019-09-09 05:54:42,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:42,816 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 599 transitions. [2019-09-09 05:54:42,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 599 transitions. [2019-09-09 05:54:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-09 05:54:42,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:42,817 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:42,817 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:42,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:42,818 INFO L82 PathProgramCache]: Analyzing trace with hash 956826851, now seen corresponding path program 1 times [2019-09-09 05:54:42,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:42,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:42,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:42,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:42,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:42,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:42,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:42,887 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:42,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:42,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:42,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:42,888 INFO L87 Difference]: Start difference. First operand 399 states and 599 transitions. Second operand 4 states. [2019-09-09 05:54:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:43,306 INFO L93 Difference]: Finished difference Result 480 states and 721 transitions. [2019-09-09 05:54:43,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:43,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-09 05:54:43,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:43,309 INFO L225 Difference]: With dead ends: 480 [2019-09-09 05:54:43,310 INFO L226 Difference]: Without dead ends: 480 [2019-09-09 05:54:43,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-09-09 05:54:43,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 399. [2019-09-09 05:54:43,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-09 05:54:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 598 transitions. [2019-09-09 05:54:43,314 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 598 transitions. Word has length 143 [2019-09-09 05:54:43,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:43,315 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 598 transitions. [2019-09-09 05:54:43,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 598 transitions. [2019-09-09 05:54:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-09 05:54:43,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:43,316 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:43,316 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:43,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:43,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1839536067, now seen corresponding path program 1 times [2019-09-09 05:54:43,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:43,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:43,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:43,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:43,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:43,389 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:43,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:43,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:43,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:43,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:43,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:43,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:43,391 INFO L87 Difference]: Start difference. First operand 399 states and 598 transitions. Second operand 4 states. [2019-09-09 05:54:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:43,799 INFO L93 Difference]: Finished difference Result 480 states and 720 transitions. [2019-09-09 05:54:43,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:43,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-09-09 05:54:43,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:43,802 INFO L225 Difference]: With dead ends: 480 [2019-09-09 05:54:43,802 INFO L226 Difference]: Without dead ends: 480 [2019-09-09 05:54:43,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:43,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-09-09 05:54:43,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 399. [2019-09-09 05:54:43,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-09 05:54:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 597 transitions. [2019-09-09 05:54:43,808 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 597 transitions. Word has length 144 [2019-09-09 05:54:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:43,808 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 597 transitions. [2019-09-09 05:54:43,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 597 transitions. [2019-09-09 05:54:43,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-09 05:54:43,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:43,809 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:43,809 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:43,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:43,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1811948798, now seen corresponding path program 1 times [2019-09-09 05:54:43,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:43,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:43,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:43,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:43,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:43,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:43,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:43,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:43,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:43,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:43,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:43,898 INFO L87 Difference]: Start difference. First operand 399 states and 597 transitions. Second operand 4 states. [2019-09-09 05:54:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:44,285 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2019-09-09 05:54:44,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:44,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-09 05:54:44,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:44,289 INFO L225 Difference]: With dead ends: 470 [2019-09-09 05:54:44,289 INFO L226 Difference]: Without dead ends: 470 [2019-09-09 05:54:44,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:44,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-09 05:54:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 384. [2019-09-09 05:54:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-09 05:54:44,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 576 transitions. [2019-09-09 05:54:44,297 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 576 transitions. Word has length 145 [2019-09-09 05:54:44,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:44,297 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 576 transitions. [2019-09-09 05:54:44,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:44,297 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 576 transitions. [2019-09-09 05:54:44,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-09 05:54:44,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:44,299 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:44,299 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:44,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:44,299 INFO L82 PathProgramCache]: Analyzing trace with hash -347053653, now seen corresponding path program 1 times [2019-09-09 05:54:44,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:44,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:44,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:44,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:44,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:54:44,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:44,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:44,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:44,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:44,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:44,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:44,360 INFO L87 Difference]: Start difference. First operand 384 states and 576 transitions. Second operand 4 states. [2019-09-09 05:54:44,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:44,729 INFO L93 Difference]: Finished difference Result 470 states and 706 transitions. [2019-09-09 05:54:44,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:44,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-09-09 05:54:44,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:44,732 INFO L225 Difference]: With dead ends: 470 [2019-09-09 05:54:44,732 INFO L226 Difference]: Without dead ends: 470 [2019-09-09 05:54:44,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:44,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-09 05:54:44,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 412. [2019-09-09 05:54:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-09 05:54:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 621 transitions. [2019-09-09 05:54:44,737 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 621 transitions. Word has length 147 [2019-09-09 05:54:44,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:44,737 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 621 transitions. [2019-09-09 05:54:44,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 621 transitions. [2019-09-09 05:54:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-09 05:54:44,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:44,739 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:44,739 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:44,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:44,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1950962900, now seen corresponding path program 1 times [2019-09-09 05:54:44,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:44,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:44,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:44,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:44,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:44,801 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:54:44,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:44,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:44,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:44,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:44,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:44,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:44,802 INFO L87 Difference]: Start difference. First operand 412 states and 621 transitions. Second operand 4 states. [2019-09-09 05:54:45,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:45,162 INFO L93 Difference]: Finished difference Result 462 states and 692 transitions. [2019-09-09 05:54:45,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:45,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-09-09 05:54:45,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:45,165 INFO L225 Difference]: With dead ends: 462 [2019-09-09 05:54:45,165 INFO L226 Difference]: Without dead ends: 462 [2019-09-09 05:54:45,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-09 05:54:45,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 413. [2019-09-09 05:54:45,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-09-09 05:54:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 622 transitions. [2019-09-09 05:54:45,171 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 622 transitions. Word has length 148 [2019-09-09 05:54:45,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:45,171 INFO L475 AbstractCegarLoop]: Abstraction has 413 states and 622 transitions. [2019-09-09 05:54:45,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 622 transitions. [2019-09-09 05:54:45,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-09 05:54:45,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:45,173 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:45,173 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:45,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:45,174 INFO L82 PathProgramCache]: Analyzing trace with hash 833412305, now seen corresponding path program 1 times [2019-09-09 05:54:45,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:45,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:45,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:45,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:45,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:45,224 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-09 05:54:45,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:45,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:45,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:45,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:45,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:45,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:45,226 INFO L87 Difference]: Start difference. First operand 413 states and 622 transitions. Second operand 4 states. [2019-09-09 05:54:45,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:45,581 INFO L93 Difference]: Finished difference Result 462 states and 691 transitions. [2019-09-09 05:54:45,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:45,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-09 05:54:45,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:45,587 INFO L225 Difference]: With dead ends: 462 [2019-09-09 05:54:45,587 INFO L226 Difference]: Without dead ends: 462 [2019-09-09 05:54:45,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:45,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-09 05:54:45,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 413. [2019-09-09 05:54:45,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-09-09 05:54:45,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 621 transitions. [2019-09-09 05:54:45,593 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 621 transitions. Word has length 150 [2019-09-09 05:54:45,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:45,593 INFO L475 AbstractCegarLoop]: Abstraction has 413 states and 621 transitions. [2019-09-09 05:54:45,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:45,593 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 621 transitions. [2019-09-09 05:54:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-09 05:54:45,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:45,595 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:45,595 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:45,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:45,595 INFO L82 PathProgramCache]: Analyzing trace with hash -531626333, now seen corresponding path program 1 times [2019-09-09 05:54:45,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:45,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:45,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:45,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:45,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:54:45,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:45,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:45,672 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:45,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:45,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:45,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:45,673 INFO L87 Difference]: Start difference. First operand 413 states and 621 transitions. Second operand 4 states. [2019-09-09 05:54:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:46,009 INFO L93 Difference]: Finished difference Result 459 states and 686 transitions. [2019-09-09 05:54:46,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:46,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-09 05:54:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:46,012 INFO L225 Difference]: With dead ends: 459 [2019-09-09 05:54:46,012 INFO L226 Difference]: Without dead ends: 459 [2019-09-09 05:54:46,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:46,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-09 05:54:46,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 416. [2019-09-09 05:54:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-09 05:54:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 626 transitions. [2019-09-09 05:54:46,017 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 626 transitions. Word has length 151 [2019-09-09 05:54:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:46,017 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 626 transitions. [2019-09-09 05:54:46,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 626 transitions. [2019-09-09 05:54:46,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-09 05:54:46,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:46,018 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:46,018 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:46,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:46,019 INFO L82 PathProgramCache]: Analyzing trace with hash -2053628944, now seen corresponding path program 1 times [2019-09-09 05:54:46,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:46,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:46,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:46,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:46,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-09 05:54:46,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:46,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:46,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:46,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:46,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:46,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:46,098 INFO L87 Difference]: Start difference. First operand 416 states and 626 transitions. Second operand 4 states. [2019-09-09 05:54:46,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:46,433 INFO L93 Difference]: Finished difference Result 457 states and 683 transitions. [2019-09-09 05:54:46,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:46,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-09 05:54:46,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:46,437 INFO L225 Difference]: With dead ends: 457 [2019-09-09 05:54:46,437 INFO L226 Difference]: Without dead ends: 457 [2019-09-09 05:54:46,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:46,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-09 05:54:46,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 416. [2019-09-09 05:54:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-09 05:54:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 625 transitions. [2019-09-09 05:54:46,443 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 625 transitions. Word has length 151 [2019-09-09 05:54:46,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:46,443 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 625 transitions. [2019-09-09 05:54:46,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:46,444 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 625 transitions. [2019-09-09 05:54:46,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-09 05:54:46,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:46,445 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:46,445 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:46,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:46,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1212902259, now seen corresponding path program 1 times [2019-09-09 05:54:46,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:46,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:46,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:46,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:46,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:54:46,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:46,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:46,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:46,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:46,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:46,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:46,522 INFO L87 Difference]: Start difference. First operand 416 states and 625 transitions. Second operand 4 states. [2019-09-09 05:54:46,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:46,872 INFO L93 Difference]: Finished difference Result 450 states and 670 transitions. [2019-09-09 05:54:46,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:46,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-09 05:54:46,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:46,877 INFO L225 Difference]: With dead ends: 450 [2019-09-09 05:54:46,877 INFO L226 Difference]: Without dead ends: 450 [2019-09-09 05:54:46,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:46,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-09 05:54:46,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 416. [2019-09-09 05:54:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-09 05:54:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 624 transitions. [2019-09-09 05:54:46,884 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 624 transitions. Word has length 151 [2019-09-09 05:54:46,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:46,884 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 624 transitions. [2019-09-09 05:54:46,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:46,884 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 624 transitions. [2019-09-09 05:54:46,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-09 05:54:46,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:46,885 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:46,886 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:46,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:46,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1241672110, now seen corresponding path program 1 times [2019-09-09 05:54:46,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:46,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:46,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:46,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:46,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:46,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:46,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:46,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:46,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:46,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:46,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:46,952 INFO L87 Difference]: Start difference. First operand 416 states and 624 transitions. Second operand 4 states. [2019-09-09 05:54:47,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:47,342 INFO L93 Difference]: Finished difference Result 470 states and 700 transitions. [2019-09-09 05:54:47,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:47,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-09 05:54:47,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:47,347 INFO L225 Difference]: With dead ends: 470 [2019-09-09 05:54:47,347 INFO L226 Difference]: Without dead ends: 470 [2019-09-09 05:54:47,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:47,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-09 05:54:47,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 416. [2019-09-09 05:54:47,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-09 05:54:47,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 623 transitions. [2019-09-09 05:54:47,353 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 623 transitions. Word has length 152 [2019-09-09 05:54:47,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:47,354 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 623 transitions. [2019-09-09 05:54:47,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:47,354 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 623 transitions. [2019-09-09 05:54:47,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-09 05:54:47,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:47,355 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:47,355 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:47,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:47,356 INFO L82 PathProgramCache]: Analyzing trace with hash 624212286, now seen corresponding path program 1 times [2019-09-09 05:54:47,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:47,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:47,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:47,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:47,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:47,419 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:54:47,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:47,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:47,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:47,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:47,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:47,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:47,420 INFO L87 Difference]: Start difference. First operand 416 states and 623 transitions. Second operand 4 states. [2019-09-09 05:54:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:47,764 INFO L93 Difference]: Finished difference Result 450 states and 668 transitions. [2019-09-09 05:54:47,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:47,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-09 05:54:47,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:47,767 INFO L225 Difference]: With dead ends: 450 [2019-09-09 05:54:47,768 INFO L226 Difference]: Without dead ends: 450 [2019-09-09 05:54:47,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:47,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-09 05:54:47,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 416. [2019-09-09 05:54:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-09 05:54:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 622 transitions. [2019-09-09 05:54:47,773 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 622 transitions. Word has length 152 [2019-09-09 05:54:47,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:47,774 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 622 transitions. [2019-09-09 05:54:47,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 622 transitions. [2019-09-09 05:54:47,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-09 05:54:47,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:47,775 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:47,775 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:47,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:47,775 INFO L82 PathProgramCache]: Analyzing trace with hash 54895497, now seen corresponding path program 1 times [2019-09-09 05:54:47,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:47,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:47,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:47,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:47,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:47,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:47,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:47,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:47,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:47,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:47,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:47,831 INFO L87 Difference]: Start difference. First operand 416 states and 622 transitions. Second operand 4 states. [2019-09-09 05:54:48,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:48,193 INFO L93 Difference]: Finished difference Result 462 states and 685 transitions. [2019-09-09 05:54:48,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:48,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-09 05:54:48,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:48,196 INFO L225 Difference]: With dead ends: 462 [2019-09-09 05:54:48,196 INFO L226 Difference]: Without dead ends: 462 [2019-09-09 05:54:48,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:48,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-09 05:54:48,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 416. [2019-09-09 05:54:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-09 05:54:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 621 transitions. [2019-09-09 05:54:48,202 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 621 transitions. Word has length 153 [2019-09-09 05:54:48,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:48,202 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 621 transitions. [2019-09-09 05:54:48,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:48,203 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 621 transitions. [2019-09-09 05:54:48,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-09 05:54:48,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:48,204 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:48,204 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:48,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:48,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1490534085, now seen corresponding path program 1 times [2019-09-09 05:54:48,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:48,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:48,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:48,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:48,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:48,257 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:54:48,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:48,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:48,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:48,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:48,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:48,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:48,258 INFO L87 Difference]: Start difference. First operand 416 states and 621 transitions. Second operand 4 states. [2019-09-09 05:54:48,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:48,596 INFO L93 Difference]: Finished difference Result 457 states and 678 transitions. [2019-09-09 05:54:48,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:48,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-09 05:54:48,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:48,599 INFO L225 Difference]: With dead ends: 457 [2019-09-09 05:54:48,599 INFO L226 Difference]: Without dead ends: 457 [2019-09-09 05:54:48,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:48,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-09 05:54:48,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 417. [2019-09-09 05:54:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-09 05:54:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 622 transitions. [2019-09-09 05:54:48,604 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 622 transitions. Word has length 153 [2019-09-09 05:54:48,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:48,604 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 622 transitions. [2019-09-09 05:54:48,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 622 transitions. [2019-09-09 05:54:48,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-09 05:54:48,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:48,606 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:48,606 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:48,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:48,606 INFO L82 PathProgramCache]: Analyzing trace with hash 118419144, now seen corresponding path program 1 times [2019-09-09 05:54:48,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:48,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:48,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:48,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:48,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:54:48,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:48,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:48,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:48,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:48,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:48,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:48,678 INFO L87 Difference]: Start difference. First operand 417 states and 622 transitions. Second operand 4 states. [2019-09-09 05:54:49,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:49,049 INFO L93 Difference]: Finished difference Result 451 states and 667 transitions. [2019-09-09 05:54:49,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:49,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-09 05:54:49,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:49,052 INFO L225 Difference]: With dead ends: 451 [2019-09-09 05:54:49,052 INFO L226 Difference]: Without dead ends: 451 [2019-09-09 05:54:49,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:49,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-09 05:54:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 417. [2019-09-09 05:54:49,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-09 05:54:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 621 transitions. [2019-09-09 05:54:49,059 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 621 transitions. Word has length 153 [2019-09-09 05:54:49,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:49,059 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 621 transitions. [2019-09-09 05:54:49,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:49,059 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 621 transitions. [2019-09-09 05:54:49,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-09 05:54:49,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:49,061 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:49,061 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:49,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:49,062 INFO L82 PathProgramCache]: Analyzing trace with hash 365627723, now seen corresponding path program 1 times [2019-09-09 05:54:49,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:49,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:49,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:49,169 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:54:49,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:49,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:49,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:49,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:49,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:49,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:49,171 INFO L87 Difference]: Start difference. First operand 417 states and 621 transitions. Second operand 4 states. [2019-09-09 05:54:49,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:49,502 INFO L93 Difference]: Finished difference Result 453 states and 671 transitions. [2019-09-09 05:54:49,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:49,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-09 05:54:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:49,504 INFO L225 Difference]: With dead ends: 453 [2019-09-09 05:54:49,504 INFO L226 Difference]: Without dead ends: 453 [2019-09-09 05:54:49,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:49,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-09 05:54:49,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 418. [2019-09-09 05:54:49,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-09-09 05:54:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 622 transitions. [2019-09-09 05:54:49,510 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 622 transitions. Word has length 154 [2019-09-09 05:54:49,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:49,511 INFO L475 AbstractCegarLoop]: Abstraction has 418 states and 622 transitions. [2019-09-09 05:54:49,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 622 transitions. [2019-09-09 05:54:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-09 05:54:49,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:49,512 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:49,512 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:49,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:49,513 INFO L82 PathProgramCache]: Analyzing trace with hash 822164764, now seen corresponding path program 1 times [2019-09-09 05:54:49,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:49,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:49,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:54:49,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:49,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:49,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:49,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:49,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:49,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:49,594 INFO L87 Difference]: Start difference. First operand 418 states and 622 transitions. Second operand 4 states. [2019-09-09 05:54:49,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:49,912 INFO L93 Difference]: Finished difference Result 453 states and 670 transitions. [2019-09-09 05:54:49,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:49,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-09 05:54:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:49,914 INFO L225 Difference]: With dead ends: 453 [2019-09-09 05:54:49,914 INFO L226 Difference]: Without dead ends: 453 [2019-09-09 05:54:49,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:49,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-09 05:54:49,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 419. [2019-09-09 05:54:49,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-09 05:54:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 623 transitions. [2019-09-09 05:54:49,921 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 623 transitions. Word has length 154 [2019-09-09 05:54:49,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:49,921 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 623 transitions. [2019-09-09 05:54:49,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:49,922 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 623 transitions. [2019-09-09 05:54:49,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-09 05:54:49,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:49,923 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:49,923 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:49,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:49,924 INFO L82 PathProgramCache]: Analyzing trace with hash -3068263, now seen corresponding path program 1 times [2019-09-09 05:54:49,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:49,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:49,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:54:49,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:49,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:49,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:49,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:49,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:49,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:49,974 INFO L87 Difference]: Start difference. First operand 419 states and 623 transitions. Second operand 4 states. [2019-09-09 05:54:50,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:50,284 INFO L93 Difference]: Finished difference Result 443 states and 656 transitions. [2019-09-09 05:54:50,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:50,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-09 05:54:50,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:50,285 INFO L225 Difference]: With dead ends: 443 [2019-09-09 05:54:50,285 INFO L226 Difference]: Without dead ends: 443 [2019-09-09 05:54:50,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:50,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-09 05:54:50,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 419. [2019-09-09 05:54:50,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-09 05:54:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 622 transitions. [2019-09-09 05:54:50,290 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 622 transitions. Word has length 154 [2019-09-09 05:54:50,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:50,291 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 622 transitions. [2019-09-09 05:54:50,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 622 transitions. [2019-09-09 05:54:50,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:54:50,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:50,292 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:50,293 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:50,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:50,293 INFO L82 PathProgramCache]: Analyzing trace with hash 23015918, now seen corresponding path program 1 times [2019-09-09 05:54:50,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:50,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:50,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:50,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:50,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:54:50,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:50,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:50,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:50,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:50,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:50,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:50,373 INFO L87 Difference]: Start difference. First operand 419 states and 622 transitions. Second operand 4 states. [2019-09-09 05:54:50,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:50,759 INFO L93 Difference]: Finished difference Result 462 states and 679 transitions. [2019-09-09 05:54:50,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:50,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-09 05:54:50,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:50,761 INFO L225 Difference]: With dead ends: 462 [2019-09-09 05:54:50,761 INFO L226 Difference]: Without dead ends: 462 [2019-09-09 05:54:50,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-09 05:54:50,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 419. [2019-09-09 05:54:50,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-09 05:54:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 621 transitions. [2019-09-09 05:54:50,768 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 621 transitions. Word has length 155 [2019-09-09 05:54:50,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:50,769 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 621 transitions. [2019-09-09 05:54:50,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:50,769 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 621 transitions. [2019-09-09 05:54:50,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:54:50,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:50,770 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:50,771 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:50,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:50,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2060595530, now seen corresponding path program 1 times [2019-09-09 05:54:50,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:50,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:50,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:50,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:50,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:54:50,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:50,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:50,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:50,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:50,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:50,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:50,839 INFO L87 Difference]: Start difference. First operand 419 states and 621 transitions. Second operand 4 states. [2019-09-09 05:54:51,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:51,169 INFO L93 Difference]: Finished difference Result 451 states and 665 transitions. [2019-09-09 05:54:51,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:51,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-09 05:54:51,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:51,171 INFO L225 Difference]: With dead ends: 451 [2019-09-09 05:54:51,171 INFO L226 Difference]: Without dead ends: 451 [2019-09-09 05:54:51,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:51,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-09 05:54:51,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 420. [2019-09-09 05:54:51,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-09-09 05:54:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 622 transitions. [2019-09-09 05:54:51,177 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 622 transitions. Word has length 155 [2019-09-09 05:54:51,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:51,177 INFO L475 AbstractCegarLoop]: Abstraction has 420 states and 622 transitions. [2019-09-09 05:54:51,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:51,177 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 622 transitions. [2019-09-09 05:54:51,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:54:51,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:51,178 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:51,178 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:51,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:51,178 INFO L82 PathProgramCache]: Analyzing trace with hash 115889446, now seen corresponding path program 1 times [2019-09-09 05:54:51,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:51,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:51,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:51,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:51,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:51,243 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:51,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:51,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:51,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:51,244 INFO L87 Difference]: Start difference. First operand 420 states and 622 transitions. Second operand 4 states. [2019-09-09 05:54:51,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:51,584 INFO L93 Difference]: Finished difference Result 459 states and 673 transitions. [2019-09-09 05:54:51,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:51,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:54:51,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:51,587 INFO L225 Difference]: With dead ends: 459 [2019-09-09 05:54:51,587 INFO L226 Difference]: Without dead ends: 459 [2019-09-09 05:54:51,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:51,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-09 05:54:51,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 420. [2019-09-09 05:54:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-09-09 05:54:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 621 transitions. [2019-09-09 05:54:51,594 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 621 transitions. Word has length 156 [2019-09-09 05:54:51,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:51,594 INFO L475 AbstractCegarLoop]: Abstraction has 420 states and 621 transitions. [2019-09-09 05:54:51,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:51,594 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 621 transitions. [2019-09-09 05:54:51,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:54:51,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:51,595 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:51,595 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:51,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:51,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1406113165, now seen corresponding path program 1 times [2019-09-09 05:54:51,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:51,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:51,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:54:51,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:51,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:51,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:51,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:51,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:51,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:51,659 INFO L87 Difference]: Start difference. First operand 420 states and 621 transitions. Second operand 4 states. [2019-09-09 05:54:52,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:52,005 INFO L93 Difference]: Finished difference Result 457 states and 670 transitions. [2019-09-09 05:54:52,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:52,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:54:52,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:52,007 INFO L225 Difference]: With dead ends: 457 [2019-09-09 05:54:52,007 INFO L226 Difference]: Without dead ends: 457 [2019-09-09 05:54:52,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:52,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-09 05:54:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 420. [2019-09-09 05:54:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-09-09 05:54:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 620 transitions. [2019-09-09 05:54:52,013 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 620 transitions. Word has length 156 [2019-09-09 05:54:52,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:52,014 INFO L475 AbstractCegarLoop]: Abstraction has 420 states and 620 transitions. [2019-09-09 05:54:52,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:52,014 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 620 transitions. [2019-09-09 05:54:52,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:54:52,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:52,015 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:52,015 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:52,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:52,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1838010409, now seen corresponding path program 1 times [2019-09-09 05:54:52,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:52,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:52,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:52,072 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:54:52,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:52,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:52,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:52,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:52,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:52,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:52,073 INFO L87 Difference]: Start difference. First operand 420 states and 620 transitions. Second operand 4 states. [2019-09-09 05:54:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:52,412 INFO L93 Difference]: Finished difference Result 451 states and 662 transitions. [2019-09-09 05:54:52,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:52,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:54:52,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:52,413 INFO L225 Difference]: With dead ends: 451 [2019-09-09 05:54:52,414 INFO L226 Difference]: Without dead ends: 451 [2019-09-09 05:54:52,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:52,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-09 05:54:52,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 421. [2019-09-09 05:54:52,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-09 05:54:52,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 621 transitions. [2019-09-09 05:54:52,419 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 621 transitions. Word has length 156 [2019-09-09 05:54:52,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:52,419 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 621 transitions. [2019-09-09 05:54:52,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:52,420 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 621 transitions. [2019-09-09 05:54:52,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-09 05:54:52,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:52,421 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:52,421 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:52,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:52,421 INFO L82 PathProgramCache]: Analyzing trace with hash 7818833, now seen corresponding path program 1 times [2019-09-09 05:54:52,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:52,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:52,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:54:52,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:52,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:52,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:52,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:52,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:52,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:52,504 INFO L87 Difference]: Start difference. First operand 421 states and 621 transitions. Second operand 4 states. [2019-09-09 05:54:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:52,805 INFO L93 Difference]: Finished difference Result 449 states and 659 transitions. [2019-09-09 05:54:52,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:52,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-09 05:54:52,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:52,807 INFO L225 Difference]: With dead ends: 449 [2019-09-09 05:54:52,807 INFO L226 Difference]: Without dead ends: 449 [2019-09-09 05:54:52,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:52,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-09 05:54:52,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 422. [2019-09-09 05:54:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-09 05:54:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 622 transitions. [2019-09-09 05:54:52,812 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 622 transitions. Word has length 157 [2019-09-09 05:54:52,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:52,813 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 622 transitions. [2019-09-09 05:54:52,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 622 transitions. [2019-09-09 05:54:52,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:54:52,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:52,814 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:52,814 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:52,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:52,815 INFO L82 PathProgramCache]: Analyzing trace with hash 982939784, now seen corresponding path program 1 times [2019-09-09 05:54:52,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:52,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:52,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:52,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:52,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:52,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:52,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:52,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:52,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:52,887 INFO L87 Difference]: Start difference. First operand 422 states and 622 transitions. Second operand 4 states. [2019-09-09 05:54:53,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:53,238 INFO L93 Difference]: Finished difference Result 457 states and 667 transitions. [2019-09-09 05:54:53,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:53,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-09 05:54:53,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:53,240 INFO L225 Difference]: With dead ends: 457 [2019-09-09 05:54:53,240 INFO L226 Difference]: Without dead ends: 457 [2019-09-09 05:54:53,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:53,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-09 05:54:53,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 422. [2019-09-09 05:54:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-09 05:54:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 621 transitions. [2019-09-09 05:54:53,246 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 621 transitions. Word has length 158 [2019-09-09 05:54:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:53,247 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 621 transitions. [2019-09-09 05:54:53,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 621 transitions. [2019-09-09 05:54:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-09 05:54:53,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:53,249 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:53,249 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:53,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:53,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1810073576, now seen corresponding path program 1 times [2019-09-09 05:54:53,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:53,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:53,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:53,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:53,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:53,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:53,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:53,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:53,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:53,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:53,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:53,312 INFO L87 Difference]: Start difference. First operand 422 states and 621 transitions. Second operand 4 states. [2019-09-09 05:54:53,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:53,655 INFO L93 Difference]: Finished difference Result 453 states and 661 transitions. [2019-09-09 05:54:53,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:53,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-09 05:54:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:53,657 INFO L225 Difference]: With dead ends: 453 [2019-09-09 05:54:53,657 INFO L226 Difference]: Without dead ends: 453 [2019-09-09 05:54:53,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:53,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-09 05:54:53,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 422. [2019-09-09 05:54:53,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-09 05:54:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 620 transitions. [2019-09-09 05:54:53,663 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 620 transitions. Word has length 159 [2019-09-09 05:54:53,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:53,663 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 620 transitions. [2019-09-09 05:54:53,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:53,663 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 620 transitions. [2019-09-09 05:54:53,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-09 05:54:53,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:53,665 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:53,665 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:53,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:53,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2028356679, now seen corresponding path program 1 times [2019-09-09 05:54:53,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:53,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:53,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:53,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:53,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:53,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:53,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:53,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:53,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:53,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:53,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:53,742 INFO L87 Difference]: Start difference. First operand 422 states and 620 transitions. Second operand 4 states. [2019-09-09 05:54:54,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:54,066 INFO L93 Difference]: Finished difference Result 453 states and 660 transitions. [2019-09-09 05:54:54,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:54,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-09 05:54:54,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:54,068 INFO L225 Difference]: With dead ends: 453 [2019-09-09 05:54:54,068 INFO L226 Difference]: Without dead ends: 453 [2019-09-09 05:54:54,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:54,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-09 05:54:54,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 422. [2019-09-09 05:54:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-09 05:54:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 619 transitions. [2019-09-09 05:54:54,073 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 619 transitions. Word has length 159 [2019-09-09 05:54:54,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:54,074 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 619 transitions. [2019-09-09 05:54:54,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:54,074 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 619 transitions. [2019-09-09 05:54:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-09 05:54:54,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:54,076 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:54,076 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:54,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:54,076 INFO L82 PathProgramCache]: Analyzing trace with hash -232447047, now seen corresponding path program 1 times [2019-09-09 05:54:54,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:54,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:54,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:54,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:54,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:54,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:54,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:54,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:54,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:54,195 INFO L87 Difference]: Start difference. First operand 422 states and 619 transitions. Second operand 4 states. [2019-09-09 05:54:54,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:54,551 INFO L93 Difference]: Finished difference Result 451 states and 657 transitions. [2019-09-09 05:54:54,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:54,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-09 05:54:54,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:54,553 INFO L225 Difference]: With dead ends: 451 [2019-09-09 05:54:54,553 INFO L226 Difference]: Without dead ends: 451 [2019-09-09 05:54:54,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:54,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-09 05:54:54,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 422. [2019-09-09 05:54:54,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-09 05:54:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 618 transitions. [2019-09-09 05:54:54,559 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 618 transitions. Word has length 160 [2019-09-09 05:54:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:54,559 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 618 transitions. [2019-09-09 05:54:54,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 618 transitions. [2019-09-09 05:54:54,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 05:54:54,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:54,561 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:54,562 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:54,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:54,562 INFO L82 PathProgramCache]: Analyzing trace with hash -999982284, now seen corresponding path program 1 times [2019-09-09 05:54:54,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:54,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:54,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:54,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:54,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:54,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:54,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:54,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:54,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:54,644 INFO L87 Difference]: Start difference. First operand 422 states and 618 transitions. Second operand 4 states. [2019-09-09 05:54:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:54,965 INFO L93 Difference]: Finished difference Result 451 states and 656 transitions. [2019-09-09 05:54:54,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:54,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-09 05:54:54,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:54,967 INFO L225 Difference]: With dead ends: 451 [2019-09-09 05:54:54,967 INFO L226 Difference]: Without dead ends: 451 [2019-09-09 05:54:54,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:54,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-09 05:54:54,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 422. [2019-09-09 05:54:54,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-09 05:54:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 617 transitions. [2019-09-09 05:54:54,972 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 617 transitions. Word has length 161 [2019-09-09 05:54:54,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:54,972 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 617 transitions. [2019-09-09 05:54:54,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:54,973 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 617 transitions. [2019-09-09 05:54:54,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 05:54:54,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:54,974 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:54,974 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:54,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:54,974 INFO L82 PathProgramCache]: Analyzing trace with hash -923046989, now seen corresponding path program 1 times [2019-09-09 05:54:54,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:54,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:54,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:54:55,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:55,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:55,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:55,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:55,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:55,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:55,064 INFO L87 Difference]: Start difference. First operand 422 states and 617 transitions. Second operand 4 states. [2019-09-09 05:54:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:55,422 INFO L93 Difference]: Finished difference Result 488 states and 718 transitions. [2019-09-09 05:54:55,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:55,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-09 05:54:55,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:55,424 INFO L225 Difference]: With dead ends: 488 [2019-09-09 05:54:55,425 INFO L226 Difference]: Without dead ends: 488 [2019-09-09 05:54:55,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:55,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-09 05:54:55,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 452. [2019-09-09 05:54:55,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-09-09 05:54:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 670 transitions. [2019-09-09 05:54:55,430 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 670 transitions. Word has length 161 [2019-09-09 05:54:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:55,431 INFO L475 AbstractCegarLoop]: Abstraction has 452 states and 670 transitions. [2019-09-09 05:54:55,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:55,431 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 670 transitions. [2019-09-09 05:54:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-09 05:54:55,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:55,432 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:55,433 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:55,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:55,433 INFO L82 PathProgramCache]: Analyzing trace with hash 216886932, now seen corresponding path program 1 times [2019-09-09 05:54:55,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:55,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:55,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:55,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:55,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:55,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:55,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:55,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:55,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:55,523 INFO L87 Difference]: Start difference. First operand 452 states and 670 transitions. Second operand 4 states. [2019-09-09 05:54:55,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:55,894 INFO L93 Difference]: Finished difference Result 479 states and 706 transitions. [2019-09-09 05:54:55,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:55,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-09 05:54:55,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:55,895 INFO L225 Difference]: With dead ends: 479 [2019-09-09 05:54:55,895 INFO L226 Difference]: Without dead ends: 479 [2019-09-09 05:54:55,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-09 05:54:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 414. [2019-09-09 05:54:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-09-09 05:54:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 614 transitions. [2019-09-09 05:54:55,900 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 614 transitions. Word has length 162 [2019-09-09 05:54:55,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:55,900 INFO L475 AbstractCegarLoop]: Abstraction has 414 states and 614 transitions. [2019-09-09 05:54:55,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 614 transitions. [2019-09-09 05:54:55,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-09 05:54:55,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:55,902 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:55,902 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:55,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:55,902 INFO L82 PathProgramCache]: Analyzing trace with hash 890564276, now seen corresponding path program 1 times [2019-09-09 05:54:55,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:55,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:55,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-09 05:54:55,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:55,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:55,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:55,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:55,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:55,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:55,984 INFO L87 Difference]: Start difference. First operand 414 states and 614 transitions. Second operand 4 states. [2019-09-09 05:54:56,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:56,302 INFO L93 Difference]: Finished difference Result 479 states and 705 transitions. [2019-09-09 05:54:56,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:56,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-09 05:54:56,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:56,304 INFO L225 Difference]: With dead ends: 479 [2019-09-09 05:54:56,304 INFO L226 Difference]: Without dead ends: 479 [2019-09-09 05:54:56,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-09 05:54:56,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 444. [2019-09-09 05:54:56,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-09-09 05:54:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 659 transitions. [2019-09-09 05:54:56,309 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 659 transitions. Word has length 164 [2019-09-09 05:54:56,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:56,310 INFO L475 AbstractCegarLoop]: Abstraction has 444 states and 659 transitions. [2019-09-09 05:54:56,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 659 transitions. [2019-09-09 05:54:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-09 05:54:56,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:56,311 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:56,311 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:56,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:56,312 INFO L82 PathProgramCache]: Analyzing trace with hash -189712951, now seen corresponding path program 1 times [2019-09-09 05:54:56,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:56,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:56,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-09 05:54:56,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:56,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:56,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:56,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:56,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:56,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:56,360 INFO L87 Difference]: Start difference. First operand 444 states and 659 transitions. Second operand 4 states. [2019-09-09 05:54:56,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:56,736 INFO L93 Difference]: Finished difference Result 483 states and 710 transitions. [2019-09-09 05:54:56,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:56,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-09 05:54:56,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:56,738 INFO L225 Difference]: With dead ends: 483 [2019-09-09 05:54:56,739 INFO L226 Difference]: Without dead ends: 483 [2019-09-09 05:54:56,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:56,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-09 05:54:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 444. [2019-09-09 05:54:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-09-09 05:54:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 658 transitions. [2019-09-09 05:54:56,744 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 658 transitions. Word has length 164 [2019-09-09 05:54:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:56,745 INFO L475 AbstractCegarLoop]: Abstraction has 444 states and 658 transitions. [2019-09-09 05:54:56,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 658 transitions. [2019-09-09 05:54:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-09 05:54:56,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:56,746 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:56,747 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:56,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:56,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1781223072, now seen corresponding path program 1 times [2019-09-09 05:54:56,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:56,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:56,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-09 05:54:56,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:56,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:56,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:56,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:56,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:56,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:56,819 INFO L87 Difference]: Start difference. First operand 444 states and 658 transitions. Second operand 4 states. [2019-09-09 05:54:57,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:57,112 INFO L93 Difference]: Finished difference Result 457 states and 675 transitions. [2019-09-09 05:54:57,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:57,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-09 05:54:57,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:57,114 INFO L225 Difference]: With dead ends: 457 [2019-09-09 05:54:57,114 INFO L226 Difference]: Without dead ends: 457 [2019-09-09 05:54:57,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:57,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-09 05:54:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 444. [2019-09-09 05:54:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-09-09 05:54:57,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 657 transitions. [2019-09-09 05:54:57,123 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 657 transitions. Word has length 165 [2019-09-09 05:54:57,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:57,124 INFO L475 AbstractCegarLoop]: Abstraction has 444 states and 657 transitions. [2019-09-09 05:54:57,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:57,124 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 657 transitions. [2019-09-09 05:54:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-09 05:54:57,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:57,128 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:57,128 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:57,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:57,128 INFO L82 PathProgramCache]: Analyzing trace with hash -2016657534, now seen corresponding path program 1 times [2019-09-09 05:54:57,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:57,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:57,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:57,196 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-09 05:54:57,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:57,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:57,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:57,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:57,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:57,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:57,202 INFO L87 Difference]: Start difference. First operand 444 states and 657 transitions. Second operand 4 states. [2019-09-09 05:54:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:57,560 INFO L93 Difference]: Finished difference Result 483 states and 708 transitions. [2019-09-09 05:54:57,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:57,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-09 05:54:57,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:57,563 INFO L225 Difference]: With dead ends: 483 [2019-09-09 05:54:57,563 INFO L226 Difference]: Without dead ends: 483 [2019-09-09 05:54:57,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:57,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-09 05:54:57,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 444. [2019-09-09 05:54:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-09-09 05:54:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 656 transitions. [2019-09-09 05:54:57,568 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 656 transitions. Word has length 165 [2019-09-09 05:54:57,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:57,569 INFO L475 AbstractCegarLoop]: Abstraction has 444 states and 656 transitions. [2019-09-09 05:54:57,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 656 transitions. [2019-09-09 05:54:57,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-09 05:54:57,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:57,570 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:57,570 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:57,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:57,570 INFO L82 PathProgramCache]: Analyzing trace with hash -144166652, now seen corresponding path program 1 times [2019-09-09 05:54:57,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:57,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:57,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:57,628 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-09 05:54:57,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:57,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:57,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:57,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:57,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:57,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:57,630 INFO L87 Difference]: Start difference. First operand 444 states and 656 transitions. Second operand 4 states. [2019-09-09 05:54:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:57,949 INFO L93 Difference]: Finished difference Result 468 states and 689 transitions. [2019-09-09 05:54:57,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:57,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-09 05:54:57,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:57,951 INFO L225 Difference]: With dead ends: 468 [2019-09-09 05:54:57,951 INFO L226 Difference]: Without dead ends: 468 [2019-09-09 05:54:57,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:57,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-09-09 05:54:57,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 444. [2019-09-09 05:54:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-09-09 05:54:57,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 655 transitions. [2019-09-09 05:54:57,956 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 655 transitions. Word has length 166 [2019-09-09 05:54:57,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:57,957 INFO L475 AbstractCegarLoop]: Abstraction has 444 states and 655 transitions. [2019-09-09 05:54:57,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:57,957 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 655 transitions. [2019-09-09 05:54:57,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-09 05:54:57,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:57,958 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:57,958 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:57,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:57,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1645060568, now seen corresponding path program 1 times [2019-09-09 05:54:57,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:57,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:57,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:54:58,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:58,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:54:58,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:58,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:54:58,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:54:58,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:58,109 INFO L87 Difference]: Start difference. First operand 444 states and 655 transitions. Second operand 5 states. [2019-09-09 05:54:58,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:58,690 INFO L93 Difference]: Finished difference Result 520 states and 771 transitions. [2019-09-09 05:54:58,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:54:58,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2019-09-09 05:54:58,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:58,692 INFO L225 Difference]: With dead ends: 520 [2019-09-09 05:54:58,692 INFO L226 Difference]: Without dead ends: 520 [2019-09-09 05:54:58,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:54:58,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-09-09 05:54:58,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 477. [2019-09-09 05:54:58,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-09-09 05:54:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 714 transitions. [2019-09-09 05:54:58,699 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 714 transitions. Word has length 166 [2019-09-09 05:54:58,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:58,699 INFO L475 AbstractCegarLoop]: Abstraction has 477 states and 714 transitions. [2019-09-09 05:54:58,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:54:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 714 transitions. [2019-09-09 05:54:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-09 05:54:58,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:58,700 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:58,701 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:58,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:58,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1092324723, now seen corresponding path program 1 times [2019-09-09 05:54:58,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:58,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:58,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-09 05:54:58,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:58,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:58,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:58,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:58,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:58,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:58,752 INFO L87 Difference]: Start difference. First operand 477 states and 714 transitions. Second operand 4 states. [2019-09-09 05:54:59,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:59,067 INFO L93 Difference]: Finished difference Result 499 states and 745 transitions. [2019-09-09 05:54:59,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:59,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-09 05:54:59,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:59,068 INFO L225 Difference]: With dead ends: 499 [2019-09-09 05:54:59,068 INFO L226 Difference]: Without dead ends: 499 [2019-09-09 05:54:59,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:59,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-09 05:54:59,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 477. [2019-09-09 05:54:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-09-09 05:54:59,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 713 transitions. [2019-09-09 05:54:59,074 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 713 transitions. Word has length 167 [2019-09-09 05:54:59,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:59,074 INFO L475 AbstractCegarLoop]: Abstraction has 477 states and 713 transitions. [2019-09-09 05:54:59,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:59,074 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 713 transitions. [2019-09-09 05:54:59,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-09 05:54:59,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:59,075 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:59,075 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:59,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:59,075 INFO L82 PathProgramCache]: Analyzing trace with hash -60130333, now seen corresponding path program 1 times [2019-09-09 05:54:59,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:59,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:59,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:59,158 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-09 05:54:59,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:59,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:59,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:59,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:59,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:59,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:59,160 INFO L87 Difference]: Start difference. First operand 477 states and 713 transitions. Second operand 3 states. [2019-09-09 05:54:59,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:59,198 INFO L93 Difference]: Finished difference Result 923 states and 1385 transitions. [2019-09-09 05:54:59,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:59,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-09 05:54:59,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:59,200 INFO L225 Difference]: With dead ends: 923 [2019-09-09 05:54:59,200 INFO L226 Difference]: Without dead ends: 923 [2019-09-09 05:54:59,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:59,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-09-09 05:54:59,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2019-09-09 05:54:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2019-09-09 05:54:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1385 transitions. [2019-09-09 05:54:59,210 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1385 transitions. Word has length 170 [2019-09-09 05:54:59,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:59,210 INFO L475 AbstractCegarLoop]: Abstraction has 923 states and 1385 transitions. [2019-09-09 05:54:59,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1385 transitions. [2019-09-09 05:54:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-09 05:54:59,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:59,214 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:59,215 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:59,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:59,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1667749452, now seen corresponding path program 1 times [2019-09-09 05:54:59,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:59,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:59,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-09 05:54:59,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:59,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:59,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:59,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:59,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:59,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:59,304 INFO L87 Difference]: Start difference. First operand 923 states and 1385 transitions. Second operand 4 states. [2019-09-09 05:54:59,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:59,627 INFO L93 Difference]: Finished difference Result 993 states and 1471 transitions. [2019-09-09 05:54:59,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:59,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-09-09 05:54:59,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:59,630 INFO L225 Difference]: With dead ends: 993 [2019-09-09 05:54:59,630 INFO L226 Difference]: Without dead ends: 993 [2019-09-09 05:54:59,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:59,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-09-09 05:54:59,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 863. [2019-09-09 05:54:59,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-09-09 05:54:59,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1293 transitions. [2019-09-09 05:54:59,640 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1293 transitions. Word has length 171 [2019-09-09 05:54:59,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:59,641 INFO L475 AbstractCegarLoop]: Abstraction has 863 states and 1293 transitions. [2019-09-09 05:54:59,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:59,641 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1293 transitions. [2019-09-09 05:54:59,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-09 05:54:59,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:59,643 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:59,643 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:59,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:59,643 INFO L82 PathProgramCache]: Analyzing trace with hash 945837177, now seen corresponding path program 1 times [2019-09-09 05:54:59,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:59,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:59,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:59,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:59,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:59,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:59,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:59,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:59,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:59,718 INFO L87 Difference]: Start difference. First operand 863 states and 1293 transitions. Second operand 3 states. [2019-09-09 05:54:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:59,763 INFO L93 Difference]: Finished difference Result 1277 states and 1915 transitions. [2019-09-09 05:54:59,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:59,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-09 05:54:59,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:59,766 INFO L225 Difference]: With dead ends: 1277 [2019-09-09 05:54:59,766 INFO L226 Difference]: Without dead ends: 1277 [2019-09-09 05:54:59,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:59,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2019-09-09 05:54:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1275. [2019-09-09 05:54:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-09-09 05:54:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1914 transitions. [2019-09-09 05:54:59,781 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1914 transitions. Word has length 171 [2019-09-09 05:54:59,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:59,781 INFO L475 AbstractCegarLoop]: Abstraction has 1275 states and 1914 transitions. [2019-09-09 05:54:59,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:59,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1914 transitions. [2019-09-09 05:54:59,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-09 05:54:59,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:59,783 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:59,784 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:59,784 INFO L82 PathProgramCache]: Analyzing trace with hash -772275919, now seen corresponding path program 1 times [2019-09-09 05:54:59,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:59,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:59,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:59,866 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-09 05:54:59,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:59,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:59,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:59,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:59,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:59,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:59,868 INFO L87 Difference]: Start difference. First operand 1275 states and 1914 transitions. Second operand 4 states. [2019-09-09 05:55:00,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:00,195 INFO L93 Difference]: Finished difference Result 1462 states and 2168 transitions. [2019-09-09 05:55:00,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:00,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-09-09 05:55:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:00,198 INFO L225 Difference]: With dead ends: 1462 [2019-09-09 05:55:00,198 INFO L226 Difference]: Without dead ends: 1462 [2019-09-09 05:55:00,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:00,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2019-09-09 05:55:00,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1368. [2019-09-09 05:55:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-09-09 05:55:00,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2052 transitions. [2019-09-09 05:55:00,213 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2052 transitions. Word has length 172 [2019-09-09 05:55:00,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:00,213 INFO L475 AbstractCegarLoop]: Abstraction has 1368 states and 2052 transitions. [2019-09-09 05:55:00,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:00,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2052 transitions. [2019-09-09 05:55:00,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-09 05:55:00,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:00,216 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:00,216 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:00,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:00,216 INFO L82 PathProgramCache]: Analyzing trace with hash -502911780, now seen corresponding path program 1 times [2019-09-09 05:55:00,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:00,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:00,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:00,278 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-09 05:55:00,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:00,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:00,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:00,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:00,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:00,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:00,280 INFO L87 Difference]: Start difference. First operand 1368 states and 2052 transitions. Second operand 3 states. [2019-09-09 05:55:00,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:00,322 INFO L93 Difference]: Finished difference Result 1783 states and 2676 transitions. [2019-09-09 05:55:00,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:00,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-09 05:55:00,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:00,325 INFO L225 Difference]: With dead ends: 1783 [2019-09-09 05:55:00,325 INFO L226 Difference]: Without dead ends: 1783 [2019-09-09 05:55:00,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:00,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2019-09-09 05:55:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1779. [2019-09-09 05:55:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-09-09 05:55:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2673 transitions. [2019-09-09 05:55:00,343 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2673 transitions. Word has length 172 [2019-09-09 05:55:00,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:00,343 INFO L475 AbstractCegarLoop]: Abstraction has 1779 states and 2673 transitions. [2019-09-09 05:55:00,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:00,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2673 transitions. [2019-09-09 05:55:00,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-09 05:55:00,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:00,346 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:00,346 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:00,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:00,346 INFO L82 PathProgramCache]: Analyzing trace with hash -937417378, now seen corresponding path program 1 times [2019-09-09 05:55:00,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:00,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:00,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-09 05:55:00,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:00,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:00,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:00,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:00,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:00,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:00,406 INFO L87 Difference]: Start difference. First operand 1779 states and 2673 transitions. Second operand 3 states. [2019-09-09 05:55:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:00,446 INFO L93 Difference]: Finished difference Result 1806 states and 2708 transitions. [2019-09-09 05:55:00,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:00,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-09 05:55:00,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:00,450 INFO L225 Difference]: With dead ends: 1806 [2019-09-09 05:55:00,450 INFO L226 Difference]: Without dead ends: 1806 [2019-09-09 05:55:00,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:00,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2019-09-09 05:55:00,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1806. [2019-09-09 05:55:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1806 states. [2019-09-09 05:55:00,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2708 transitions. [2019-09-09 05:55:00,472 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2708 transitions. Word has length 172 [2019-09-09 05:55:00,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:00,472 INFO L475 AbstractCegarLoop]: Abstraction has 1806 states and 2708 transitions. [2019-09-09 05:55:00,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:00,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2708 transitions. [2019-09-09 05:55:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-09 05:55:00,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:00,476 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:00,476 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:00,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:00,477 INFO L82 PathProgramCache]: Analyzing trace with hash 993708256, now seen corresponding path program 1 times [2019-09-09 05:55:00,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:00,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:00,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-09 05:55:00,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:00,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:00,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:00,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:00,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:00,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:00,543 INFO L87 Difference]: Start difference. First operand 1806 states and 2708 transitions. Second operand 3 states. [2019-09-09 05:55:00,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:00,569 INFO L93 Difference]: Finished difference Result 1808 states and 2710 transitions. [2019-09-09 05:55:00,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:00,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-09 05:55:00,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:00,571 INFO L225 Difference]: With dead ends: 1808 [2019-09-09 05:55:00,571 INFO L226 Difference]: Without dead ends: 1808 [2019-09-09 05:55:00,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:00,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2019-09-09 05:55:00,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2019-09-09 05:55:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2019-09-09 05:55:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2710 transitions. [2019-09-09 05:55:00,592 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2710 transitions. Word has length 172 [2019-09-09 05:55:00,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:00,592 INFO L475 AbstractCegarLoop]: Abstraction has 1808 states and 2710 transitions. [2019-09-09 05:55:00,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2710 transitions. [2019-09-09 05:55:00,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-09 05:55:00,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:00,595 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:00,595 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:00,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:00,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1152091974, now seen corresponding path program 1 times [2019-09-09 05:55:00,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:00,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:00,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:55:00,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:00,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:00,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:00,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:00,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:00,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:00,677 INFO L87 Difference]: Start difference. First operand 1808 states and 2710 transitions. Second operand 4 states. [2019-09-09 05:55:01,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:01,029 INFO L93 Difference]: Finished difference Result 1953 states and 2893 transitions. [2019-09-09 05:55:01,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:01,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-09 05:55:01,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:01,033 INFO L225 Difference]: With dead ends: 1953 [2019-09-09 05:55:01,033 INFO L226 Difference]: Without dead ends: 1953 [2019-09-09 05:55:01,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:01,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2019-09-09 05:55:01,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1808. [2019-09-09 05:55:01,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2019-09-09 05:55:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2706 transitions. [2019-09-09 05:55:01,053 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2706 transitions. Word has length 176 [2019-09-09 05:55:01,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:01,054 INFO L475 AbstractCegarLoop]: Abstraction has 1808 states and 2706 transitions. [2019-09-09 05:55:01,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:01,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2706 transitions. [2019-09-09 05:55:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-09 05:55:01,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:01,056 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:01,056 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:01,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:01,057 INFO L82 PathProgramCache]: Analyzing trace with hash 924589477, now seen corresponding path program 1 times [2019-09-09 05:55:01,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:01,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:01,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:55:01,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:01,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:01,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:01,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:01,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:01,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:01,144 INFO L87 Difference]: Start difference. First operand 1808 states and 2706 transitions. Second operand 4 states. [2019-09-09 05:55:01,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:01,489 INFO L93 Difference]: Finished difference Result 1953 states and 2889 transitions. [2019-09-09 05:55:01,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:01,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-09-09 05:55:01,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:01,493 INFO L225 Difference]: With dead ends: 1953 [2019-09-09 05:55:01,493 INFO L226 Difference]: Without dead ends: 1953 [2019-09-09 05:55:01,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:01,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2019-09-09 05:55:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1808. [2019-09-09 05:55:01,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2019-09-09 05:55:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2702 transitions. [2019-09-09 05:55:01,512 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2702 transitions. Word has length 177 [2019-09-09 05:55:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:01,513 INFO L475 AbstractCegarLoop]: Abstraction has 1808 states and 2702 transitions. [2019-09-09 05:55:01,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2702 transitions. [2019-09-09 05:55:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-09 05:55:01,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:01,515 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:01,515 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:01,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:01,516 INFO L82 PathProgramCache]: Analyzing trace with hash 840177473, now seen corresponding path program 1 times [2019-09-09 05:55:01,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:01,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:01,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:55:01,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:01,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:01,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:01,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:01,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:01,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:01,606 INFO L87 Difference]: Start difference. First operand 1808 states and 2702 transitions. Second operand 4 states. [2019-09-09 05:55:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:01,956 INFO L93 Difference]: Finished difference Result 1953 states and 2885 transitions. [2019-09-09 05:55:01,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:01,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-09-09 05:55:01,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:01,959 INFO L225 Difference]: With dead ends: 1953 [2019-09-09 05:55:01,959 INFO L226 Difference]: Without dead ends: 1953 [2019-09-09 05:55:01,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:01,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2019-09-09 05:55:01,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1808. [2019-09-09 05:55:01,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2019-09-09 05:55:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2698 transitions. [2019-09-09 05:55:01,971 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2698 transitions. Word has length 178 [2019-09-09 05:55:01,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:01,972 INFO L475 AbstractCegarLoop]: Abstraction has 1808 states and 2698 transitions. [2019-09-09 05:55:01,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2698 transitions. [2019-09-09 05:55:01,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-09 05:55:01,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:01,973 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:01,973 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:01,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:01,974 INFO L82 PathProgramCache]: Analyzing trace with hash 896603456, now seen corresponding path program 1 times [2019-09-09 05:55:01,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:01,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:01,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:55:02,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:02,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:02,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:02,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:02,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:02,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:02,050 INFO L87 Difference]: Start difference. First operand 1808 states and 2698 transitions. Second operand 4 states. [2019-09-09 05:55:02,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:02,461 INFO L93 Difference]: Finished difference Result 1913 states and 2833 transitions. [2019-09-09 05:55:02,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:02,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-09-09 05:55:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:02,464 INFO L225 Difference]: With dead ends: 1913 [2019-09-09 05:55:02,464 INFO L226 Difference]: Without dead ends: 1913 [2019-09-09 05:55:02,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:02,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2019-09-09 05:55:02,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1808. [2019-09-09 05:55:02,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2019-09-09 05:55:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2694 transitions. [2019-09-09 05:55:02,484 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2694 transitions. Word has length 179 [2019-09-09 05:55:02,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:02,484 INFO L475 AbstractCegarLoop]: Abstraction has 1808 states and 2694 transitions. [2019-09-09 05:55:02,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:02,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2694 transitions. [2019-09-09 05:55:02,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-09 05:55:02,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:02,487 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:02,487 INFO L418 AbstractCegarLoop]: === Iteration 117 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:02,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:02,487 INFO L82 PathProgramCache]: Analyzing trace with hash -2076466559, now seen corresponding path program 1 times [2019-09-09 05:55:02,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:02,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:02,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:55:02,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:02,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:02,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:02,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:02,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:02,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:02,629 INFO L87 Difference]: Start difference. First operand 1808 states and 2694 transitions. Second operand 4 states. [2019-09-09 05:55:02,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:02,998 INFO L93 Difference]: Finished difference Result 1981 states and 2913 transitions. [2019-09-09 05:55:02,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:02,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-09-09 05:55:02,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:03,001 INFO L225 Difference]: With dead ends: 1981 [2019-09-09 05:55:03,001 INFO L226 Difference]: Without dead ends: 1981 [2019-09-09 05:55:03,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:03,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-09-09 05:55:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1808. [2019-09-09 05:55:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2019-09-09 05:55:03,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2690 transitions. [2019-09-09 05:55:03,014 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2690 transitions. Word has length 181 [2019-09-09 05:55:03,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:03,014 INFO L475 AbstractCegarLoop]: Abstraction has 1808 states and 2690 transitions. [2019-09-09 05:55:03,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2690 transitions. [2019-09-09 05:55:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-09 05:55:03,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:03,016 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:03,016 INFO L418 AbstractCegarLoop]: === Iteration 118 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:03,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:03,016 INFO L82 PathProgramCache]: Analyzing trace with hash -376477238, now seen corresponding path program 1 times [2019-09-09 05:55:03,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:03,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:03,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-09-09 05:55:03,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:03,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:55:03,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:03,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:55:03,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:55:03,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:03,127 INFO L87 Difference]: Start difference. First operand 1808 states and 2690 transitions. Second operand 5 states. [2019-09-09 05:55:03,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:03,575 INFO L93 Difference]: Finished difference Result 2252 states and 3359 transitions. [2019-09-09 05:55:03,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:03,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 182 [2019-09-09 05:55:03,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:03,578 INFO L225 Difference]: With dead ends: 2252 [2019-09-09 05:55:03,578 INFO L226 Difference]: Without dead ends: 2252 [2019-09-09 05:55:03,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:55:03,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2019-09-09 05:55:03,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 1967. [2019-09-09 05:55:03,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-09-09 05:55:03,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 2977 transitions. [2019-09-09 05:55:03,594 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 2977 transitions. Word has length 182 [2019-09-09 05:55:03,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:03,594 INFO L475 AbstractCegarLoop]: Abstraction has 1967 states and 2977 transitions. [2019-09-09 05:55:03,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:55:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2977 transitions. [2019-09-09 05:55:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-09 05:55:03,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:03,597 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:03,597 INFO L418 AbstractCegarLoop]: === Iteration 119 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:03,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:03,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1207604728, now seen corresponding path program 1 times [2019-09-09 05:55:03,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:03,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:03,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-09-09 05:55:03,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:03,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:55:03,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:03,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:55:03,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:55:03,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:03,725 INFO L87 Difference]: Start difference. First operand 1967 states and 2977 transitions. Second operand 5 states. [2019-09-09 05:55:04,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:04,203 INFO L93 Difference]: Finished difference Result 2364 states and 3579 transitions. [2019-09-09 05:55:04,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:04,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-09-09 05:55:04,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:04,207 INFO L225 Difference]: With dead ends: 2364 [2019-09-09 05:55:04,207 INFO L226 Difference]: Without dead ends: 2364 [2019-09-09 05:55:04,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:55:04,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2019-09-09 05:55:04,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2075. [2019-09-09 05:55:04,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2075 states. [2019-09-09 05:55:04,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3197 transitions. [2019-09-09 05:55:04,221 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3197 transitions. Word has length 183 [2019-09-09 05:55:04,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:04,221 INFO L475 AbstractCegarLoop]: Abstraction has 2075 states and 3197 transitions. [2019-09-09 05:55:04,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:55:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3197 transitions. [2019-09-09 05:55:04,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-09 05:55:04,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:04,223 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:04,223 INFO L418 AbstractCegarLoop]: === Iteration 120 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:04,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:04,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1301829684, now seen corresponding path program 1 times [2019-09-09 05:55:04,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:04,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:04,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-09 05:55:04,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:04,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:04,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:04,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:04,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:04,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:04,289 INFO L87 Difference]: Start difference. First operand 2075 states and 3197 transitions. Second operand 4 states. [2019-09-09 05:55:04,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:04,592 INFO L93 Difference]: Finished difference Result 2160 states and 3312 transitions. [2019-09-09 05:55:04,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:04,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-09-09 05:55:04,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:04,596 INFO L225 Difference]: With dead ends: 2160 [2019-09-09 05:55:04,596 INFO L226 Difference]: Without dead ends: 2160 [2019-09-09 05:55:04,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:04,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2019-09-09 05:55:04,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 2075. [2019-09-09 05:55:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2075 states. [2019-09-09 05:55:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3193 transitions. [2019-09-09 05:55:04,610 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3193 transitions. Word has length 194 [2019-09-09 05:55:04,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:04,611 INFO L475 AbstractCegarLoop]: Abstraction has 2075 states and 3193 transitions. [2019-09-09 05:55:04,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3193 transitions. [2019-09-09 05:55:04,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-09 05:55:04,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:04,612 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:04,613 INFO L418 AbstractCegarLoop]: === Iteration 121 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:04,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:04,613 INFO L82 PathProgramCache]: Analyzing trace with hash 463757215, now seen corresponding path program 1 times [2019-09-09 05:55:04,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:04,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:04,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:05,501 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 4 proven. 205 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:55:05,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:55:05,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:55:05,503 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2019-09-09 05:55:05,505 INFO L207 CegarAbsIntRunner]: [0], [43], [48], [50], [61], [63], [67], [76], [78], [83], [88], [93], [98], [103], [108], [113], [118], [121], [123], [128], [133], [136], [138], [143], [146], [148], [153], [156], [158], [163], [166], [168], [173], [178], [183], [186], [188], [193], [198], [203], [208], [213], [218], [221], [312], [315], [323], [325], [328], [336], [341], [343], [345], [348], [357], [359], [362], [366], [369], [398], [403], [413], [415], [418], [429], [431], [441], [443], [448], [470], [472], [506], [511], [598], [632], [634], [646], [649], [650], [662], [670], [671], [672] [2019-09-09 05:55:05,560 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:55:05,560 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:55:05,634 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:55:05,636 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-09 05:55:05,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:05,642 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:55:05,710 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-09 05:55:05,711 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:55:05,722 INFO L420 sIntCurrentIteration]: We unified 194 AI predicates to 194 [2019-09-09 05:55:05,723 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:55:05,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:55:05,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2019-09-09 05:55:05,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:05,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-09 05:55:05,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-09 05:55:05,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:55:05,728 INFO L87 Difference]: Start difference. First operand 2075 states and 3193 transitions. Second operand 2 states. [2019-09-09 05:55:05,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:05,730 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-09 05:55:05,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-09 05:55:05,730 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 195 [2019-09-09 05:55:05,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:05,731 INFO L225 Difference]: With dead ends: 2 [2019-09-09 05:55:05,731 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:55:05,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:55:05,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:55:05,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:55:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:55:05,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:55:05,732 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 195 [2019-09-09 05:55:05,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:05,732 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:55:05,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-09 05:55:05,733 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:55:05,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:55:05,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:55:05 BoogieIcfgContainer [2019-09-09 05:55:05,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:55:05,752 INFO L168 Benchmark]: Toolchain (without parser) took 55434.71 ms. Allocated memory was 132.1 MB in the beginning and 751.8 MB in the end (delta: 619.7 MB). Free memory was 85.5 MB in the beginning and 252.5 MB in the end (delta: -167.0 MB). Peak memory consumption was 452.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:05,753 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 132.1 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:55:05,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 935.92 ms. Allocated memory was 132.1 MB in the beginning and 200.3 MB in the end (delta: 68.2 MB). Free memory was 85.3 MB in the beginning and 155.5 MB in the end (delta: -70.2 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:05,754 INFO L168 Benchmark]: Boogie Preprocessor took 152.76 ms. Allocated memory is still 200.3 MB. Free memory was 155.5 MB in the beginning and 147.6 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:05,756 INFO L168 Benchmark]: RCFGBuilder took 1360.48 ms. Allocated memory was 200.3 MB in the beginning and 223.3 MB in the end (delta: 23.1 MB). Free memory was 147.6 MB in the beginning and 166.6 MB in the end (delta: -19.0 MB). Peak memory consumption was 81.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:05,757 INFO L168 Benchmark]: TraceAbstraction took 52970.83 ms. Allocated memory was 223.3 MB in the beginning and 751.8 MB in the end (delta: 528.5 MB). Free memory was 166.6 MB in the beginning and 252.5 MB in the end (delta: -85.9 MB). Peak memory consumption was 442.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:05,763 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 132.1 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 935.92 ms. Allocated memory was 132.1 MB in the beginning and 200.3 MB in the end (delta: 68.2 MB). Free memory was 85.3 MB in the beginning and 155.5 MB in the end (delta: -70.2 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 152.76 ms. Allocated memory is still 200.3 MB. Free memory was 155.5 MB in the beginning and 147.6 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1360.48 ms. Allocated memory was 200.3 MB in the beginning and 223.3 MB in the end (delta: 23.1 MB). Free memory was 147.6 MB in the beginning and 166.6 MB in the end (delta: -19.0 MB). Peak memory consumption was 81.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52970.83 ms. Allocated memory was 223.3 MB in the beginning and 751.8 MB in the end (delta: 528.5 MB). Free memory was 166.6 MB in the beginning and 252.5 MB in the end (delta: -85.9 MB). Peak memory consumption was 442.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1711]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 183 locations, 1 error locations. SAFE Result, 52.8s OverallTime, 121 OverallIterations, 7 TraceHistogramMax, 40.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 26317 SDtfs, 7950 SDslu, 37632 SDs, 0 SdLazy, 24339 SolverSat, 1094 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 841 GetRequests, 442 SyntacticMatches, 46 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2075occurred in iteration=119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.4278350515463918 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 121 MinimizatonAttempts, 5348 StatesRemovedByMinimization, 117 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 15589 NumberOfCodeBlocks, 15589 NumberOfCodeBlocksAsserted, 121 NumberOfCheckSat, 15468 ConstructedInterpolants, 0 QuantifiedInterpolants, 5413146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 121 InterpolantComputations, 120 PerfectInterpolantSequences, 16796/17001 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...