java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_srvr.blast.09.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:53:49,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:53:49,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:53:49,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:53:49,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:53:49,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:53:49,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:53:49,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:53:49,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:53:49,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:53:49,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:53:49,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:53:49,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:53:49,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:53:49,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:53:49,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:53:49,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:53:49,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:53:49,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:53:49,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:53:49,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:53:49,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:53:49,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:53:49,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:53:49,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:53:49,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:53:49,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:53:49,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:53:49,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:53:49,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:53:49,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:53:49,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:53:49,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:53:49,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:53:49,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:53:49,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:53:49,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:53:49,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:53:49,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:53:49,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:53:49,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:53:49,414 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:53:49,428 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:53:49,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:53:49,429 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:53:49,429 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:53:49,430 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:53:49,430 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:53:49,430 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:53:49,430 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:53:49,431 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:53:49,431 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:53:49,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:53:49,432 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:53:49,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:53:49,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:53:49,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:53:49,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:53:49,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:53:49,433 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:53:49,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:53:49,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:53:49,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:53:49,433 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:53:49,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:53:49,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:53:49,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:53:49,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:53:49,434 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:53:49,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:53:49,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:53:49,435 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:53:49,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:53:49,473 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:53:49,476 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:53:49,477 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:53:49,478 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:53:49,478 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.09.i.cil-2.c [2019-09-09 05:53:49,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f5cb21d6/fdc015b1ceb04afda81518bf8a6981de/FLAG0b39c8c66 [2019-09-09 05:53:50,078 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:53:50,079 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.09.i.cil-2.c [2019-09-09 05:53:50,098 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f5cb21d6/fdc015b1ceb04afda81518bf8a6981de/FLAG0b39c8c66 [2019-09-09 05:53:50,349 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f5cb21d6/fdc015b1ceb04afda81518bf8a6981de [2019-09-09 05:53:50,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:53:50,359 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:53:50,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:53:50,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:53:50,364 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:53:50,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:53:50" (1/1) ... [2019-09-09 05:53:50,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@613a2159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:50, skipping insertion in model container [2019-09-09 05:53:50,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:53:50" (1/1) ... [2019-09-09 05:53:50,375 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:53:50,464 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:53:51,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:53:51,116 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:53:51,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:53:51,326 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:53:51,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:51 WrapperNode [2019-09-09 05:53:51,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:53:51,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:53:51,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:53:51,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:53:51,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:51" (1/1) ... [2019-09-09 05:53:51,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:51" (1/1) ... [2019-09-09 05:53:51,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:51" (1/1) ... [2019-09-09 05:53:51,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:51" (1/1) ... [2019-09-09 05:53:51,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:51" (1/1) ... [2019-09-09 05:53:51,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:51" (1/1) ... [2019-09-09 05:53:51,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:51" (1/1) ... [2019-09-09 05:53:51,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:53:51,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:53:51,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:53:51,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:53:51,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:53:51,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:53:51,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:53:51,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-09 05:53:51,620 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-09 05:53:51,621 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:53:51,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:53:51,621 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-09 05:53:51,623 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-09 05:53:51,623 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-09 05:53:51,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:53:51,624 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-09 05:53:51,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:53:51,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:53:51,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:53:51,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:53:51,627 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-09 05:53:51,628 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-09 05:53:51,628 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-09 05:53:51,628 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:53:51,629 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-09 05:53:51,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-09 05:53:51,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-09 05:53:51,630 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:53:51,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-09 05:53:51,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-09 05:53:51,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-09 05:53:51,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-09 05:53:51,632 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-09 05:53:51,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-09 05:53:51,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:53:51,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-09 05:53:51,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-09 05:53:51,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-09 05:53:51,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:53:51,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-09 05:53:51,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-09 05:53:51,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-09 05:53:51,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-09 05:53:51,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-09 05:53:52,248 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:53:53,113 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-09 05:53:53,113 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-09 05:53:53,133 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:53:53,134 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:53:53,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:53:53 BoogieIcfgContainer [2019-09-09 05:53:53,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:53:53,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:53:53,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:53:53,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:53:53,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:53:50" (1/3) ... [2019-09-09 05:53:53,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4bddc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:53:53, skipping insertion in model container [2019-09-09 05:53:53,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:51" (2/3) ... [2019-09-09 05:53:53,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4bddc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:53:53, skipping insertion in model container [2019-09-09 05:53:53,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:53:53" (3/3) ... [2019-09-09 05:53:53,143 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-2.c [2019-09-09 05:53:53,153 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:53:53,162 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:53:53,181 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:53:53,215 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:53:53,215 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:53:53,215 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:53:53,215 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:53:53,215 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:53:53,215 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:53:53,216 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:53:53,216 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:53:53,243 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2019-09-09 05:53:53,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-09 05:53:53,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:53,261 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] [2019-09-09 05:53:53,265 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:53,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:53,271 INFO L82 PathProgramCache]: Analyzing trace with hash 514312201, now seen corresponding path program 1 times [2019-09-09 05:53:53,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:53,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:53,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:53,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:53,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:53,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:53,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:53,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:53,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:53,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:53,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:53,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:53,659 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2019-09-09 05:53:54,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:54,112 INFO L93 Difference]: Finished difference Result 190 states and 310 transitions. [2019-09-09 05:53:54,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:54,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-09 05:53:54,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:54,130 INFO L225 Difference]: With dead ends: 190 [2019-09-09 05:53:54,130 INFO L226 Difference]: Without dead ends: 169 [2019-09-09 05:53:54,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:54,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-09 05:53:54,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-09 05:53:54,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-09 05:53:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2019-09-09 05:53:54,186 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 41 [2019-09-09 05:53:54,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:54,187 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2019-09-09 05:53:54,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:54,187 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2019-09-09 05:53:54,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-09 05:53:54,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:54,190 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] [2019-09-09 05:53:54,190 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:54,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:54,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1818416469, now seen corresponding path program 1 times [2019-09-09 05:53:54,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:54,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:54,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:54,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:54,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:54,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:54,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:54,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:54,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:54,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:54,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:54,373 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2019-09-09 05:53:54,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:54,778 INFO L93 Difference]: Finished difference Result 169 states and 252 transitions. [2019-09-09 05:53:54,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:54,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-09-09 05:53:54,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:54,783 INFO L225 Difference]: With dead ends: 169 [2019-09-09 05:53:54,783 INFO L226 Difference]: Without dead ends: 169 [2019-09-09 05:53:54,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-09 05:53:54,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-09 05:53:54,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-09 05:53:54,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2019-09-09 05:53:54,803 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 54 [2019-09-09 05:53:54,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:54,804 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2019-09-09 05:53:54,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:54,804 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2019-09-09 05:53:54,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-09 05:53:54,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:54,810 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] [2019-09-09 05:53:54,811 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:54,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:54,812 INFO L82 PathProgramCache]: Analyzing trace with hash 737556739, now seen corresponding path program 1 times [2019-09-09 05:53:54,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:54,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:54,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:54,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:54,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:54,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:54,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:54,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:54,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:54,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:54,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:54,935 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 4 states. [2019-09-09 05:53:55,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:55,233 INFO L93 Difference]: Finished difference Result 168 states and 250 transitions. [2019-09-09 05:53:55,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:55,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-09 05:53:55,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:55,235 INFO L225 Difference]: With dead ends: 168 [2019-09-09 05:53:55,235 INFO L226 Difference]: Without dead ends: 168 [2019-09-09 05:53:55,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:55,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-09 05:53:55,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 152. [2019-09-09 05:53:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-09 05:53:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 230 transitions. [2019-09-09 05:53:55,245 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 230 transitions. Word has length 55 [2019-09-09 05:53:55,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:55,245 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 230 transitions. [2019-09-09 05:53:55,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:55,245 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 230 transitions. [2019-09-09 05:53:55,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-09 05:53:55,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:55,247 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] [2019-09-09 05:53:55,247 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:55,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:55,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1603135895, now seen corresponding path program 1 times [2019-09-09 05:53:55,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:55,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:55,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:55,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:55,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:53:55,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:55,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:53:55,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:53:55,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:55,356 INFO L87 Difference]: Start difference. First operand 152 states and 230 transitions. Second operand 5 states. [2019-09-09 05:53:55,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:55,818 INFO L93 Difference]: Finished difference Result 173 states and 258 transitions. [2019-09-09 05:53:55,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:53:55,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-09 05:53:55,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:55,836 INFO L225 Difference]: With dead ends: 173 [2019-09-09 05:53:55,836 INFO L226 Difference]: Without dead ends: 173 [2019-09-09 05:53:55,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:53:55,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-09 05:53:55,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-09-09 05:53:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-09 05:53:55,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2019-09-09 05:53:55,846 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 55 [2019-09-09 05:53:55,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:55,846 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2019-09-09 05:53:55,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:53:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2019-09-09 05:53:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-09 05:53:55,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:55,848 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] [2019-09-09 05:53:55,848 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:55,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:55,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1781246799, now seen corresponding path program 1 times [2019-09-09 05:53:55,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:55,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:55,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:55,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:55,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:55,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:55,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:55,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:55,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:55,921 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2019-09-09 05:53:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:56,179 INFO L93 Difference]: Finished difference Result 187 states and 274 transitions. [2019-09-09 05:53:56,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:56,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-09 05:53:56,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:56,181 INFO L225 Difference]: With dead ends: 187 [2019-09-09 05:53:56,182 INFO L226 Difference]: Without dead ends: 187 [2019-09-09 05:53:56,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:56,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-09 05:53:56,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2019-09-09 05:53:56,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-09 05:53:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2019-09-09 05:53:56,190 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 55 [2019-09-09 05:53:56,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:56,191 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2019-09-09 05:53:56,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2019-09-09 05:53:56,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-09 05:53:56,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:56,192 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] [2019-09-09 05:53:56,193 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:56,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:56,193 INFO L82 PathProgramCache]: Analyzing trace with hash -870189042, now seen corresponding path program 1 times [2019-09-09 05:53:56,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:56,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:56,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:56,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:56,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:56,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:56,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:56,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:56,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:56,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:56,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:56,254 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2019-09-09 05:53:56,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:56,504 INFO L93 Difference]: Finished difference Result 185 states and 271 transitions. [2019-09-09 05:53:56,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:56,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-09 05:53:56,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:56,506 INFO L225 Difference]: With dead ends: 185 [2019-09-09 05:53:56,506 INFO L226 Difference]: Without dead ends: 185 [2019-09-09 05:53:56,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-09 05:53:56,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-09 05:53:56,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-09 05:53:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2019-09-09 05:53:56,514 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 55 [2019-09-09 05:53:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:56,515 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2019-09-09 05:53:56,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2019-09-09 05:53:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-09 05:53:56,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:56,516 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] [2019-09-09 05:53:56,517 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:56,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:56,517 INFO L82 PathProgramCache]: Analyzing trace with hash 987281320, now seen corresponding path program 1 times [2019-09-09 05:53:56,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:56,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:56,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:56,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:56,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:56,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:56,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:56,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:56,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:56,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:56,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:56,593 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand 4 states. [2019-09-09 05:53:56,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:56,876 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2019-09-09 05:53:56,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:56,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-09-09 05:53:56,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:56,878 INFO L225 Difference]: With dead ends: 185 [2019-09-09 05:53:56,878 INFO L226 Difference]: Without dead ends: 185 [2019-09-09 05:53:56,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:56,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-09 05:53:56,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-09 05:53:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-09 05:53:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 254 transitions. [2019-09-09 05:53:56,884 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 254 transitions. Word has length 56 [2019-09-09 05:53:56,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:56,884 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 254 transitions. [2019-09-09 05:53:56,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:56,885 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 254 transitions. [2019-09-09 05:53:56,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-09 05:53:56,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:56,886 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] [2019-09-09 05:53:56,886 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:56,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:56,887 INFO L82 PathProgramCache]: Analyzing trace with hash -365258357, now seen corresponding path program 1 times [2019-09-09 05:53:56,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:56,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:56,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:56,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:56,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:56,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:56,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:56,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:56,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:56,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:56,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:56,939 INFO L87 Difference]: Start difference. First operand 172 states and 254 transitions. Second operand 4 states. [2019-09-09 05:53:57,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:57,176 INFO L93 Difference]: Finished difference Result 185 states and 269 transitions. [2019-09-09 05:53:57,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:57,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-09-09 05:53:57,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:57,178 INFO L225 Difference]: With dead ends: 185 [2019-09-09 05:53:57,178 INFO L226 Difference]: Without dead ends: 185 [2019-09-09 05:53:57,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:57,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-09 05:53:57,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-09 05:53:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-09 05:53:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2019-09-09 05:53:57,184 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 57 [2019-09-09 05:53:57,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:57,184 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2019-09-09 05:53:57,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:57,184 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2019-09-09 05:53:57,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-09 05:53:57,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:57,185 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] [2019-09-09 05:53:57,186 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:57,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:57,186 INFO L82 PathProgramCache]: Analyzing trace with hash -626349981, now seen corresponding path program 1 times [2019-09-09 05:53:57,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:57,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:57,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:57,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:57,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:57,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:57,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:57,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:57,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:57,256 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 4 states. [2019-09-09 05:53:57,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:57,494 INFO L93 Difference]: Finished difference Result 185 states and 268 transitions. [2019-09-09 05:53:57,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:57,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-09 05:53:57,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:57,497 INFO L225 Difference]: With dead ends: 185 [2019-09-09 05:53:57,497 INFO L226 Difference]: Without dead ends: 185 [2019-09-09 05:53:57,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:57,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-09 05:53:57,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-09 05:53:57,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-09 05:53:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 252 transitions. [2019-09-09 05:53:57,505 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 252 transitions. Word has length 58 [2019-09-09 05:53:57,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:57,506 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 252 transitions. [2019-09-09 05:53:57,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:57,506 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 252 transitions. [2019-09-09 05:53:57,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-09 05:53:57,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:57,507 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] [2019-09-09 05:53:57,507 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:57,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:57,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1341820354, now seen corresponding path program 1 times [2019-09-09 05:53:57,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:57,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:57,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:57,560 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:57,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:57,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:57,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:57,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:57,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:57,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:57,561 INFO L87 Difference]: Start difference. First operand 172 states and 252 transitions. Second operand 4 states. [2019-09-09 05:53:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:57,851 INFO L93 Difference]: Finished difference Result 214 states and 314 transitions. [2019-09-09 05:53:57,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:57,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-09 05:53:57,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:57,853 INFO L225 Difference]: With dead ends: 214 [2019-09-09 05:53:57,854 INFO L226 Difference]: Without dead ends: 214 [2019-09-09 05:53:57,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:53:57,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-09 05:53:57,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-09 05:53:57,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-09 05:53:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2019-09-09 05:53:57,861 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 58 [2019-09-09 05:53:57,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:57,861 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2019-09-09 05:53:57,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2019-09-09 05:53:57,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-09 05:53:57,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:57,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] [2019-09-09 05:53:57,863 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:57,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:57,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1412290330, now seen corresponding path program 1 times [2019-09-09 05:53:57,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:57,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:57,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:57,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:57,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:57,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:57,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:57,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:57,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:57,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:57,915 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 4 states. [2019-09-09 05:53:58,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:58,181 INFO L93 Difference]: Finished difference Result 197 states and 292 transitions. [2019-09-09 05:53:58,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:58,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-09-09 05:53:58,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:58,183 INFO L225 Difference]: With dead ends: 197 [2019-09-09 05:53:58,183 INFO L226 Difference]: Without dead ends: 197 [2019-09-09 05:53:58,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:58,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-09 05:53:58,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2019-09-09 05:53:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-09 05:53:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2019-09-09 05:53:58,189 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 59 [2019-09-09 05:53:58,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:58,189 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2019-09-09 05:53:58,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:58,190 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2019-09-09 05:53:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-09 05:53:58,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:58,191 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] [2019-09-09 05:53:58,191 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:58,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:58,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2096707986, now seen corresponding path program 1 times [2019-09-09 05:53:58,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:58,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:58,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:58,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:58,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:58,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:58,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:58,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:58,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:58,243 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand 4 states. [2019-09-09 05:53:58,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:58,507 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2019-09-09 05:53:58,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:58,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-09-09 05:53:58,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:58,509 INFO L225 Difference]: With dead ends: 214 [2019-09-09 05:53:58,509 INFO L226 Difference]: Without dead ends: 214 [2019-09-09 05:53:58,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-09 05:53:58,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-09 05:53:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-09 05:53:58,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2019-09-09 05:53:58,515 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 71 [2019-09-09 05:53:58,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:58,515 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2019-09-09 05:53:58,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2019-09-09 05:53:58,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-09 05:53:58,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:58,516 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] [2019-09-09 05:53:58,517 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:58,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:58,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1403946680, now seen corresponding path program 1 times [2019-09-09 05:53:58,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:58,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:58,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:58,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:58,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:58,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:58,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:58,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:58,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:58,577 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 4 states. [2019-09-09 05:53:58,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:58,846 INFO L93 Difference]: Finished difference Result 213 states and 310 transitions. [2019-09-09 05:53:58,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:58,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-09 05:53:58,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:58,848 INFO L225 Difference]: With dead ends: 213 [2019-09-09 05:53:58,848 INFO L226 Difference]: Without dead ends: 213 [2019-09-09 05:53:58,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:58,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-09 05:53:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2019-09-09 05:53:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-09 05:53:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2019-09-09 05:53:58,854 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 72 [2019-09-09 05:53:58,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:58,854 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2019-09-09 05:53:58,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:58,854 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2019-09-09 05:53:58,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-09 05:53:58,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:58,855 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] [2019-09-09 05:53:58,855 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:58,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:58,856 INFO L82 PathProgramCache]: Analyzing trace with hash 239584775, now seen corresponding path program 1 times [2019-09-09 05:53:58,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:58,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:58,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:58,905 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:58,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:58,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:58,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:58,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:58,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:58,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:58,907 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand 4 states. [2019-09-09 05:53:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:59,161 INFO L93 Difference]: Finished difference Result 211 states and 307 transitions. [2019-09-09 05:53:59,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:59,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-09 05:53:59,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:59,164 INFO L225 Difference]: With dead ends: 211 [2019-09-09 05:53:59,164 INFO L226 Difference]: Without dead ends: 211 [2019-09-09 05:53:59,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:59,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-09 05:53:59,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-09 05:53:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-09 05:53:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2019-09-09 05:53:59,169 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 72 [2019-09-09 05:53:59,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:59,170 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2019-09-09 05:53:59,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:59,170 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2019-09-09 05:53:59,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-09 05:53:59,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:59,171 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] [2019-09-09 05:53:59,171 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:59,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:59,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1030531279, now seen corresponding path program 1 times [2019-09-09 05:53:59,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:59,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:59,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:59,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:59,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:59,247 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:59,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:59,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:59,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:59,248 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand 4 states. [2019-09-09 05:53:59,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:59,497 INFO L93 Difference]: Finished difference Result 211 states and 306 transitions. [2019-09-09 05:53:59,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:59,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-09 05:53:59,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:59,499 INFO L225 Difference]: With dead ends: 211 [2019-09-09 05:53:59,499 INFO L226 Difference]: Without dead ends: 211 [2019-09-09 05:53:59,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:59,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-09 05:53:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-09 05:53:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-09 05:53:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2019-09-09 05:53:59,505 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 73 [2019-09-09 05:53:59,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:59,505 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2019-09-09 05:53:59,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:59,505 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2019-09-09 05:53:59,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-09 05:53:59,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:59,506 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] [2019-09-09 05:53:59,507 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:59,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:59,507 INFO L82 PathProgramCache]: Analyzing trace with hash 975490372, now seen corresponding path program 1 times [2019-09-09 05:53:59,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:59,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:59,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:59,564 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:59,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:59,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:59,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:59,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:59,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:59,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:59,567 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 4 states. [2019-09-09 05:53:59,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:59,829 INFO L93 Difference]: Finished difference Result 211 states and 305 transitions. [2019-09-09 05:53:59,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:59,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-09-09 05:53:59,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:59,831 INFO L225 Difference]: With dead ends: 211 [2019-09-09 05:53:59,831 INFO L226 Difference]: Without dead ends: 211 [2019-09-09 05:53:59,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:59,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-09 05:53:59,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-09 05:53:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-09 05:53:59,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2019-09-09 05:53:59,837 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 74 [2019-09-09 05:53:59,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:59,837 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2019-09-09 05:53:59,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:59,837 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2019-09-09 05:53:59,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-09 05:53:59,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:59,838 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] [2019-09-09 05:53:59,839 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:59,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:59,839 INFO L82 PathProgramCache]: Analyzing trace with hash -2012812342, now seen corresponding path program 1 times [2019-09-09 05:53:59,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:59,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:59,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:59,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:59,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:59,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:59,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:59,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:59,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:59,895 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 4 states. [2019-09-09 05:54:00,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:00,148 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2019-09-09 05:54:00,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:00,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-09 05:54:00,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:00,150 INFO L225 Difference]: With dead ends: 211 [2019-09-09 05:54:00,150 INFO L226 Difference]: Without dead ends: 211 [2019-09-09 05:54:00,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:00,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-09 05:54:00,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-09 05:54:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-09 05:54:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2019-09-09 05:54:00,155 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 75 [2019-09-09 05:54:00,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:00,156 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2019-09-09 05:54:00,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:00,156 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2019-09-09 05:54:00,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-09 05:54:00,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:00,157 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] [2019-09-09 05:54:00,157 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:00,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1442950561, now seen corresponding path program 1 times [2019-09-09 05:54:00,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:00,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:00,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:00,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:00,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:00,215 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:00,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:00,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:00,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:00,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:00,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:00,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:00,217 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand 4 states. [2019-09-09 05:54:00,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:00,496 INFO L93 Difference]: Finished difference Result 201 states and 291 transitions. [2019-09-09 05:54:00,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:00,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-09-09 05:54:00,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:00,500 INFO L225 Difference]: With dead ends: 201 [2019-09-09 05:54:00,500 INFO L226 Difference]: Without dead ends: 201 [2019-09-09 05:54:00,500 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:00,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-09 05:54:00,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2019-09-09 05:54:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-09 05:54:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2019-09-09 05:54:00,509 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 76 [2019-09-09 05:54:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:00,510 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2019-09-09 05:54:00,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2019-09-09 05:54:00,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:54:00,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:00,512 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] [2019-09-09 05:54:00,513 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:00,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:00,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1893403063, now seen corresponding path program 1 times [2019-09-09 05:54:00,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:00,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:00,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:00,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:00,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:00,657 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:00,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:00,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:00,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:00,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:00,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:00,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:00,660 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 4 states. [2019-09-09 05:54:01,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:01,115 INFO L93 Difference]: Finished difference Result 300 states and 442 transitions. [2019-09-09 05:54:01,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:01,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:54:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:01,118 INFO L225 Difference]: With dead ends: 300 [2019-09-09 05:54:01,118 INFO L226 Difference]: Without dead ends: 300 [2019-09-09 05:54:01,118 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:01,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-09 05:54:01,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 224. [2019-09-09 05:54:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-09 05:54:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2019-09-09 05:54:01,125 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 80 [2019-09-09 05:54:01,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:01,126 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2019-09-09 05:54:01,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:01,126 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2019-09-09 05:54:01,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:54:01,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:01,127 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] [2019-09-09 05:54:01,127 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:01,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:01,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1821016505, now seen corresponding path program 1 times [2019-09-09 05:54:01,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:01,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:01,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:01,191 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:01,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:01,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:01,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:01,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:01,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:01,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:01,193 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand 4 states. [2019-09-09 05:54:01,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:01,537 INFO L93 Difference]: Finished difference Result 273 states and 405 transitions. [2019-09-09 05:54:01,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:01,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:54:01,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:01,539 INFO L225 Difference]: With dead ends: 273 [2019-09-09 05:54:01,539 INFO L226 Difference]: Without dead ends: 273 [2019-09-09 05:54:01,540 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:01,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-09-09 05:54:01,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 248. [2019-09-09 05:54:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-09 05:54:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2019-09-09 05:54:01,546 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 80 [2019-09-09 05:54:01,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:01,546 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2019-09-09 05:54:01,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:01,547 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2019-09-09 05:54:01,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 05:54:01,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:01,548 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] [2019-09-09 05:54:01,548 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:01,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:01,549 INFO L82 PathProgramCache]: Analyzing trace with hash -852863592, now seen corresponding path program 1 times [2019-09-09 05:54:01,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:01,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:01,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:01,638 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:01,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:01,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:01,639 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:01,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:01,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:01,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:01,641 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand 4 states. [2019-09-09 05:54:02,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:02,052 INFO L93 Difference]: Finished difference Result 316 states and 469 transitions. [2019-09-09 05:54:02,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:02,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-09 05:54:02,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:02,055 INFO L225 Difference]: With dead ends: 316 [2019-09-09 05:54:02,055 INFO L226 Difference]: Without dead ends: 316 [2019-09-09 05:54:02,056 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:02,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-09 05:54:02,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 249. [2019-09-09 05:54:02,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-09 05:54:02,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 374 transitions. [2019-09-09 05:54:02,062 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 374 transitions. Word has length 81 [2019-09-09 05:54:02,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:02,063 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 374 transitions. [2019-09-09 05:54:02,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:02,063 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 374 transitions. [2019-09-09 05:54:02,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-09 05:54:02,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:02,064 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:02,065 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:02,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:02,065 INFO L82 PathProgramCache]: Analyzing trace with hash 69064469, now seen corresponding path program 1 times [2019-09-09 05:54:02,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:02,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:02,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:02,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:02,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:02,128 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:02,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:02,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:02,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:02,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:02,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:02,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:02,154 INFO L87 Difference]: Start difference. First operand 249 states and 374 transitions. Second operand 4 states. [2019-09-09 05:54:02,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:02,526 INFO L93 Difference]: Finished difference Result 316 states and 468 transitions. [2019-09-09 05:54:02,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:02,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-09 05:54:02,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:02,532 INFO L225 Difference]: With dead ends: 316 [2019-09-09 05:54:02,532 INFO L226 Difference]: Without dead ends: 316 [2019-09-09 05:54:02,533 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:02,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-09 05:54:02,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 259. [2019-09-09 05:54:02,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-09 05:54:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2019-09-09 05:54:02,540 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 86 [2019-09-09 05:54:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:02,540 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2019-09-09 05:54:02,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2019-09-09 05:54:02,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-09 05:54:02,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:02,542 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:02,542 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:02,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:02,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2133991217, now seen corresponding path program 1 times [2019-09-09 05:54:02,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:02,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:02,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:02,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:02,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:02,633 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:02,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:02,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:02,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:02,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:02,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:02,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:02,635 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2019-09-09 05:54:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:03,101 INFO L93 Difference]: Finished difference Result 310 states and 460 transitions. [2019-09-09 05:54:03,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:03,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-09 05:54:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:03,104 INFO L225 Difference]: With dead ends: 310 [2019-09-09 05:54:03,104 INFO L226 Difference]: Without dead ends: 310 [2019-09-09 05:54:03,105 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:03,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-09 05:54:03,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2019-09-09 05:54:03,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2019-09-09 05:54:03,112 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 87 [2019-09-09 05:54:03,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:03,112 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2019-09-09 05:54:03,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:03,112 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2019-09-09 05:54:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-09 05:54:03,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:03,114 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] [2019-09-09 05:54:03,114 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:03,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:03,115 INFO L82 PathProgramCache]: Analyzing trace with hash -2126867523, now seen corresponding path program 1 times [2019-09-09 05:54:03,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:03,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:03,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:03,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:03,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:03,225 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:03,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:03,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:03,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:03,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:03,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:03,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:03,232 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2019-09-09 05:54:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:03,602 INFO L93 Difference]: Finished difference Result 310 states and 459 transitions. [2019-09-09 05:54:03,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:03,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-09 05:54:03,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:03,605 INFO L225 Difference]: With dead ends: 310 [2019-09-09 05:54:03,605 INFO L226 Difference]: Without dead ends: 310 [2019-09-09 05:54:03,606 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:03,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-09 05:54:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2019-09-09 05:54:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2019-09-09 05:54:03,613 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 93 [2019-09-09 05:54:03,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:03,614 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2019-09-09 05:54:03,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:03,614 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2019-09-09 05:54:03,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-09 05:54:03,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:03,615 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] [2019-09-09 05:54:03,615 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:03,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:03,617 INFO L82 PathProgramCache]: Analyzing trace with hash -198594821, now seen corresponding path program 1 times [2019-09-09 05:54:03,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:03,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:03,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:03,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:03,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:03,675 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:03,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:03,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:03,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:03,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:03,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:03,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:03,677 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2019-09-09 05:54:03,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:03,965 INFO L93 Difference]: Finished difference Result 285 states and 424 transitions. [2019-09-09 05:54:03,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:03,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-09 05:54:03,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:03,968 INFO L225 Difference]: With dead ends: 285 [2019-09-09 05:54:03,969 INFO L226 Difference]: Without dead ends: 285 [2019-09-09 05:54:03,969 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:03,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-09 05:54:03,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2019-09-09 05:54:03,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:03,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2019-09-09 05:54:03,977 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 93 [2019-09-09 05:54:03,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:03,977 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2019-09-09 05:54:03,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2019-09-09 05:54:03,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-09 05:54:03,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:03,979 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] [2019-09-09 05:54:03,979 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:03,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:03,980 INFO L82 PathProgramCache]: Analyzing trace with hash 809198717, now seen corresponding path program 1 times [2019-09-09 05:54:03,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:03,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:03,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:03,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:03,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:04,076 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:04,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:04,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:04,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:04,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:04,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:04,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:04,078 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2019-09-09 05:54:04,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:04,430 INFO L93 Difference]: Finished difference Result 309 states and 456 transitions. [2019-09-09 05:54:04,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:04,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-09 05:54:04,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:04,432 INFO L225 Difference]: With dead ends: 309 [2019-09-09 05:54:04,432 INFO L226 Difference]: Without dead ends: 309 [2019-09-09 05:54:04,432 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:04,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-09 05:54:04,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 260. [2019-09-09 05:54:04,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:04,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2019-09-09 05:54:04,437 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 94 [2019-09-09 05:54:04,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:04,437 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2019-09-09 05:54:04,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:04,437 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2019-09-09 05:54:04,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-09 05:54:04,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:04,438 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] [2019-09-09 05:54:04,439 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:04,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:04,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1842237124, now seen corresponding path program 1 times [2019-09-09 05:54:04,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:04,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:04,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:04,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:04,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:04,492 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:04,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:04,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:04,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:04,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:04,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:04,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:04,494 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2019-09-09 05:54:04,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:04,857 INFO L93 Difference]: Finished difference Result 307 states and 453 transitions. [2019-09-09 05:54:04,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:04,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-09 05:54:04,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:04,860 INFO L225 Difference]: With dead ends: 307 [2019-09-09 05:54:04,860 INFO L226 Difference]: Without dead ends: 307 [2019-09-09 05:54:04,861 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:04,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-09 05:54:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-09 05:54:04,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:04,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2019-09-09 05:54:04,867 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 94 [2019-09-09 05:54:04,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:04,868 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2019-09-09 05:54:04,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:04,868 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2019-09-09 05:54:04,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-09 05:54:04,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:04,869 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] [2019-09-09 05:54:04,869 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:04,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:04,870 INFO L82 PathProgramCache]: Analyzing trace with hash 456110335, now seen corresponding path program 1 times [2019-09-09 05:54:04,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:04,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:04,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:04,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:04,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:04,930 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:04,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:04,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:04,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:04,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:04,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:04,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:04,931 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2019-09-09 05:54:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:05,203 INFO L93 Difference]: Finished difference Result 284 states and 420 transitions. [2019-09-09 05:54:05,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:05,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-09 05:54:05,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:05,206 INFO L225 Difference]: With dead ends: 284 [2019-09-09 05:54:05,206 INFO L226 Difference]: Without dead ends: 284 [2019-09-09 05:54:05,206 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:05,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-09 05:54:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2019-09-09 05:54:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2019-09-09 05:54:05,212 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 94 [2019-09-09 05:54:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:05,212 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2019-09-09 05:54:05,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:05,212 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2019-09-09 05:54:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-09 05:54:05,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:05,213 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] [2019-09-09 05:54:05,214 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:05,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash 2099641790, now seen corresponding path program 1 times [2019-09-09 05:54:05,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:05,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:05,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:05,273 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:05,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:05,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:05,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:05,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:05,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:05,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:05,274 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2019-09-09 05:54:05,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:05,549 INFO L93 Difference]: Finished difference Result 282 states and 417 transitions. [2019-09-09 05:54:05,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:05,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-09 05:54:05,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:05,552 INFO L225 Difference]: With dead ends: 282 [2019-09-09 05:54:05,552 INFO L226 Difference]: Without dead ends: 282 [2019-09-09 05:54:05,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:05,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-09 05:54:05,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-09 05:54:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:05,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2019-09-09 05:54:05,579 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 94 [2019-09-09 05:54:05,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:05,580 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2019-09-09 05:54:05,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:05,580 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2019-09-09 05:54:05,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-09 05:54:05,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:05,581 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] [2019-09-09 05:54:05,581 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:05,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:05,582 INFO L82 PathProgramCache]: Analyzing trace with hash 918561850, now seen corresponding path program 1 times [2019-09-09 05:54:05,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:05,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:05,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:05,633 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:05,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:05,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:05,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:05,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:05,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:05,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:05,635 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2019-09-09 05:54:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:05,961 INFO L93 Difference]: Finished difference Result 307 states and 450 transitions. [2019-09-09 05:54:05,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:05,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-09 05:54:05,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:05,964 INFO L225 Difference]: With dead ends: 307 [2019-09-09 05:54:05,964 INFO L226 Difference]: Without dead ends: 307 [2019-09-09 05:54:05,965 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:05,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-09 05:54:05,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-09 05:54:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:05,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2019-09-09 05:54:05,971 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 95 [2019-09-09 05:54:05,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:05,971 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2019-09-09 05:54:05,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:05,971 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2019-09-09 05:54:05,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-09 05:54:05,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:05,972 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] [2019-09-09 05:54:05,973 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:05,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:05,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1437243400, now seen corresponding path program 1 times [2019-09-09 05:54:05,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:05,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:05,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:06,026 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:06,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:06,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:06,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:06,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:06,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:06,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:06,028 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 4 states. [2019-09-09 05:54:06,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:06,290 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2019-09-09 05:54:06,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:06,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-09 05:54:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:06,293 INFO L225 Difference]: With dead ends: 282 [2019-09-09 05:54:06,293 INFO L226 Difference]: Without dead ends: 282 [2019-09-09 05:54:06,294 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:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-09 05:54:06,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-09 05:54:06,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:06,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 386 transitions. [2019-09-09 05:54:06,299 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 386 transitions. Word has length 95 [2019-09-09 05:54:06,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:06,300 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 386 transitions. [2019-09-09 05:54:06,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:06,300 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 386 transitions. [2019-09-09 05:54:06,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-09 05:54:06,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:06,301 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] [2019-09-09 05:54:06,301 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:06,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:06,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1799405369, now seen corresponding path program 1 times [2019-09-09 05:54:06,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:06,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:06,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:06,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:06,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:06,372 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:06,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:06,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:06,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:06,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:06,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:06,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:06,374 INFO L87 Difference]: Start difference. First operand 260 states and 386 transitions. Second operand 4 states. [2019-09-09 05:54:06,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:06,713 INFO L93 Difference]: Finished difference Result 307 states and 448 transitions. [2019-09-09 05:54:06,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:06,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-09 05:54:06,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:06,715 INFO L225 Difference]: With dead ends: 307 [2019-09-09 05:54:06,715 INFO L226 Difference]: Without dead ends: 307 [2019-09-09 05:54:06,716 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:06,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-09 05:54:06,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-09 05:54:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 385 transitions. [2019-09-09 05:54:06,722 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 385 transitions. Word has length 96 [2019-09-09 05:54:06,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:06,722 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 385 transitions. [2019-09-09 05:54:06,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:06,723 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 385 transitions. [2019-09-09 05:54:06,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-09 05:54:06,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:06,724 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] [2019-09-09 05:54:06,724 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:06,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:06,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1783886651, now seen corresponding path program 1 times [2019-09-09 05:54:06,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:06,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:06,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:06,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:06,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:06,787 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:06,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:06,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:06,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:06,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:06,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:06,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:06,791 INFO L87 Difference]: Start difference. First operand 260 states and 385 transitions. Second operand 4 states. [2019-09-09 05:54:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:07,061 INFO L93 Difference]: Finished difference Result 282 states and 413 transitions. [2019-09-09 05:54:07,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:07,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-09 05:54:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:07,064 INFO L225 Difference]: With dead ends: 282 [2019-09-09 05:54:07,064 INFO L226 Difference]: Without dead ends: 282 [2019-09-09 05:54:07,065 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:07,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-09 05:54:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-09 05:54:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:07,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2019-09-09 05:54:07,070 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 96 [2019-09-09 05:54:07,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:07,070 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2019-09-09 05:54:07,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:07,071 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2019-09-09 05:54:07,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-09 05:54:07,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:07,072 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] [2019-09-09 05:54:07,072 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:07,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:07,072 INFO L82 PathProgramCache]: Analyzing trace with hash 2053716085, now seen corresponding path program 1 times [2019-09-09 05:54:07,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:07,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:07,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:07,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:07,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:07,138 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:07,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:07,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:07,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:07,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:07,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:07,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:07,140 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand 4 states. [2019-09-09 05:54:07,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:07,513 INFO L93 Difference]: Finished difference Result 307 states and 446 transitions. [2019-09-09 05:54:07,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:07,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-09 05:54:07,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:07,516 INFO L225 Difference]: With dead ends: 307 [2019-09-09 05:54:07,516 INFO L226 Difference]: Without dead ends: 307 [2019-09-09 05:54:07,516 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:07,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-09 05:54:07,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-09 05:54:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2019-09-09 05:54:07,523 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 97 [2019-09-09 05:54:07,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:07,524 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2019-09-09 05:54:07,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:07,524 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2019-09-09 05:54:07,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-09 05:54:07,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:07,525 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] [2019-09-09 05:54:07,525 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:07,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:07,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1572635827, now seen corresponding path program 1 times [2019-09-09 05:54:07,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:07,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:07,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:07,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:07,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:07,590 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:07,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:07,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:07,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:07,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:07,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:07,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:07,592 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand 4 states. [2019-09-09 05:54:07,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:07,852 INFO L93 Difference]: Finished difference Result 282 states and 411 transitions. [2019-09-09 05:54:07,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:07,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-09 05:54:07,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:07,858 INFO L225 Difference]: With dead ends: 282 [2019-09-09 05:54:07,858 INFO L226 Difference]: Without dead ends: 282 [2019-09-09 05:54:07,858 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:07,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-09 05:54:07,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-09 05:54:07,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:07,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2019-09-09 05:54:07,864 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 97 [2019-09-09 05:54:07,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:07,865 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2019-09-09 05:54:07,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2019-09-09 05:54:07,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-09 05:54:07,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:07,866 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] [2019-09-09 05:54:07,866 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:07,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:07,866 INFO L82 PathProgramCache]: Analyzing trace with hash 65379092, now seen corresponding path program 1 times [2019-09-09 05:54:07,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:07,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:07,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:07,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:07,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:07,919 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:07,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:07,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:07,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:07,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:07,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:07,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:07,921 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand 4 states. [2019-09-09 05:54:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:08,248 INFO L93 Difference]: Finished difference Result 297 states and 432 transitions. [2019-09-09 05:54:08,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:08,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-09 05:54:08,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:08,250 INFO L225 Difference]: With dead ends: 297 [2019-09-09 05:54:08,250 INFO L226 Difference]: Without dead ends: 297 [2019-09-09 05:54:08,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:08,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-09 05:54:08,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 260. [2019-09-09 05:54:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 381 transitions. [2019-09-09 05:54:08,256 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 381 transitions. Word has length 98 [2019-09-09 05:54:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:08,257 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 381 transitions. [2019-09-09 05:54:08,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 381 transitions. [2019-09-09 05:54:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-09 05:54:08,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:08,258 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] [2019-09-09 05:54:08,258 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:08,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:08,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1963207018, now seen corresponding path program 1 times [2019-09-09 05:54:08,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:08,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:08,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:08,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:08,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:08,326 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:08,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:08,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:08,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:08,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:08,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:08,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:08,328 INFO L87 Difference]: Start difference. First operand 260 states and 381 transitions. Second operand 4 states. [2019-09-09 05:54:08,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:08,555 INFO L93 Difference]: Finished difference Result 272 states and 397 transitions. [2019-09-09 05:54:08,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:08,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-09 05:54:08,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:08,556 INFO L225 Difference]: With dead ends: 272 [2019-09-09 05:54:08,556 INFO L226 Difference]: Without dead ends: 272 [2019-09-09 05:54:08,557 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:08,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-09 05:54:08,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2019-09-09 05:54:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 380 transitions. [2019-09-09 05:54:08,562 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 380 transitions. Word has length 98 [2019-09-09 05:54:08,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:08,563 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 380 transitions. [2019-09-09 05:54:08,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:08,563 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2019-09-09 05:54:08,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:54:08,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:08,564 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] [2019-09-09 05:54:08,564 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:08,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:08,565 INFO L82 PathProgramCache]: Analyzing trace with hash 445820602, now seen corresponding path program 1 times [2019-09-09 05:54:08,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:08,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:08,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:08,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:08,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:08,643 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:08,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:08,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:08,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:08,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:08,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:08,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:08,644 INFO L87 Difference]: Start difference. First operand 260 states and 380 transitions. Second operand 4 states. [2019-09-09 05:54:08,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:08,966 INFO L93 Difference]: Finished difference Result 297 states and 430 transitions. [2019-09-09 05:54:08,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:08,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:54:08,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:08,969 INFO L225 Difference]: With dead ends: 297 [2019-09-09 05:54:08,969 INFO L226 Difference]: Without dead ends: 297 [2019-09-09 05:54:08,969 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:08,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-09 05:54:08,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 260. [2019-09-09 05:54:08,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 379 transitions. [2019-09-09 05:54:08,974 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 379 transitions. Word has length 102 [2019-09-09 05:54:08,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:08,974 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 379 transitions. [2019-09-09 05:54:08,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:08,974 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 379 transitions. [2019-09-09 05:54:08,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:54:08,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:08,976 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] [2019-09-09 05:54:08,976 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:08,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:08,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1832606012, now seen corresponding path program 1 times [2019-09-09 05:54:08,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:08,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:08,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:08,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:08,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-09 05:54:09,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:09,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:09,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:09,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:09,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:09,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:09,059 INFO L87 Difference]: Start difference. First operand 260 states and 379 transitions. Second operand 3 states. [2019-09-09 05:54:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:09,096 INFO L93 Difference]: Finished difference Result 493 states and 723 transitions. [2019-09-09 05:54:09,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:09,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-09 05:54:09,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:09,099 INFO L225 Difference]: With dead ends: 493 [2019-09-09 05:54:09,099 INFO L226 Difference]: Without dead ends: 493 [2019-09-09 05:54:09,099 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:09,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-09 05:54:09,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-09-09 05:54:09,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-09-09 05:54:09,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 723 transitions. [2019-09-09 05:54:09,107 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 723 transitions. Word has length 102 [2019-09-09 05:54:09,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:09,108 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 723 transitions. [2019-09-09 05:54:09,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:09,108 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 723 transitions. [2019-09-09 05:54:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:54:09,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:09,109 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] [2019-09-09 05:54:09,110 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:09,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:09,110 INFO L82 PathProgramCache]: Analyzing trace with hash 881301798, now seen corresponding path program 1 times [2019-09-09 05:54:09,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:09,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:09,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:09,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:09,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:09,161 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:09,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:09,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:09,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:09,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:09,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:09,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:09,163 INFO L87 Difference]: Start difference. First operand 493 states and 723 transitions. Second operand 3 states. [2019-09-09 05:54:09,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:09,209 INFO L93 Difference]: Finished difference Result 728 states and 1072 transitions. [2019-09-09 05:54:09,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:09,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-09 05:54:09,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:09,212 INFO L225 Difference]: With dead ends: 728 [2019-09-09 05:54:09,212 INFO L226 Difference]: Without dead ends: 728 [2019-09-09 05:54:09,213 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:09,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-09-09 05:54:09,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2019-09-09 05:54:09,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-09-09 05:54:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1071 transitions. [2019-09-09 05:54:09,223 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1071 transitions. Word has length 104 [2019-09-09 05:54:09,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:09,223 INFO L475 AbstractCegarLoop]: Abstraction has 726 states and 1071 transitions. [2019-09-09 05:54:09,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:09,224 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1071 transitions. [2019-09-09 05:54:09,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-09 05:54:09,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:09,225 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:09,226 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:09,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:09,226 INFO L82 PathProgramCache]: Analyzing trace with hash -508111036, now seen corresponding path program 1 times [2019-09-09 05:54:09,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:09,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:09,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:09,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:09,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:09,276 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:09,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:09,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:09,276 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:09,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:09,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:09,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:09,277 INFO L87 Difference]: Start difference. First operand 726 states and 1071 transitions. Second operand 3 states. [2019-09-09 05:54:09,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:09,322 INFO L93 Difference]: Finished difference Result 961 states and 1406 transitions. [2019-09-09 05:54:09,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:09,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-09 05:54:09,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:09,327 INFO L225 Difference]: With dead ends: 961 [2019-09-09 05:54:09,327 INFO L226 Difference]: Without dead ends: 961 [2019-09-09 05:54:09,327 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:09,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-09-09 05:54:09,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2019-09-09 05:54:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-09-09 05:54:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1405 transitions. [2019-09-09 05:54:09,341 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1405 transitions. Word has length 110 [2019-09-09 05:54:09,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:09,341 INFO L475 AbstractCegarLoop]: Abstraction has 959 states and 1405 transitions. [2019-09-09 05:54:09,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1405 transitions. [2019-09-09 05:54:09,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-09 05:54:09,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:09,344 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:09,344 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:09,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:09,344 INFO L82 PathProgramCache]: Analyzing trace with hash 340355395, now seen corresponding path program 1 times [2019-09-09 05:54:09,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:09,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:09,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:09,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:09,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:09,411 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:09,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:09,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:09,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:09,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:09,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:09,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:09,412 INFO L87 Difference]: Start difference. First operand 959 states and 1405 transitions. Second operand 4 states. [2019-09-09 05:54:09,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:09,836 INFO L93 Difference]: Finished difference Result 1369 states and 2020 transitions. [2019-09-09 05:54:09,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:09,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-09 05:54:09,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:09,842 INFO L225 Difference]: With dead ends: 1369 [2019-09-09 05:54:09,843 INFO L226 Difference]: Without dead ends: 1369 [2019-09-09 05:54:09,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:09,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2019-09-09 05:54:09,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1115. [2019-09-09 05:54:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-09-09 05:54:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1689 transitions. [2019-09-09 05:54:09,863 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1689 transitions. Word has length 127 [2019-09-09 05:54:09,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:09,864 INFO L475 AbstractCegarLoop]: Abstraction has 1115 states and 1689 transitions. [2019-09-09 05:54:09,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1689 transitions. [2019-09-09 05:54:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-09 05:54:09,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:09,866 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:09,866 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:09,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:09,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1954075331, now seen corresponding path program 1 times [2019-09-09 05:54:09,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:09,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:09,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:09,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:09,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:09,939 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:09,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:09,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:09,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:09,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:09,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:09,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:09,941 INFO L87 Difference]: Start difference. First operand 1115 states and 1689 transitions. Second operand 4 states. [2019-09-09 05:54:10,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:10,341 INFO L93 Difference]: Finished difference Result 1351 states and 1994 transitions. [2019-09-09 05:54:10,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:10,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-09 05:54:10,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:10,347 INFO L225 Difference]: With dead ends: 1351 [2019-09-09 05:54:10,347 INFO L226 Difference]: Without dead ends: 1351 [2019-09-09 05:54:10,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:10,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-09-09 05:54:10,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1075. [2019-09-09 05:54:10,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-09-09 05:54:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1613 transitions. [2019-09-09 05:54:10,368 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1613 transitions. Word has length 128 [2019-09-09 05:54:10,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:10,369 INFO L475 AbstractCegarLoop]: Abstraction has 1075 states and 1613 transitions. [2019-09-09 05:54:10,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1613 transitions. [2019-09-09 05:54:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-09 05:54:10,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:10,372 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] [2019-09-09 05:54:10,372 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:10,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:10,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1490307687, now seen corresponding path program 1 times [2019-09-09 05:54:10,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:10,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:10,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:10,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:10,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:10,519 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:10,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:10,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:10,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:10,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:10,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:10,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:10,520 INFO L87 Difference]: Start difference. First operand 1075 states and 1613 transitions. Second operand 3 states. [2019-09-09 05:54:10,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:10,582 INFO L93 Difference]: Finished difference Result 1339 states and 2008 transitions. [2019-09-09 05:54:10,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:10,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-09-09 05:54:10,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:10,590 INFO L225 Difference]: With dead ends: 1339 [2019-09-09 05:54:10,590 INFO L226 Difference]: Without dead ends: 1339 [2019-09-09 05:54:10,591 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:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-09-09 05:54:10,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2019-09-09 05:54:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2007 transitions. [2019-09-09 05:54:10,619 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2007 transitions. Word has length 133 [2019-09-09 05:54:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:10,620 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 2007 transitions. [2019-09-09 05:54:10,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2007 transitions. [2019-09-09 05:54:10,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-09 05:54:10,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:10,624 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:10,624 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:10,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:10,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1260334381, now seen corresponding path program 1 times [2019-09-09 05:54:10,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:10,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:10,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:10,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:10,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:10,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:10,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:10,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:10,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:10,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:10,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:10,706 INFO L87 Difference]: Start difference. First operand 1337 states and 2007 transitions. Second operand 4 states. [2019-09-09 05:54:11,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:11,128 INFO L93 Difference]: Finished difference Result 1682 states and 2477 transitions. [2019-09-09 05:54:11,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:11,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-09 05:54:11,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:11,135 INFO L225 Difference]: With dead ends: 1682 [2019-09-09 05:54:11,135 INFO L226 Difference]: Without dead ends: 1682 [2019-09-09 05:54:11,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:11,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2019-09-09 05:54:11,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1337. [2019-09-09 05:54:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:11,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2002 transitions. [2019-09-09 05:54:11,155 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2002 transitions. Word has length 140 [2019-09-09 05:54:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:11,156 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 2002 transitions. [2019-09-09 05:54:11,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2002 transitions. [2019-09-09 05:54:11,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-09 05:54:11,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:11,158 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:11,159 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:11,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:11,159 INFO L82 PathProgramCache]: Analyzing trace with hash -950685943, now seen corresponding path program 1 times [2019-09-09 05:54:11,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:11,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:11,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:11,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:11,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:11,221 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:11,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:11,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:11,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:11,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:11,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:11,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:11,222 INFO L87 Difference]: Start difference. First operand 1337 states and 2002 transitions. Second operand 4 states. [2019-09-09 05:54:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:11,626 INFO L93 Difference]: Finished difference Result 1677 states and 2467 transitions. [2019-09-09 05:54:11,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:11,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-09 05:54:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:11,631 INFO L225 Difference]: With dead ends: 1677 [2019-09-09 05:54:11,631 INFO L226 Difference]: Without dead ends: 1677 [2019-09-09 05:54:11,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2019-09-09 05:54:11,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1337. [2019-09-09 05:54:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1997 transitions. [2019-09-09 05:54:11,650 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1997 transitions. Word has length 141 [2019-09-09 05:54:11,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:11,650 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1997 transitions. [2019-09-09 05:54:11,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1997 transitions. [2019-09-09 05:54:11,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-09 05:54:11,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:11,653 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:11,654 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:11,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:11,654 INFO L82 PathProgramCache]: Analyzing trace with hash 707342472, now seen corresponding path program 1 times [2019-09-09 05:54:11,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:11,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:11,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:11,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:11,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:11,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:11,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:11,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:11,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:11,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:11,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:11,716 INFO L87 Difference]: Start difference. First operand 1337 states and 1997 transitions. Second operand 4 states. [2019-09-09 05:54:12,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:12,129 INFO L93 Difference]: Finished difference Result 1667 states and 2452 transitions. [2019-09-09 05:54:12,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:12,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-09 05:54:12,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:12,136 INFO L225 Difference]: With dead ends: 1667 [2019-09-09 05:54:12,136 INFO L226 Difference]: Without dead ends: 1667 [2019-09-09 05:54:12,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:12,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-09 05:54:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-09 05:54:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1992 transitions. [2019-09-09 05:54:12,153 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1992 transitions. Word has length 141 [2019-09-09 05:54:12,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:12,153 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1992 transitions. [2019-09-09 05:54:12,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1992 transitions. [2019-09-09 05:54:12,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-09 05:54:12,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:12,156 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:12,157 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:12,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:12,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1800130410, now seen corresponding path program 1 times [2019-09-09 05:54:12,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:12,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:12,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:12,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:12,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:12,258 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:12,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:12,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:12,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:12,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:12,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:12,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:12,260 INFO L87 Difference]: Start difference. First operand 1337 states and 1992 transitions. Second operand 4 states. [2019-09-09 05:54:12,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:12,654 INFO L93 Difference]: Finished difference Result 1667 states and 2447 transitions. [2019-09-09 05:54:12,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:12,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-09 05:54:12,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:12,663 INFO L225 Difference]: With dead ends: 1667 [2019-09-09 05:54:12,663 INFO L226 Difference]: Without dead ends: 1667 [2019-09-09 05:54:12,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:12,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-09 05:54:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-09 05:54:12,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1987 transitions. [2019-09-09 05:54:12,681 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1987 transitions. Word has length 142 [2019-09-09 05:54:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:12,682 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1987 transitions. [2019-09-09 05:54:12,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1987 transitions. [2019-09-09 05:54:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-09 05:54:12,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:12,684 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:12,685 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:12,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:12,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1021270341, now seen corresponding path program 1 times [2019-09-09 05:54:12,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:12,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:12,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:12,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:12,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:12,747 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:12,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:12,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:12,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:12,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:12,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:12,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:12,749 INFO L87 Difference]: Start difference. First operand 1337 states and 1987 transitions. Second operand 4 states. [2019-09-09 05:54:13,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:13,137 INFO L93 Difference]: Finished difference Result 1667 states and 2442 transitions. [2019-09-09 05:54:13,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:13,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-09 05:54:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:13,143 INFO L225 Difference]: With dead ends: 1667 [2019-09-09 05:54:13,143 INFO L226 Difference]: Without dead ends: 1667 [2019-09-09 05:54:13,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:13,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-09 05:54:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-09 05:54:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1982 transitions. [2019-09-09 05:54:13,161 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1982 transitions. Word has length 143 [2019-09-09 05:54:13,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:13,161 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1982 transitions. [2019-09-09 05:54:13,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1982 transitions. [2019-09-09 05:54:13,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-09 05:54:13,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:13,164 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:13,164 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:13,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:13,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1024642789, now seen corresponding path program 1 times [2019-09-09 05:54:13,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:13,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:13,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:13,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:13,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:13,231 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:13,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:13,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:13,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:13,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:13,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:13,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:13,233 INFO L87 Difference]: Start difference. First operand 1337 states and 1982 transitions. Second operand 4 states. [2019-09-09 05:54:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:13,621 INFO L93 Difference]: Finished difference Result 1667 states and 2437 transitions. [2019-09-09 05:54:13,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:13,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-09-09 05:54:13,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:13,630 INFO L225 Difference]: With dead ends: 1667 [2019-09-09 05:54:13,630 INFO L226 Difference]: Without dead ends: 1667 [2019-09-09 05:54:13,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:13,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-09 05:54:13,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-09 05:54:13,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:13,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1977 transitions. [2019-09-09 05:54:13,645 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1977 transitions. Word has length 144 [2019-09-09 05:54:13,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:13,646 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1977 transitions. [2019-09-09 05:54:13,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:13,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1977 transitions. [2019-09-09 05:54:13,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-09 05:54:13,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:13,648 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:13,648 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:13,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:13,649 INFO L82 PathProgramCache]: Analyzing trace with hash -492580512, now seen corresponding path program 1 times [2019-09-09 05:54:13,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:13,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:13,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:13,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:13,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:13,717 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:13,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:13,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:13,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:13,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:13,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:13,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:13,720 INFO L87 Difference]: Start difference. First operand 1337 states and 1977 transitions. Second operand 4 states. [2019-09-09 05:54:14,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:14,112 INFO L93 Difference]: Finished difference Result 1617 states and 2372 transitions. [2019-09-09 05:54:14,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:14,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-09 05:54:14,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:14,127 INFO L225 Difference]: With dead ends: 1617 [2019-09-09 05:54:14,127 INFO L226 Difference]: Without dead ends: 1617 [2019-09-09 05:54:14,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:14,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-09-09 05:54:14,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1337. [2019-09-09 05:54:14,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1972 transitions. [2019-09-09 05:54:14,180 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1972 transitions. Word has length 145 [2019-09-09 05:54:14,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:14,181 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1972 transitions. [2019-09-09 05:54:14,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1972 transitions. [2019-09-09 05:54:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-09 05:54:14,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:14,184 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:14,184 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:14,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:14,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1212937850, now seen corresponding path program 1 times [2019-09-09 05:54:14,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:14,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:14,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:14,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:14,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:14,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:14,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:14,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:14,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:14,255 INFO L87 Difference]: Start difference. First operand 1337 states and 1972 transitions. Second operand 4 states. [2019-09-09 05:54:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:14,617 INFO L93 Difference]: Finished difference Result 1617 states and 2367 transitions. [2019-09-09 05:54:14,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:14,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-09-09 05:54:14,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:14,625 INFO L225 Difference]: With dead ends: 1617 [2019-09-09 05:54:14,625 INFO L226 Difference]: Without dead ends: 1617 [2019-09-09 05:54:14,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-09-09 05:54:14,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1337. [2019-09-09 05:54:14,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:14,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1967 transitions. [2019-09-09 05:54:14,639 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1967 transitions. Word has length 149 [2019-09-09 05:54:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:14,639 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1967 transitions. [2019-09-09 05:54:14,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1967 transitions. [2019-09-09 05:54:14,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-09 05:54:14,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:14,641 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:14,641 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:14,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:14,642 INFO L82 PathProgramCache]: Analyzing trace with hash 338308875, now seen corresponding path program 1 times [2019-09-09 05:54:14,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:14,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:14,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:14,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:14,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:14,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:14,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:14,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:14,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:14,735 INFO L87 Difference]: Start difference. First operand 1337 states and 1967 transitions. Second operand 4 states. [2019-09-09 05:54:15,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:15,101 INFO L93 Difference]: Finished difference Result 1592 states and 2330 transitions. [2019-09-09 05:54:15,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:15,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-09 05:54:15,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:15,110 INFO L225 Difference]: With dead ends: 1592 [2019-09-09 05:54:15,111 INFO L226 Difference]: Without dead ends: 1592 [2019-09-09 05:54:15,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2019-09-09 05:54:15,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1337. [2019-09-09 05:54:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1962 transitions. [2019-09-09 05:54:15,133 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1962 transitions. Word has length 150 [2019-09-09 05:54:15,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:15,134 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1962 transitions. [2019-09-09 05:54:15,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1962 transitions. [2019-09-09 05:54:15,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-09 05:54:15,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:15,137 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:15,137 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:15,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:15,138 INFO L82 PathProgramCache]: Analyzing trace with hash 582401643, now seen corresponding path program 1 times [2019-09-09 05:54:15,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:15,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:15,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:15,212 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:15,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:15,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:15,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:15,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:15,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:15,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:15,214 INFO L87 Difference]: Start difference. First operand 1337 states and 1962 transitions. Second operand 4 states. [2019-09-09 05:54:15,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:15,591 INFO L93 Difference]: Finished difference Result 1592 states and 2325 transitions. [2019-09-09 05:54:15,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:15,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-09 05:54:15,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:15,594 INFO L225 Difference]: With dead ends: 1592 [2019-09-09 05:54:15,594 INFO L226 Difference]: Without dead ends: 1592 [2019-09-09 05:54:15,594 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:15,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2019-09-09 05:54:15,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1337. [2019-09-09 05:54:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:15,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1957 transitions. [2019-09-09 05:54:15,608 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1957 transitions. Word has length 152 [2019-09-09 05:54:15,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:15,608 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1957 transitions. [2019-09-09 05:54:15,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:15,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1957 transitions. [2019-09-09 05:54:15,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-09 05:54:15,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:15,610 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:15,611 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:15,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:15,611 INFO L82 PathProgramCache]: Analyzing trace with hash 226930054, now seen corresponding path program 1 times [2019-09-09 05:54:15,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:15,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:15,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:15,690 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:15,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:15,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:15,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:15,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:15,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:15,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:15,692 INFO L87 Difference]: Start difference. First operand 1337 states and 1957 transitions. Second operand 4 states. [2019-09-09 05:54:16,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:16,046 INFO L93 Difference]: Finished difference Result 1552 states and 2255 transitions. [2019-09-09 05:54:16,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:16,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-09 05:54:16,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:16,050 INFO L225 Difference]: With dead ends: 1552 [2019-09-09 05:54:16,050 INFO L226 Difference]: Without dead ends: 1552 [2019-09-09 05:54:16,050 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:16,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-09-09 05:54:16,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1317. [2019-09-09 05:54:16,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2019-09-09 05:54:16,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1922 transitions. [2019-09-09 05:54:16,064 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1922 transitions. Word has length 153 [2019-09-09 05:54:16,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:16,065 INFO L475 AbstractCegarLoop]: Abstraction has 1317 states and 1922 transitions. [2019-09-09 05:54:16,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:16,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1922 transitions. [2019-09-09 05:54:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-09 05:54:16,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:16,067 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, 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:16,068 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:16,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:16,068 INFO L82 PathProgramCache]: Analyzing trace with hash -955663798, now seen corresponding path program 1 times [2019-09-09 05:54:16,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:16,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:16,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:16,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:16,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:16,150 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:16,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:16,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:16,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:16,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:16,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:16,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:16,152 INFO L87 Difference]: Start difference. First operand 1317 states and 1922 transitions. Second operand 4 states. [2019-09-09 05:54:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:16,497 INFO L93 Difference]: Finished difference Result 1552 states and 2250 transitions. [2019-09-09 05:54:16,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:16,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-09 05:54:16,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:16,501 INFO L225 Difference]: With dead ends: 1552 [2019-09-09 05:54:16,501 INFO L226 Difference]: Without dead ends: 1552 [2019-09-09 05:54:16,501 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:16,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-09-09 05:54:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1342. [2019-09-09 05:54:16,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-09-09 05:54:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1957 transitions. [2019-09-09 05:54:16,515 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1957 transitions. Word has length 154 [2019-09-09 05:54:16,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:16,515 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 1957 transitions. [2019-09-09 05:54:16,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1957 transitions. [2019-09-09 05:54:16,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:54:16,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:16,518 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, 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:16,518 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:16,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:16,518 INFO L82 PathProgramCache]: Analyzing trace with hash -943372069, now seen corresponding path program 1 times [2019-09-09 05:54:16,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:16,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:16,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:16,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:16,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:16,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:16,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:16,579 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:16,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:16,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:16,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:16,580 INFO L87 Difference]: Start difference. First operand 1342 states and 1957 transitions. Second operand 4 states. [2019-09-09 05:54:16,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:16,916 INFO L93 Difference]: Finished difference Result 1552 states and 2245 transitions. [2019-09-09 05:54:16,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:16,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-09 05:54:16,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:16,920 INFO L225 Difference]: With dead ends: 1552 [2019-09-09 05:54:16,920 INFO L226 Difference]: Without dead ends: 1552 [2019-09-09 05:54:16,921 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:16,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-09-09 05:54:16,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1342. [2019-09-09 05:54:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-09-09 05:54:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1952 transitions. [2019-09-09 05:54:16,935 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1952 transitions. Word has length 155 [2019-09-09 05:54:16,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:16,935 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 1952 transitions. [2019-09-09 05:54:16,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:16,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1952 transitions. [2019-09-09 05:54:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:54:16,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:16,938 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, 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:16,938 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:16,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:16,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1336878587, now seen corresponding path program 1 times [2019-09-09 05:54:16,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:16,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:16,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:16,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:16,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:17,017 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:17,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:17,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:17,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:17,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:17,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:17,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:17,019 INFO L87 Difference]: Start difference. First operand 1342 states and 1952 transitions. Second operand 4 states. [2019-09-09 05:54:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:17,350 INFO L93 Difference]: Finished difference Result 1542 states and 2230 transitions. [2019-09-09 05:54:17,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:17,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-09 05:54:17,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:17,355 INFO L225 Difference]: With dead ends: 1542 [2019-09-09 05:54:17,355 INFO L226 Difference]: Without dead ends: 1542 [2019-09-09 05:54:17,356 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,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-09-09 05:54:17,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1347. [2019-09-09 05:54:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-09-09 05:54:17,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1957 transitions. [2019-09-09 05:54:17,374 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1957 transitions. Word has length 155 [2019-09-09 05:54:17,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:17,374 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 1957 transitions. [2019-09-09 05:54:17,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:17,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1957 transitions. [2019-09-09 05:54:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:54:17,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:17,377 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, 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:17,377 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:17,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:17,378 INFO L82 PathProgramCache]: Analyzing trace with hash -631109824, now seen corresponding path program 1 times [2019-09-09 05:54:17,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:17,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:17,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:17,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:17,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:17,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:17,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:17,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:17,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:17,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:17,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:17,447 INFO L87 Difference]: Start difference. First operand 1347 states and 1957 transitions. Second operand 4 states. [2019-09-09 05:54:17,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:17,769 INFO L93 Difference]: Finished difference Result 1532 states and 2210 transitions. [2019-09-09 05:54:17,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:17,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:54:17,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:17,773 INFO L225 Difference]: With dead ends: 1532 [2019-09-09 05:54:17,773 INFO L226 Difference]: Without dead ends: 1532 [2019-09-09 05:54:17,773 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,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-09-09 05:54:17,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1347. [2019-09-09 05:54:17,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-09-09 05:54:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1952 transitions. [2019-09-09 05:54:17,790 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1952 transitions. Word has length 156 [2019-09-09 05:54:17,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:17,790 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 1952 transitions. [2019-09-09 05:54:17,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:17,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1952 transitions. [2019-09-09 05:54:17,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:54:17,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:17,793 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:17,794 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:17,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:17,794 INFO L82 PathProgramCache]: Analyzing trace with hash 616877608, now seen corresponding path program 1 times [2019-09-09 05:54:17,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:17,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:17,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:17,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:17,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:17,893 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:17,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:17,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:17,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:17,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:17,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:17,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:17,895 INFO L87 Difference]: Start difference. First operand 1347 states and 1952 transitions. Second operand 4 states. [2019-09-09 05:54:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:18,216 INFO L93 Difference]: Finished difference Result 1517 states and 2185 transitions. [2019-09-09 05:54:18,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:18,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:54:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:18,219 INFO L225 Difference]: With dead ends: 1517 [2019-09-09 05:54:18,220 INFO L226 Difference]: Without dead ends: 1517 [2019-09-09 05:54:18,220 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,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-09-09 05:54:18,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1352. [2019-09-09 05:54:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-09-09 05:54:18,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1957 transitions. [2019-09-09 05:54:18,235 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1957 transitions. Word has length 156 [2019-09-09 05:54:18,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:18,235 INFO L475 AbstractCegarLoop]: Abstraction has 1352 states and 1957 transitions. [2019-09-09 05:54:18,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:18,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1957 transitions. [2019-09-09 05:54:18,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:54:18,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:18,238 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:18,239 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:18,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:18,239 INFO L82 PathProgramCache]: Analyzing trace with hash -680355751, now seen corresponding path program 1 times [2019-09-09 05:54:18,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:18,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:18,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:18,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:18,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:18,312 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:18,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:18,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:18,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:18,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:18,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:18,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:18,314 INFO L87 Difference]: Start difference. First operand 1352 states and 1957 transitions. Second operand 4 states. [2019-09-09 05:54:18,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:18,616 INFO L93 Difference]: Finished difference Result 1517 states and 2180 transitions. [2019-09-09 05:54:18,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:18,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-09 05:54:18,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:18,619 INFO L225 Difference]: With dead ends: 1517 [2019-09-09 05:54:18,619 INFO L226 Difference]: Without dead ends: 1517 [2019-09-09 05:54:18,620 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,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-09-09 05:54:18,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1357. [2019-09-09 05:54:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2019-09-09 05:54:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1962 transitions. [2019-09-09 05:54:18,634 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1962 transitions. Word has length 158 [2019-09-09 05:54:18,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:18,634 INFO L475 AbstractCegarLoop]: Abstraction has 1357 states and 1962 transitions. [2019-09-09 05:54:18,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1962 transitions. [2019-09-09 05:54:18,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-09 05:54:18,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:18,637 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:18,637 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:18,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:18,637 INFO L82 PathProgramCache]: Analyzing trace with hash -490771207, now seen corresponding path program 1 times [2019-09-09 05:54:18,637 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,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:18,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:18,712 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:18,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:18,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:18,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:18,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:18,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:18,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:18,713 INFO L87 Difference]: Start difference. First operand 1357 states and 1962 transitions. Second operand 4 states. [2019-09-09 05:54:18,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:18,985 INFO L93 Difference]: Finished difference Result 1497 states and 2150 transitions. [2019-09-09 05:54:18,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:18,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-09 05:54:18,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:18,988 INFO L225 Difference]: With dead ends: 1497 [2019-09-09 05:54:18,988 INFO L226 Difference]: Without dead ends: 1497 [2019-09-09 05:54:18,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:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2019-09-09 05:54:18,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1362. [2019-09-09 05:54:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-09-09 05:54:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1967 transitions. [2019-09-09 05:54:19,001 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1967 transitions. Word has length 159 [2019-09-09 05:54:19,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:19,001 INFO L475 AbstractCegarLoop]: Abstraction has 1362 states and 1967 transitions. [2019-09-09 05:54:19,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:19,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1967 transitions. [2019-09-09 05:54:19,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-09 05:54:19,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:19,003 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:19,004 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:19,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:19,004 INFO L82 PathProgramCache]: Analyzing trace with hash 888709627, now seen corresponding path program 1 times [2019-09-09 05:54:19,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:19,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:19,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:19,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:19,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:19,068 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:19,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:19,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:19,069 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:19,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:19,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:19,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:19,073 INFO L87 Difference]: Start difference. First operand 1362 states and 1967 transitions. Second operand 4 states. [2019-09-09 05:54:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:19,333 INFO L93 Difference]: Finished difference Result 1497 states and 2145 transitions. [2019-09-09 05:54:19,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:19,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-09 05:54:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:19,336 INFO L225 Difference]: With dead ends: 1497 [2019-09-09 05:54:19,336 INFO L226 Difference]: Without dead ends: 1497 [2019-09-09 05:54:19,336 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,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2019-09-09 05:54:19,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1367. [2019-09-09 05:54:19,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2019-09-09 05:54:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1972 transitions. [2019-09-09 05:54:19,349 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1972 transitions. Word has length 159 [2019-09-09 05:54:19,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:19,349 INFO L475 AbstractCegarLoop]: Abstraction has 1367 states and 1972 transitions. [2019-09-09 05:54:19,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:19,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1972 transitions. [2019-09-09 05:54:19,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-09 05:54:19,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:19,354 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:19,354 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:19,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:19,355 INFO L82 PathProgramCache]: Analyzing trace with hash 100461755, now seen corresponding path program 1 times [2019-09-09 05:54:19,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:19,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:19,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:19,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:19,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:19,452 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:19,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:19,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:19,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:19,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:19,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:19,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:19,455 INFO L87 Difference]: Start difference. First operand 1367 states and 1972 transitions. Second operand 4 states. [2019-09-09 05:54:19,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:19,728 INFO L93 Difference]: Finished difference Result 1487 states and 2130 transitions. [2019-09-09 05:54:19,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:19,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-09 05:54:19,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:19,733 INFO L225 Difference]: With dead ends: 1487 [2019-09-09 05:54:19,733 INFO L226 Difference]: Without dead ends: 1487 [2019-09-09 05:54:19,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:19,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-09-09 05:54:19,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1372. [2019-09-09 05:54:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-09-09 05:54:19,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1977 transitions. [2019-09-09 05:54:19,753 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1977 transitions. Word has length 160 [2019-09-09 05:54:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:19,753 INFO L475 AbstractCegarLoop]: Abstraction has 1372 states and 1977 transitions. [2019-09-09 05:54:19,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:19,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1977 transitions. [2019-09-09 05:54:19,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 05:54:19,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:19,756 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:19,756 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:19,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:19,756 INFO L82 PathProgramCache]: Analyzing trace with hash 828422518, now seen corresponding path program 1 times [2019-09-09 05:54:19,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:19,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:19,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:19,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:19,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:19,838 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:19,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:19,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:19,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:19,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:19,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:19,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:19,840 INFO L87 Difference]: Start difference. First operand 1372 states and 1977 transitions. Second operand 4 states. [2019-09-09 05:54:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:20,136 INFO L93 Difference]: Finished difference Result 1487 states and 2125 transitions. [2019-09-09 05:54:20,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:20,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-09 05:54:20,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:20,139 INFO L225 Difference]: With dead ends: 1487 [2019-09-09 05:54:20,139 INFO L226 Difference]: Without dead ends: 1487 [2019-09-09 05:54:20,139 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,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-09-09 05:54:20,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1377. [2019-09-09 05:54:20,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2019-09-09 05:54:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1982 transitions. [2019-09-09 05:54:20,155 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1982 transitions. Word has length 161 [2019-09-09 05:54:20,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:20,156 INFO L475 AbstractCegarLoop]: Abstraction has 1377 states and 1982 transitions. [2019-09-09 05:54:20,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:20,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1982 transitions. [2019-09-09 05:54:20,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-09 05:54:20,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:20,159 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:20,159 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:20,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:20,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1161027478, now seen corresponding path program 1 times [2019-09-09 05:54:20,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:20,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:20,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:20,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:20,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:20,245 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:20,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:20,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:20,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:20,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:20,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:20,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:20,246 INFO L87 Difference]: Start difference. First operand 1377 states and 1982 transitions. Second operand 4 states. [2019-09-09 05:54:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:20,529 INFO L93 Difference]: Finished difference Result 1477 states and 2110 transitions. [2019-09-09 05:54:20,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:20,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-09 05:54:20,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:20,531 INFO L225 Difference]: With dead ends: 1477 [2019-09-09 05:54:20,531 INFO L226 Difference]: Without dead ends: 1477 [2019-09-09 05:54:20,532 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,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2019-09-09 05:54:20,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1382. [2019-09-09 05:54:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-09-09 05:54:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1987 transitions. [2019-09-09 05:54:20,546 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1987 transitions. Word has length 162 [2019-09-09 05:54:20,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:20,546 INFO L475 AbstractCegarLoop]: Abstraction has 1382 states and 1987 transitions. [2019-09-09 05:54:20,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:20,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1987 transitions. [2019-09-09 05:54:20,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-09 05:54:20,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:20,549 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:20,549 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:20,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:20,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1999755179, now seen corresponding path program 1 times [2019-09-09 05:54:20,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:20,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:20,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:20,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:20,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 174 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:21,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:54:21,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:54:21,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2019-09-09 05:54:21,270 INFO L207 CegarAbsIntRunner]: [0], [43], [48], [50], [61], [63], [67], [76], [78], [83], [88], [93], [98], [103], [108], [113], [118], [121], [123], [128], [133], [136], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [193], [198], [203], [208], [213], [218], [221], [223], [228], [231], [233], [238], [241], [312], [315], [323], [325], [328], [336], [339], [343], [523], [526], [542], [547], [550], [558], [563], [565], [568], [586], [589], [593], [614], [648], [650], [662], [665], [666], [678], [686], [687], [688] [2019-09-09 05:54:21,310 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:54:21,311 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:54:21,369 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:54:21,370 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-09 05:54:21,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:21,373 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:54:21,430 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-09 05:54:21,431 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:54:21,435 INFO L420 sIntCurrentIteration]: We unified 169 AI predicates to 169 [2019-09-09 05:54:21,435 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:54:21,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:54:21,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-09-09 05:54:21,436 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:21,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-09 05:54:21,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-09 05:54:21,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:54:21,437 INFO L87 Difference]: Start difference. First operand 1382 states and 1987 transitions. Second operand 2 states. [2019-09-09 05:54:21,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:21,437 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-09 05:54:21,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-09 05:54:21,438 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 170 [2019-09-09 05:54:21,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:21,438 INFO L225 Difference]: With dead ends: 2 [2019-09-09 05:54:21,438 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:54:21,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:54:21,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:54:21,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:54:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:54:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:54:21,439 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 170 [2019-09-09 05:54:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:21,439 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:54:21,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-09 05:54:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:54:21,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:54:21,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:54:21 BoogieIcfgContainer [2019-09-09 05:54:21,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:54:21,447 INFO L168 Benchmark]: Toolchain (without parser) took 31087.50 ms. Allocated memory was 136.3 MB in the beginning and 594.5 MB in the end (delta: 458.2 MB). Free memory was 90.3 MB in the beginning and 525.2 MB in the end (delta: -435.0 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:21,448 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.3 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:54:21,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 966.42 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 89.8 MB in the beginning and 158.2 MB in the end (delta: -68.3 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:21,449 INFO L168 Benchmark]: Boogie Preprocessor took 190.98 ms. Allocated memory is still 201.3 MB. Free memory was 158.2 MB in the beginning and 150.1 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:21,450 INFO L168 Benchmark]: RCFGBuilder took 1616.85 ms. Allocated memory was 201.3 MB in the beginning and 232.8 MB in the end (delta: 31.5 MB). Free memory was 150.1 MB in the beginning and 168.4 MB in the end (delta: -18.3 MB). Peak memory consumption was 74.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:21,450 INFO L168 Benchmark]: TraceAbstraction took 28308.83 ms. Allocated memory was 232.8 MB in the beginning and 594.5 MB in the end (delta: 361.8 MB). Free memory was 168.4 MB in the beginning and 525.2 MB in the end (delta: -356.8 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:21,453 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.22 ms. Allocated memory is still 136.3 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 966.42 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 89.8 MB in the beginning and 158.2 MB in the end (delta: -68.3 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 190.98 ms. Allocated memory is still 201.3 MB. Free memory was 158.2 MB in the beginning and 150.1 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1616.85 ms. Allocated memory was 201.3 MB in the beginning and 232.8 MB in the end (delta: 31.5 MB). Free memory was 150.1 MB in the beginning and 168.4 MB in the end (delta: -18.3 MB). Peak memory consumption was 74.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28308.83 ms. Allocated memory was 232.8 MB in the beginning and 594.5 MB in the end (delta: 361.8 MB). Free memory was 168.4 MB in the beginning and 525.2 MB in the end (delta: -356.8 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1726]: 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, 186 locations, 1 error locations. SAFE Result, 28.2s OverallTime, 67 OverallIterations, 5 TraceHistogramMax, 20.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15117 SDtfs, 4539 SDslu, 21251 SDs, 0 SdLazy, 12780 SolverSat, 521 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 530 GetRequests, 307 SyntacticMatches, 34 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1382occurred in iteration=66, 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.2603550295857988 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 67 MinimizatonAttempts, 6596 StatesRemovedByMinimization, 65 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 7175 NumberOfCodeBlocks, 7175 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 7108 ConstructedInterpolants, 0 QuantifiedInterpolants, 2555038 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 66 PerfectInterpolantSequences, 5789/5963 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...