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.12.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:53,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:53,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:53,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:53,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:53,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:53,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:53,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:53,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:53,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:53,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:53,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:53,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:53,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:53,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:53,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:53,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:53,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:53,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:53,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:53,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:53,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:53,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:53,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:53,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:53,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:53,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:53,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:53,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:53,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:53,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:53,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:53,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:53,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:53,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:53,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:53,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:53,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:53,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:53,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:53,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:53,260 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:27:53,274 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:53,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:53,275 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:53,275 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:53,275 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:53,276 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:53,276 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:53,276 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:53,276 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:53,276 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:53,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:53,277 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:53,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:53,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:53,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:53,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:53,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:53,279 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:53,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:53,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:53,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:53,279 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:53,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:53,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:53,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:53,280 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:53,280 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:53,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:53,281 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:53,281 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:53,313 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:53,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:53,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:53,330 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:53,331 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:53,332 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.12.i.cil-2.c [2019-09-20 13:27:53,394 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87c43a4d5/ca3fd188816e4daabd08f4af5adc069d/FLAGaf961ec80 [2019-09-20 13:27:54,019 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:54,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.12.i.cil-2.c [2019-09-20 13:27:54,049 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87c43a4d5/ca3fd188816e4daabd08f4af5adc069d/FLAGaf961ec80 [2019-09-20 13:27:54,247 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87c43a4d5/ca3fd188816e4daabd08f4af5adc069d [2019-09-20 13:27:54,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:54,258 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:54,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:54,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:54,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:54,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:54" (1/1) ... [2019-09-20 13:27:54,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e5923c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:54, skipping insertion in model container [2019-09-20 13:27:54,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:54" (1/1) ... [2019-09-20 13:27:54,275 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:54,359 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:54,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:54,970 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:55,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:55,150 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:55,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55 WrapperNode [2019-09-20 13:27:55,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:55,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:55,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:55,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:55,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55" (1/1) ... [2019-09-20 13:27:55,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55" (1/1) ... [2019-09-20 13:27:55,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55" (1/1) ... [2019-09-20 13:27:55,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55" (1/1) ... [2019-09-20 13:27:55,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55" (1/1) ... [2019-09-20 13:27:55,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55" (1/1) ... [2019-09-20 13:27:55,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55" (1/1) ... [2019-09-20 13:27:55,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:55,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:55,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:55,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:55,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:55,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:55,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:55,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:27:55,483 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:27:55,483 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:55,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:27:55,483 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:55,483 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:55,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:27:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:27:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:27:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:55,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:55,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:55,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:55,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:55,487 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:55,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:56,040 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:56,965 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:27:56,966 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:27:56,988 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:56,988 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:56,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:56 BoogieIcfgContainer [2019-09-20 13:27:56,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:56,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:56,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:56,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:56,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:54" (1/3) ... [2019-09-20 13:27:56,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d7aee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:56, skipping insertion in model container [2019-09-20 13:27:56,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55" (2/3) ... [2019-09-20 13:27:56,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d7aee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:56, skipping insertion in model container [2019-09-20 13:27:56,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:56" (3/3) ... [2019-09-20 13:27:57,000 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12.i.cil-2.c [2019-09-20 13:27:57,010 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:57,021 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:57,038 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:57,072 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:57,072 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:57,072 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:57,073 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:57,073 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:57,073 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:57,073 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:57,073 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2019-09-20 13:27:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-20 13:27:57,123 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:57,124 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:57,127 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:57,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:57,133 INFO L82 PathProgramCache]: Analyzing trace with hash 958374662, now seen corresponding path program 1 times [2019-09-20 13:27:57,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:57,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:57,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:57,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:57,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:57,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:57,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:57,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:57,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:57,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:57,562 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2019-09-20 13:27:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:58,036 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2019-09-20 13:27:58,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:58,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-09-20 13:27:58,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:58,052 INFO L225 Difference]: With dead ends: 193 [2019-09-20 13:27:58,052 INFO L226 Difference]: Without dead ends: 172 [2019-09-20 13:27:58,054 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:58,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-20 13:27:58,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2019-09-20 13:27:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-20 13:27:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 238 transitions. [2019-09-20 13:27:58,144 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 238 transitions. Word has length 48 [2019-09-20 13:27:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:58,146 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 238 transitions. [2019-09-20 13:27:58,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:58,146 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 238 transitions. [2019-09-20 13:27:58,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-20 13:27:58,152 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:58,152 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:58,154 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:58,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:58,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1711374045, now seen corresponding path program 1 times [2019-09-20 13:27:58,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:58,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:58,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:58,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:58,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:58,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:58,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:58,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:58,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:58,377 INFO L87 Difference]: Start difference. First operand 155 states and 238 transitions. Second operand 4 states. [2019-09-20 13:27:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:58,805 INFO L93 Difference]: Finished difference Result 172 states and 258 transitions. [2019-09-20 13:27:58,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:58,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-09-20 13:27:58,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:58,808 INFO L225 Difference]: With dead ends: 172 [2019-09-20 13:27:58,809 INFO L226 Difference]: Without dead ends: 172 [2019-09-20 13:27:58,812 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:58,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-20 13:27:58,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2019-09-20 13:27:58,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-20 13:27:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 237 transitions. [2019-09-20 13:27:58,828 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 237 transitions. Word has length 61 [2019-09-20 13:27:58,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:58,830 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 237 transitions. [2019-09-20 13:27:58,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:58,833 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 237 transitions. [2019-09-20 13:27:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:27:58,835 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:58,838 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:58,839 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:58,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:58,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1793415351, now seen corresponding path program 1 times [2019-09-20 13:27:58,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:58,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:58,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:59,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:59,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:59,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:59,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:59,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:59,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:59,007 INFO L87 Difference]: Start difference. First operand 155 states and 237 transitions. Second operand 4 states. [2019-09-20 13:27:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:59,330 INFO L93 Difference]: Finished difference Result 171 states and 256 transitions. [2019-09-20 13:27:59,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:59,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-20 13:27:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:59,333 INFO L225 Difference]: With dead ends: 171 [2019-09-20 13:27:59,333 INFO L226 Difference]: Without dead ends: 171 [2019-09-20 13:27:59,333 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-20 13:27:59,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 155. [2019-09-20 13:27:59,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-20 13:27:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 236 transitions. [2019-09-20 13:27:59,343 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 236 transitions. Word has length 62 [2019-09-20 13:27:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:59,343 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 236 transitions. [2019-09-20 13:27:59,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 236 transitions. [2019-09-20 13:27:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:27:59,346 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:59,346 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:59,346 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:59,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:59,347 INFO L82 PathProgramCache]: Analyzing trace with hash 745904547, now seen corresponding path program 1 times [2019-09-20 13:27:59,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:59,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:59,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:59,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:59,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:27:59,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:59,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:27:59,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:27:59,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:59,450 INFO L87 Difference]: Start difference. First operand 155 states and 236 transitions. Second operand 5 states. [2019-09-20 13:27:59,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:59,977 INFO L93 Difference]: Finished difference Result 176 states and 264 transitions. [2019-09-20 13:27:59,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:59,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-09-20 13:27:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:59,981 INFO L225 Difference]: With dead ends: 176 [2019-09-20 13:27:59,981 INFO L226 Difference]: Without dead ends: 176 [2019-09-20 13:27:59,982 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:27:59,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-20 13:27:59,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-09-20 13:27:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-20 13:27:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 263 transitions. [2019-09-20 13:27:59,993 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 263 transitions. Word has length 62 [2019-09-20 13:27:59,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:59,993 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 263 transitions. [2019-09-20 13:27:59,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:27:59,994 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 263 transitions. [2019-09-20 13:27:59,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:27:59,995 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:59,995 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:59,996 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:59,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:59,996 INFO L82 PathProgramCache]: Analyzing trace with hash -739968789, now seen corresponding path program 1 times [2019-09-20 13:27:59,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:59,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:59,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:00,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:00,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:00,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:00,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:00,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:00,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:00,076 INFO L87 Difference]: Start difference. First operand 175 states and 263 transitions. Second operand 4 states. [2019-09-20 13:28:00,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:00,461 INFO L93 Difference]: Finished difference Result 190 states and 280 transitions. [2019-09-20 13:28:00,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:00,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-20 13:28:00,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:00,464 INFO L225 Difference]: With dead ends: 190 [2019-09-20 13:28:00,464 INFO L226 Difference]: Without dead ends: 190 [2019-09-20 13:28:00,465 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:00,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-20 13:28:00,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 175. [2019-09-20 13:28:00,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-20 13:28:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 262 transitions. [2019-09-20 13:28:00,472 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 262 transitions. Word has length 62 [2019-09-20 13:28:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:00,473 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 262 transitions. [2019-09-20 13:28:00,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 262 transitions. [2019-09-20 13:28:00,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:28:00,474 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:00,474 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:00,475 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:00,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:00,475 INFO L82 PathProgramCache]: Analyzing trace with hash -880695476, now seen corresponding path program 1 times [2019-09-20 13:28:00,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:00,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:00,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:00,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:00,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:00,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:00,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:00,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:00,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:00,552 INFO L87 Difference]: Start difference. First operand 175 states and 262 transitions. Second operand 4 states. [2019-09-20 13:28:00,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:00,806 INFO L93 Difference]: Finished difference Result 188 states and 277 transitions. [2019-09-20 13:28:00,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:00,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-20 13:28:00,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:00,808 INFO L225 Difference]: With dead ends: 188 [2019-09-20 13:28:00,808 INFO L226 Difference]: Without dead ends: 188 [2019-09-20 13:28:00,809 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:00,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-20 13:28:00,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2019-09-20 13:28:00,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-20 13:28:00,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 261 transitions. [2019-09-20 13:28:00,820 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 261 transitions. Word has length 62 [2019-09-20 13:28:00,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:00,820 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 261 transitions. [2019-09-20 13:28:00,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:00,821 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 261 transitions. [2019-09-20 13:28:00,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:28:00,822 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:00,822 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:00,822 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:00,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:00,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1761471238, now seen corresponding path program 1 times [2019-09-20 13:28:00,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:00,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:00,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:00,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:00,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:00,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:00,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:00,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:00,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:00,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:00,882 INFO L87 Difference]: Start difference. First operand 175 states and 261 transitions. Second operand 4 states. [2019-09-20 13:28:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:01,140 INFO L93 Difference]: Finished difference Result 188 states and 276 transitions. [2019-09-20 13:28:01,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:01,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:28:01,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:01,142 INFO L225 Difference]: With dead ends: 188 [2019-09-20 13:28:01,142 INFO L226 Difference]: Without dead ends: 188 [2019-09-20 13:28:01,143 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:01,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-20 13:28:01,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2019-09-20 13:28:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-20 13:28:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 260 transitions. [2019-09-20 13:28:01,149 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 260 transitions. Word has length 63 [2019-09-20 13:28:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:01,149 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 260 transitions. [2019-09-20 13:28:01,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 260 transitions. [2019-09-20 13:28:01,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:28:01,150 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:01,150 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:01,151 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:01,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:01,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1492214191, now seen corresponding path program 1 times [2019-09-20 13:28:01,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:01,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:01,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:01,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:01,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:01,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:01,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:01,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:01,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:01,228 INFO L87 Difference]: Start difference. First operand 175 states and 260 transitions. Second operand 4 states. [2019-09-20 13:28:01,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:01,530 INFO L93 Difference]: Finished difference Result 188 states and 275 transitions. [2019-09-20 13:28:01,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:01,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:28:01,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:01,532 INFO L225 Difference]: With dead ends: 188 [2019-09-20 13:28:01,533 INFO L226 Difference]: Without dead ends: 188 [2019-09-20 13:28:01,533 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:01,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-20 13:28:01,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2019-09-20 13:28:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-20 13:28:01,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 259 transitions. [2019-09-20 13:28:01,539 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 259 transitions. Word has length 64 [2019-09-20 13:28:01,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:01,539 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 259 transitions. [2019-09-20 13:28:01,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:01,539 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 259 transitions. [2019-09-20 13:28:01,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:28:01,540 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:01,540 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:01,541 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:01,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:01,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1295024277, now seen corresponding path program 1 times [2019-09-20 13:28:01,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:01,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:01,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:01,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:01,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:01,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:01,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:01,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:01,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:01,596 INFO L87 Difference]: Start difference. First operand 175 states and 259 transitions. Second operand 4 states. [2019-09-20 13:28:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:01,923 INFO L93 Difference]: Finished difference Result 188 states and 274 transitions. [2019-09-20 13:28:01,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:01,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:28:01,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:01,925 INFO L225 Difference]: With dead ends: 188 [2019-09-20 13:28:01,925 INFO L226 Difference]: Without dead ends: 188 [2019-09-20 13:28:01,926 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:01,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-20 13:28:01,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2019-09-20 13:28:01,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-20 13:28:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 258 transitions. [2019-09-20 13:28:01,931 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 258 transitions. Word has length 65 [2019-09-20 13:28:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:01,932 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 258 transitions. [2019-09-20 13:28:01,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 258 transitions. [2019-09-20 13:28:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:28:01,933 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:01,933 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:01,934 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:01,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:01,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1884528940, now seen corresponding path program 1 times [2019-09-20 13:28:01,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:01,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:01,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:01,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:01,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:01,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:01,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:01,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:01,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:01,995 INFO L87 Difference]: Start difference. First operand 175 states and 258 transitions. Second operand 4 states. [2019-09-20 13:28:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:02,292 INFO L93 Difference]: Finished difference Result 217 states and 320 transitions. [2019-09-20 13:28:02,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:02,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:28:02,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:02,294 INFO L225 Difference]: With dead ends: 217 [2019-09-20 13:28:02,294 INFO L226 Difference]: Without dead ends: 217 [2019-09-20 13:28:02,295 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-20 13:28:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2019-09-20 13:28:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-20 13:28:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 295 transitions. [2019-09-20 13:28:02,302 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 295 transitions. Word has length 65 [2019-09-20 13:28:02,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:02,302 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 295 transitions. [2019-09-20 13:28:02,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 295 transitions. [2019-09-20 13:28:02,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:28:02,303 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:02,303 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:02,304 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:02,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:02,305 INFO L82 PathProgramCache]: Analyzing trace with hash -535308172, now seen corresponding path program 1 times [2019-09-20 13:28:02,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:02,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:02,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:02,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:02,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:02,365 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:02,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:02,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:02,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:02,367 INFO L87 Difference]: Start difference. First operand 197 states and 295 transitions. Second operand 4 states. [2019-09-20 13:28:02,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:02,665 INFO L93 Difference]: Finished difference Result 200 states and 298 transitions. [2019-09-20 13:28:02,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:02,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:28:02,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:02,668 INFO L225 Difference]: With dead ends: 200 [2019-09-20 13:28:02,668 INFO L226 Difference]: Without dead ends: 200 [2019-09-20 13:28:02,669 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:02,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-20 13:28:02,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2019-09-20 13:28:02,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-20 13:28:02,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 294 transitions. [2019-09-20 13:28:02,677 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 294 transitions. Word has length 66 [2019-09-20 13:28:02,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:02,678 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 294 transitions. [2019-09-20 13:28:02,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:02,678 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 294 transitions. [2019-09-20 13:28:02,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:28:02,679 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:02,679 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:02,680 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:02,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:02,680 INFO L82 PathProgramCache]: Analyzing trace with hash -2103234371, now seen corresponding path program 1 times [2019-09-20 13:28:02,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:02,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:02,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:02,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:02,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:02,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:02,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:02,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:02,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:02,746 INFO L87 Difference]: Start difference. First operand 197 states and 294 transitions. Second operand 4 states. [2019-09-20 13:28:03,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:03,030 INFO L93 Difference]: Finished difference Result 217 states and 318 transitions. [2019-09-20 13:28:03,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:03,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:28:03,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:03,033 INFO L225 Difference]: With dead ends: 217 [2019-09-20 13:28:03,034 INFO L226 Difference]: Without dead ends: 217 [2019-09-20 13:28:03,034 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:03,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-20 13:28:03,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2019-09-20 13:28:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-20 13:28:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 293 transitions. [2019-09-20 13:28:03,041 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 293 transitions. Word has length 78 [2019-09-20 13:28:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:03,042 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 293 transitions. [2019-09-20 13:28:03,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 293 transitions. [2019-09-20 13:28:03,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:28:03,043 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:03,043 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:03,043 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:03,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:03,044 INFO L82 PathProgramCache]: Analyzing trace with hash -2737007, now seen corresponding path program 1 times [2019-09-20 13:28:03,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:03,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:03,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:03,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:03,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:03,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:03,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:03,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:03,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:03,115 INFO L87 Difference]: Start difference. First operand 197 states and 293 transitions. Second operand 4 states. [2019-09-20 13:28:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:03,448 INFO L93 Difference]: Finished difference Result 216 states and 316 transitions. [2019-09-20 13:28:03,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:03,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:28:03,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:03,451 INFO L225 Difference]: With dead ends: 216 [2019-09-20 13:28:03,451 INFO L226 Difference]: Without dead ends: 216 [2019-09-20 13:28:03,452 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-20 13:28:03,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 197. [2019-09-20 13:28:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-20 13:28:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 292 transitions. [2019-09-20 13:28:03,458 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 292 transitions. Word has length 79 [2019-09-20 13:28:03,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:03,459 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 292 transitions. [2019-09-20 13:28:03,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:03,459 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 292 transitions. [2019-09-20 13:28:03,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:28:03,460 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:03,460 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:03,461 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:03,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:03,461 INFO L82 PathProgramCache]: Analyzing trace with hash -143463694, now seen corresponding path program 1 times [2019-09-20 13:28:03,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:03,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:03,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:03,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:03,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:03,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:03,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:03,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:03,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:03,527 INFO L87 Difference]: Start difference. First operand 197 states and 292 transitions. Second operand 4 states. [2019-09-20 13:28:03,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:03,850 INFO L93 Difference]: Finished difference Result 214 states and 313 transitions. [2019-09-20 13:28:03,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:03,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:28:03,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:03,853 INFO L225 Difference]: With dead ends: 214 [2019-09-20 13:28:03,853 INFO L226 Difference]: Without dead ends: 214 [2019-09-20 13:28:03,853 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-20 13:28:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2019-09-20 13:28:03,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-20 13:28:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 291 transitions. [2019-09-20 13:28:03,859 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 291 transitions. Word has length 79 [2019-09-20 13:28:03,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:03,859 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 291 transitions. [2019-09-20 13:28:03,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 291 transitions. [2019-09-20 13:28:03,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:28:03,861 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:03,861 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:03,861 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:03,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:03,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1154147296, now seen corresponding path program 1 times [2019-09-20 13:28:03,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:03,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:03,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:03,926 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:03,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:03,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:03,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:03,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:03,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:03,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:03,927 INFO L87 Difference]: Start difference. First operand 197 states and 291 transitions. Second operand 4 states. [2019-09-20 13:28:04,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:04,213 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2019-09-20 13:28:04,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:04,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:28:04,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:04,216 INFO L225 Difference]: With dead ends: 214 [2019-09-20 13:28:04,216 INFO L226 Difference]: Without dead ends: 214 [2019-09-20 13:28:04,216 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-20 13:28:04,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2019-09-20 13:28:04,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-20 13:28:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 290 transitions. [2019-09-20 13:28:04,222 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 290 transitions. Word has length 80 [2019-09-20 13:28:04,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:04,222 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 290 transitions. [2019-09-20 13:28:04,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:04,223 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 290 transitions. [2019-09-20 13:28:04,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:28:04,224 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:04,224 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:04,224 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:04,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:04,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1302352853, now seen corresponding path program 1 times [2019-09-20 13:28:04,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:04,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:04,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:04,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:04,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:04,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:04,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:04,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:04,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:04,284 INFO L87 Difference]: Start difference. First operand 197 states and 290 transitions. Second operand 4 states. [2019-09-20 13:28:04,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:04,607 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2019-09-20 13:28:04,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:04,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:28:04,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:04,610 INFO L225 Difference]: With dead ends: 214 [2019-09-20 13:28:04,610 INFO L226 Difference]: Without dead ends: 214 [2019-09-20 13:28:04,610 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:04,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-20 13:28:04,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2019-09-20 13:28:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-20 13:28:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 289 transitions. [2019-09-20 13:28:04,616 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 289 transitions. Word has length 81 [2019-09-20 13:28:04,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:04,616 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 289 transitions. [2019-09-20 13:28:04,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:04,616 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 289 transitions. [2019-09-20 13:28:04,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:28:04,617 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:04,617 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:04,618 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:04,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:04,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1409208837, now seen corresponding path program 1 times [2019-09-20 13:28:04,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:04,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:04,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:04,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:04,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:04,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:04,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:04,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:04,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:04,670 INFO L87 Difference]: Start difference. First operand 197 states and 289 transitions. Second operand 4 states. [2019-09-20 13:28:04,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:04,953 INFO L93 Difference]: Finished difference Result 214 states and 310 transitions. [2019-09-20 13:28:04,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:04,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:28:04,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:04,955 INFO L225 Difference]: With dead ends: 214 [2019-09-20 13:28:04,956 INFO L226 Difference]: Without dead ends: 214 [2019-09-20 13:28:04,956 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-20 13:28:04,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2019-09-20 13:28:04,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-20 13:28:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 288 transitions. [2019-09-20 13:28:04,962 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 288 transitions. Word has length 82 [2019-09-20 13:28:04,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:04,963 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 288 transitions. [2019-09-20 13:28:04,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:04,963 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 288 transitions. [2019-09-20 13:28:04,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:28:04,964 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:04,964 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:04,964 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:04,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:04,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1691539738, now seen corresponding path program 1 times [2019-09-20 13:28:04,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:04,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:04,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:05,035 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:05,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:05,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:05,036 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:05,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:05,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:05,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:05,037 INFO L87 Difference]: Start difference. First operand 197 states and 288 transitions. Second operand 4 states. [2019-09-20 13:28:05,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:05,372 INFO L93 Difference]: Finished difference Result 204 states and 297 transitions. [2019-09-20 13:28:05,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:05,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-20 13:28:05,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:05,375 INFO L225 Difference]: With dead ends: 204 [2019-09-20 13:28:05,375 INFO L226 Difference]: Without dead ends: 204 [2019-09-20 13:28:05,376 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:05,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-20 13:28:05,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 197. [2019-09-20 13:28:05,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-20 13:28:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 287 transitions. [2019-09-20 13:28:05,384 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 287 transitions. Word has length 83 [2019-09-20 13:28:05,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:05,385 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 287 transitions. [2019-09-20 13:28:05,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 287 transitions. [2019-09-20 13:28:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-20 13:28:05,387 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:05,387 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:05,388 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:05,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:05,388 INFO L82 PathProgramCache]: Analyzing trace with hash -86803390, now seen corresponding path program 1 times [2019-09-20 13:28:05,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:05,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:05,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:05,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:05,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:05,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:05,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:05,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:05,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:05,557 INFO L87 Difference]: Start difference. First operand 197 states and 287 transitions. Second operand 4 states. [2019-09-20 13:28:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:05,980 INFO L93 Difference]: Finished difference Result 306 states and 454 transitions. [2019-09-20 13:28:05,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:05,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-20 13:28:05,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:05,983 INFO L225 Difference]: With dead ends: 306 [2019-09-20 13:28:05,983 INFO L226 Difference]: Without dead ends: 306 [2019-09-20 13:28:05,984 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:05,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-20 13:28:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 238. [2019-09-20 13:28:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-20 13:28:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 360 transitions. [2019-09-20 13:28:05,994 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 360 transitions. Word has length 87 [2019-09-20 13:28:05,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:05,995 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 360 transitions. [2019-09-20 13:28:05,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 360 transitions. [2019-09-20 13:28:05,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-20 13:28:05,997 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:05,997 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:05,998 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:05,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:05,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1458610688, now seen corresponding path program 1 times [2019-09-20 13:28:05,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:06,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:06,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:06,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:06,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:06,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:06,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:06,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:06,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:06,099 INFO L87 Difference]: Start difference. First operand 238 states and 360 transitions. Second operand 4 states. [2019-09-20 13:28:06,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:06,418 INFO L93 Difference]: Finished difference Result 287 states and 433 transitions. [2019-09-20 13:28:06,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:06,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-20 13:28:06,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:06,421 INFO L225 Difference]: With dead ends: 287 [2019-09-20 13:28:06,421 INFO L226 Difference]: Without dead ends: 287 [2019-09-20 13:28:06,421 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:06,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-20 13:28:06,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 262. [2019-09-20 13:28:06,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-20 13:28:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 401 transitions. [2019-09-20 13:28:06,429 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 401 transitions. Word has length 87 [2019-09-20 13:28:06,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:06,430 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 401 transitions. [2019-09-20 13:28:06,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:06,430 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 401 transitions. [2019-09-20 13:28:06,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 13:28:06,431 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:06,431 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:06,432 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:06,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:06,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1363791654, now seen corresponding path program 1 times [2019-09-20 13:28:06,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:06,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:06,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:06,539 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:06,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:06,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:06,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:06,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:06,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:06,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:06,541 INFO L87 Difference]: Start difference. First operand 262 states and 401 transitions. Second operand 4 states. [2019-09-20 13:28:06,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:06,990 INFO L93 Difference]: Finished difference Result 323 states and 485 transitions. [2019-09-20 13:28:06,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:06,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-20 13:28:06,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:06,993 INFO L225 Difference]: With dead ends: 323 [2019-09-20 13:28:06,993 INFO L226 Difference]: Without dead ends: 323 [2019-09-20 13:28:06,993 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:06,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-20 13:28:07,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 263. [2019-09-20 13:28:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:07,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 402 transitions. [2019-09-20 13:28:07,004 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 402 transitions. Word has length 88 [2019-09-20 13:28:07,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,005 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 402 transitions. [2019-09-20 13:28:07,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,005 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 402 transitions. [2019-09-20 13:28:07,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-20 13:28:07,008 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,008 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:07,008 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1661897063, now seen corresponding path program 1 times [2019-09-20 13:28:07,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:07,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,122 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,123 INFO L87 Difference]: Start difference. First operand 263 states and 402 transitions. Second operand 4 states. [2019-09-20 13:28:07,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,714 INFO L93 Difference]: Finished difference Result 323 states and 484 transitions. [2019-09-20 13:28:07,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-20 13:28:07,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,720 INFO L225 Difference]: With dead ends: 323 [2019-09-20 13:28:07,721 INFO L226 Difference]: Without dead ends: 323 [2019-09-20 13:28:07,722 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:07,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-20 13:28:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 263. [2019-09-20 13:28:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:07,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 401 transitions. [2019-09-20 13:28:07,733 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 401 transitions. Word has length 100 [2019-09-20 13:28:07,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,734 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 401 transitions. [2019-09-20 13:28:07,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 401 transitions. [2019-09-20 13:28:07,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-20 13:28:07,736 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,737 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:07,737 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2105797737, now seen corresponding path program 1 times [2019-09-20 13:28:07,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,845 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:07,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,847 INFO L87 Difference]: Start difference. First operand 263 states and 401 transitions. Second operand 4 states. [2019-09-20 13:28:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,180 INFO L93 Difference]: Finished difference Result 288 states and 432 transitions. [2019-09-20 13:28:08,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-20 13:28:08,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,183 INFO L225 Difference]: With dead ends: 288 [2019-09-20 13:28:08,183 INFO L226 Difference]: Without dead ends: 288 [2019-09-20 13:28:08,185 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:08,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-20 13:28:08,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 263. [2019-09-20 13:28:08,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 400 transitions. [2019-09-20 13:28:08,204 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 400 transitions. Word has length 100 [2019-09-20 13:28:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,205 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 400 transitions. [2019-09-20 13:28:08,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,205 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 400 transitions. [2019-09-20 13:28:08,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:28:08,206 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,207 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:08,207 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,207 INFO L82 PathProgramCache]: Analyzing trace with hash 752220455, now seen corresponding path program 1 times [2019-09-20 13:28:08,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,295 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:08,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,298 INFO L87 Difference]: Start difference. First operand 263 states and 400 transitions. Second operand 4 states. [2019-09-20 13:28:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,732 INFO L93 Difference]: Finished difference Result 322 states and 481 transitions. [2019-09-20 13:28:08,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:28:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,735 INFO L225 Difference]: With dead ends: 322 [2019-09-20 13:28:08,735 INFO L226 Difference]: Without dead ends: 322 [2019-09-20 13:28:08,735 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:08,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-20 13:28:08,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 263. [2019-09-20 13:28:08,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 399 transitions. [2019-09-20 13:28:08,744 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 399 transitions. Word has length 101 [2019-09-20 13:28:08,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,744 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 399 transitions. [2019-09-20 13:28:08,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,744 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 399 transitions. [2019-09-20 13:28:08,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:28:08,746 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,746 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:08,746 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,749 INFO L82 PathProgramCache]: Analyzing trace with hash 611493768, now seen corresponding path program 1 times [2019-09-20 13:28:08,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:08,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,818 INFO L87 Difference]: Start difference. First operand 263 states and 399 transitions. Second operand 4 states. [2019-09-20 13:28:09,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,224 INFO L93 Difference]: Finished difference Result 320 states and 478 transitions. [2019-09-20 13:28:09,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:28:09,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,226 INFO L225 Difference]: With dead ends: 320 [2019-09-20 13:28:09,227 INFO L226 Difference]: Without dead ends: 320 [2019-09-20 13:28:09,227 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:09,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-20 13:28:09,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 263. [2019-09-20 13:28:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:09,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 398 transitions. [2019-09-20 13:28:09,236 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 398 transitions. Word has length 101 [2019-09-20 13:28:09,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,236 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 398 transitions. [2019-09-20 13:28:09,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,237 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 398 transitions. [2019-09-20 13:28:09,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:28:09,238 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,238 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:09,239 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1628239461, now seen corresponding path program 1 times [2019-09-20 13:28:09,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:09,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,333 INFO L87 Difference]: Start difference. First operand 263 states and 398 transitions. Second operand 4 states. [2019-09-20 13:28:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,690 INFO L93 Difference]: Finished difference Result 287 states and 428 transitions. [2019-09-20 13:28:09,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:28:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,692 INFO L225 Difference]: With dead ends: 287 [2019-09-20 13:28:09,693 INFO L226 Difference]: Without dead ends: 287 [2019-09-20 13:28:09,693 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:09,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-20 13:28:09,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 263. [2019-09-20 13:28:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 397 transitions. [2019-09-20 13:28:09,701 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 397 transitions. Word has length 101 [2019-09-20 13:28:09,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,701 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 397 transitions. [2019-09-20 13:28:09,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 397 transitions. [2019-09-20 13:28:09,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:28:09,703 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,703 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:09,703 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1487512774, now seen corresponding path program 1 times [2019-09-20 13:28:09,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:09,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,788 INFO L87 Difference]: Start difference. First operand 263 states and 397 transitions. Second operand 4 states. [2019-09-20 13:28:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,083 INFO L93 Difference]: Finished difference Result 285 states and 425 transitions. [2019-09-20 13:28:10,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:28:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,086 INFO L225 Difference]: With dead ends: 285 [2019-09-20 13:28:10,086 INFO L226 Difference]: Without dead ends: 285 [2019-09-20 13:28:10,086 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:10,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-20 13:28:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 263. [2019-09-20 13:28:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 396 transitions. [2019-09-20 13:28:10,093 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 396 transitions. Word has length 101 [2019-09-20 13:28:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,094 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 396 transitions. [2019-09-20 13:28:10,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 396 transitions. [2019-09-20 13:28:10,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:10,095 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,095 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:10,095 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,096 INFO L82 PathProgramCache]: Analyzing trace with hash 774697546, now seen corresponding path program 1 times [2019-09-20 13:28:10,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:10,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,156 INFO L87 Difference]: Start difference. First operand 263 states and 396 transitions. Second operand 4 states. [2019-09-20 13:28:10,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,567 INFO L93 Difference]: Finished difference Result 320 states and 475 transitions. [2019-09-20 13:28:10,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:10,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,570 INFO L225 Difference]: With dead ends: 320 [2019-09-20 13:28:10,571 INFO L226 Difference]: Without dead ends: 320 [2019-09-20 13:28:10,571 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:10,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-20 13:28:10,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 263. [2019-09-20 13:28:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:10,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 395 transitions. [2019-09-20 13:28:10,578 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 395 transitions. Word has length 102 [2019-09-20 13:28:10,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,578 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 395 transitions. [2019-09-20 13:28:10,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,578 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 395 transitions. [2019-09-20 13:28:10,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:10,579 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,580 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:10,580 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2133484340, now seen corresponding path program 1 times [2019-09-20 13:28:10,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:10,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,641 INFO L87 Difference]: Start difference. First operand 263 states and 395 transitions. Second operand 4 states. [2019-09-20 13:28:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,958 INFO L93 Difference]: Finished difference Result 285 states and 423 transitions. [2019-09-20 13:28:10,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:10,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,960 INFO L225 Difference]: With dead ends: 285 [2019-09-20 13:28:10,960 INFO L226 Difference]: Without dead ends: 285 [2019-09-20 13:28:10,960 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:10,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-20 13:28:10,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 263. [2019-09-20 13:28:10,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:10,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 394 transitions. [2019-09-20 13:28:10,965 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 394 transitions. Word has length 102 [2019-09-20 13:28:10,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,965 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 394 transitions. [2019-09-20 13:28:10,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 394 transitions. [2019-09-20 13:28:10,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:10,966 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,966 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:10,967 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,967 INFO L82 PathProgramCache]: Analyzing trace with hash 967000811, now seen corresponding path program 1 times [2019-09-20 13:28:10,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,032 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:11,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,034 INFO L87 Difference]: Start difference. First operand 263 states and 394 transitions. Second operand 4 states. [2019-09-20 13:28:11,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,438 INFO L93 Difference]: Finished difference Result 320 states and 473 transitions. [2019-09-20 13:28:11,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:11,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,440 INFO L225 Difference]: With dead ends: 320 [2019-09-20 13:28:11,440 INFO L226 Difference]: Without dead ends: 320 [2019-09-20 13:28:11,440 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:11,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-20 13:28:11,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 263. [2019-09-20 13:28:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 393 transitions. [2019-09-20 13:28:11,447 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 393 transitions. Word has length 103 [2019-09-20 13:28:11,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,447 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 393 transitions. [2019-09-20 13:28:11,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 393 transitions. [2019-09-20 13:28:11,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:11,449 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,449 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:11,449 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1007675561, now seen corresponding path program 1 times [2019-09-20 13:28:11,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:11,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,515 INFO L87 Difference]: Start difference. First operand 263 states and 393 transitions. Second operand 4 states. [2019-09-20 13:28:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,806 INFO L93 Difference]: Finished difference Result 285 states and 421 transitions. [2019-09-20 13:28:11,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:11,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,809 INFO L225 Difference]: With dead ends: 285 [2019-09-20 13:28:11,810 INFO L226 Difference]: Without dead ends: 285 [2019-09-20 13:28:11,810 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-20 13:28:11,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 263. [2019-09-20 13:28:11,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 392 transitions. [2019-09-20 13:28:11,816 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 392 transitions. Word has length 103 [2019-09-20 13:28:11,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,816 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 392 transitions. [2019-09-20 13:28:11,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,817 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 392 transitions. [2019-09-20 13:28:11,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:28:11,818 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,818 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:11,818 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,819 INFO L82 PathProgramCache]: Analyzing trace with hash -396769873, now seen corresponding path program 1 times [2019-09-20 13:28:11,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:11,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,908 INFO L87 Difference]: Start difference. First operand 263 states and 392 transitions. Second operand 4 states. [2019-09-20 13:28:12,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:12,327 INFO L93 Difference]: Finished difference Result 320 states and 471 transitions. [2019-09-20 13:28:12,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:12,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:28:12,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:12,330 INFO L225 Difference]: With dead ends: 320 [2019-09-20 13:28:12,331 INFO L226 Difference]: Without dead ends: 320 [2019-09-20 13:28:12,332 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:12,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-20 13:28:12,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 263. [2019-09-20 13:28:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 391 transitions. [2019-09-20 13:28:12,339 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 391 transitions. Word has length 104 [2019-09-20 13:28:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:12,339 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 391 transitions. [2019-09-20 13:28:12,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:12,339 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 391 transitions. [2019-09-20 13:28:12,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:28:12,340 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:12,341 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:12,341 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:12,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:12,341 INFO L82 PathProgramCache]: Analyzing trace with hash 864147377, now seen corresponding path program 1 times [2019-09-20 13:28:12,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:12,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:12,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:12,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:12,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:12,408 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:12,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:12,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:12,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:12,409 INFO L87 Difference]: Start difference. First operand 263 states and 391 transitions. Second operand 4 states. [2019-09-20 13:28:12,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:12,708 INFO L93 Difference]: Finished difference Result 285 states and 419 transitions. [2019-09-20 13:28:12,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:12,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:28:12,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:12,711 INFO L225 Difference]: With dead ends: 285 [2019-09-20 13:28:12,711 INFO L226 Difference]: Without dead ends: 285 [2019-09-20 13:28:12,712 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-20 13:28:12,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 263. [2019-09-20 13:28:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 390 transitions. [2019-09-20 13:28:12,719 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 390 transitions. Word has length 104 [2019-09-20 13:28:12,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:12,720 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 390 transitions. [2019-09-20 13:28:12,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:12,720 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 390 transitions. [2019-09-20 13:28:12,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:28:12,721 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:12,722 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:12,722 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:12,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:12,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1540774576, now seen corresponding path program 1 times [2019-09-20 13:28:12,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:12,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:12,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:12,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:12,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:12,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:12,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:12,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:12,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:12,819 INFO L87 Difference]: Start difference. First operand 263 states and 390 transitions. Second operand 4 states. [2019-09-20 13:28:13,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,191 INFO L93 Difference]: Finished difference Result 310 states and 457 transitions. [2019-09-20 13:28:13,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:13,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:28:13,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,194 INFO L225 Difference]: With dead ends: 310 [2019-09-20 13:28:13,195 INFO L226 Difference]: Without dead ends: 310 [2019-09-20 13:28:13,195 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:13,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-20 13:28:13,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 263. [2019-09-20 13:28:13,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 389 transitions. [2019-09-20 13:28:13,202 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 389 transitions. Word has length 105 [2019-09-20 13:28:13,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,202 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 389 transitions. [2019-09-20 13:28:13,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:13,202 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 389 transitions. [2019-09-20 13:28:13,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:28:13,203 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,203 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:13,204 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1974503662, now seen corresponding path program 1 times [2019-09-20 13:28:13,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:13,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:13,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:13,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:13,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:13,262 INFO L87 Difference]: Start difference. First operand 263 states and 389 transitions. Second operand 4 states. [2019-09-20 13:28:13,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,548 INFO L93 Difference]: Finished difference Result 275 states and 405 transitions. [2019-09-20 13:28:13,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:13,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:28:13,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,551 INFO L225 Difference]: With dead ends: 275 [2019-09-20 13:28:13,551 INFO L226 Difference]: Without dead ends: 275 [2019-09-20 13:28:13,552 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:13,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-20 13:28:13,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 263. [2019-09-20 13:28:13,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 388 transitions. [2019-09-20 13:28:13,556 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 388 transitions. Word has length 105 [2019-09-20 13:28:13,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,557 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 388 transitions. [2019-09-20 13:28:13,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 388 transitions. [2019-09-20 13:28:13,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-20 13:28:13,558 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,558 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:13,559 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,559 INFO L82 PathProgramCache]: Analyzing trace with hash -678240182, now seen corresponding path program 1 times [2019-09-20 13:28:13,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:13,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:13,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:13,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:13,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:13,636 INFO L87 Difference]: Start difference. First operand 263 states and 388 transitions. Second operand 4 states. [2019-09-20 13:28:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,010 INFO L93 Difference]: Finished difference Result 310 states and 455 transitions. [2019-09-20 13:28:14,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:14,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-20 13:28:14,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,011 INFO L225 Difference]: With dead ends: 310 [2019-09-20 13:28:14,011 INFO L226 Difference]: Without dead ends: 310 [2019-09-20 13:28:14,012 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:14,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-20 13:28:14,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 263. [2019-09-20 13:28:14,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 387 transitions. [2019-09-20 13:28:14,017 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 387 transitions. Word has length 109 [2019-09-20 13:28:14,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,017 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 387 transitions. [2019-09-20 13:28:14,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:14,018 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 387 transitions. [2019-09-20 13:28:14,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-20 13:28:14,019 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,019 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:14,019 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1032072, now seen corresponding path program 1 times [2019-09-20 13:28:14,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-20 13:28:14,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:14,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:14,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:14,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:14,111 INFO L87 Difference]: Start difference. First operand 263 states and 387 transitions. Second operand 3 states. [2019-09-20 13:28:14,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,175 INFO L93 Difference]: Finished difference Result 499 states and 735 transitions. [2019-09-20 13:28:14,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:14,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-20 13:28:14,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,178 INFO L225 Difference]: With dead ends: 499 [2019-09-20 13:28:14,179 INFO L226 Difference]: Without dead ends: 499 [2019-09-20 13:28:14,179 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:14,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-20 13:28:14,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2019-09-20 13:28:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-09-20 13:28:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 735 transitions. [2019-09-20 13:28:14,189 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 735 transitions. Word has length 109 [2019-09-20 13:28:14,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,190 INFO L475 AbstractCegarLoop]: Abstraction has 499 states and 735 transitions. [2019-09-20 13:28:14,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:14,191 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 735 transitions. [2019-09-20 13:28:14,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-20 13:28:14,192 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,193 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:14,193 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1468044382, now seen corresponding path program 1 times [2019-09-20 13:28:14,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:14,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:14,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:14,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:14,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:14,266 INFO L87 Difference]: Start difference. First operand 499 states and 735 transitions. Second operand 3 states. [2019-09-20 13:28:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,321 INFO L93 Difference]: Finished difference Result 735 states and 1084 transitions. [2019-09-20 13:28:14,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:14,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-20 13:28:14,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,325 INFO L225 Difference]: With dead ends: 735 [2019-09-20 13:28:14,325 INFO L226 Difference]: Without dead ends: 735 [2019-09-20 13:28:14,326 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:14,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-20 13:28:14,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2019-09-20 13:28:14,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2019-09-20 13:28:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1084 transitions. [2019-09-20 13:28:14,338 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1084 transitions. Word has length 111 [2019-09-20 13:28:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,339 INFO L475 AbstractCegarLoop]: Abstraction has 735 states and 1084 transitions. [2019-09-20 13:28:14,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1084 transitions. [2019-09-20 13:28:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-20 13:28:14,341 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,341 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:14,342 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,342 INFO L82 PathProgramCache]: Analyzing trace with hash -943503118, now seen corresponding path program 1 times [2019-09-20 13:28:14,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:14,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,418 INFO L87 Difference]: Start difference. First operand 735 states and 1084 transitions. Second operand 4 states. [2019-09-20 13:28:14,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,785 INFO L93 Difference]: Finished difference Result 924 states and 1375 transitions. [2019-09-20 13:28:14,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:14,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-20 13:28:14,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,790 INFO L225 Difference]: With dead ends: 924 [2019-09-20 13:28:14,790 INFO L226 Difference]: Without dead ends: 924 [2019-09-20 13:28:14,790 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:14,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-09-20 13:28:14,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 819. [2019-09-20 13:28:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-09-20 13:28:14,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1231 transitions. [2019-09-20 13:28:14,804 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1231 transitions. Word has length 140 [2019-09-20 13:28:14,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,805 INFO L475 AbstractCegarLoop]: Abstraction has 819 states and 1231 transitions. [2019-09-20 13:28:14,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:14,805 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1231 transitions. [2019-09-20 13:28:14,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-20 13:28:14,808 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,808 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:14,808 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1470421687, now seen corresponding path program 1 times [2019-09-20 13:28:14,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:14,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,936 INFO L87 Difference]: Start difference. First operand 819 states and 1231 transitions. Second operand 4 states. [2019-09-20 13:28:15,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:15,296 INFO L93 Difference]: Finished difference Result 924 states and 1372 transitions. [2019-09-20 13:28:15,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:15,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-20 13:28:15,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:15,301 INFO L225 Difference]: With dead ends: 924 [2019-09-20 13:28:15,302 INFO L226 Difference]: Without dead ends: 924 [2019-09-20 13:28:15,302 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:15,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-09-20 13:28:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 819. [2019-09-20 13:28:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-09-20 13:28:15,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1228 transitions. [2019-09-20 13:28:15,316 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1228 transitions. Word has length 153 [2019-09-20 13:28:15,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:15,316 INFO L475 AbstractCegarLoop]: Abstraction has 819 states and 1228 transitions. [2019-09-20 13:28:15,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:15,316 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1228 transitions. [2019-09-20 13:28:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-20 13:28:15,319 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:15,319 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:15,319 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:15,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:15,320 INFO L82 PathProgramCache]: Analyzing trace with hash -888548905, now seen corresponding path program 1 times [2019-09-20 13:28:15,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:15,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:15,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:15,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:15,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:15,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:15,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:15,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:15,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,396 INFO L87 Difference]: Start difference. First operand 819 states and 1228 transitions. Second operand 4 states. [2019-09-20 13:28:15,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:15,739 INFO L93 Difference]: Finished difference Result 921 states and 1366 transitions. [2019-09-20 13:28:15,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:15,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-20 13:28:15,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:15,744 INFO L225 Difference]: With dead ends: 921 [2019-09-20 13:28:15,744 INFO L226 Difference]: Without dead ends: 921 [2019-09-20 13:28:15,744 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-09-20 13:28:15,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 819. [2019-09-20 13:28:15,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-09-20 13:28:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1225 transitions. [2019-09-20 13:28:15,756 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1225 transitions. Word has length 154 [2019-09-20 13:28:15,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:15,757 INFO L475 AbstractCegarLoop]: Abstraction has 819 states and 1225 transitions. [2019-09-20 13:28:15,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:15,757 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1225 transitions. [2019-09-20 13:28:15,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-20 13:28:15,759 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:15,759 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:15,760 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:15,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:15,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1029275592, now seen corresponding path program 1 times [2019-09-20 13:28:15,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:15,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:15,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:15,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:15,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:15,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:15,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:15,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:15,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,843 INFO L87 Difference]: Start difference. First operand 819 states and 1225 transitions. Second operand 4 states. [2019-09-20 13:28:16,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,171 INFO L93 Difference]: Finished difference Result 915 states and 1357 transitions. [2019-09-20 13:28:16,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-20 13:28:16,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,176 INFO L225 Difference]: With dead ends: 915 [2019-09-20 13:28:16,176 INFO L226 Difference]: Without dead ends: 915 [2019-09-20 13:28:16,176 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:16,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-09-20 13:28:16,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 819. [2019-09-20 13:28:16,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-09-20 13:28:16,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1222 transitions. [2019-09-20 13:28:16,189 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1222 transitions. Word has length 154 [2019-09-20 13:28:16,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,190 INFO L475 AbstractCegarLoop]: Abstraction has 819 states and 1222 transitions. [2019-09-20 13:28:16,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,190 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1222 transitions. [2019-09-20 13:28:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-20 13:28:16,192 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,193 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:16,193 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1450454938, now seen corresponding path program 1 times [2019-09-20 13:28:16,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:16,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:16,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:16,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:16,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:16,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:16,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,286 INFO L87 Difference]: Start difference. First operand 819 states and 1222 transitions. Second operand 4 states. [2019-09-20 13:28:16,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,775 INFO L93 Difference]: Finished difference Result 915 states and 1354 transitions. [2019-09-20 13:28:16,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-20 13:28:16,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,783 INFO L225 Difference]: With dead ends: 915 [2019-09-20 13:28:16,783 INFO L226 Difference]: Without dead ends: 915 [2019-09-20 13:28:16,785 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-09-20 13:28:16,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 819. [2019-09-20 13:28:16,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-09-20 13:28:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1219 transitions. [2019-09-20 13:28:16,804 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1219 transitions. Word has length 155 [2019-09-20 13:28:16,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,804 INFO L475 AbstractCegarLoop]: Abstraction has 819 states and 1219 transitions. [2019-09-20 13:28:16,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,805 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1219 transitions. [2019-09-20 13:28:16,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-20 13:28:16,808 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,808 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:16,809 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,809 INFO L82 PathProgramCache]: Analyzing trace with hash 440643483, now seen corresponding path program 1 times [2019-09-20 13:28:16,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:16,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:16,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:16,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:16,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:16,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:16,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,948 INFO L87 Difference]: Start difference. First operand 819 states and 1219 transitions. Second operand 4 states. [2019-09-20 13:28:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:17,310 INFO L93 Difference]: Finished difference Result 915 states and 1351 transitions. [2019-09-20 13:28:17,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:17,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-20 13:28:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:17,315 INFO L225 Difference]: With dead ends: 915 [2019-09-20 13:28:17,315 INFO L226 Difference]: Without dead ends: 915 [2019-09-20 13:28:17,316 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-09-20 13:28:17,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 819. [2019-09-20 13:28:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-09-20 13:28:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1216 transitions. [2019-09-20 13:28:17,329 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1216 transitions. Word has length 156 [2019-09-20 13:28:17,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:17,330 INFO L475 AbstractCegarLoop]: Abstraction has 819 states and 1216 transitions. [2019-09-20 13:28:17,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:17,330 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1216 transitions. [2019-09-20 13:28:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-20 13:28:17,332 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:17,332 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:17,333 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:17,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:17,333 INFO L82 PathProgramCache]: Analyzing trace with hash 466022143, now seen corresponding path program 1 times [2019-09-20 13:28:17,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:17,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:17,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:17,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:17,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:17,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:17,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:17,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:17,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,424 INFO L87 Difference]: Start difference. First operand 819 states and 1216 transitions. Second operand 4 states. [2019-09-20 13:28:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:17,749 INFO L93 Difference]: Finished difference Result 915 states and 1348 transitions. [2019-09-20 13:28:17,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:17,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-20 13:28:17,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:17,757 INFO L225 Difference]: With dead ends: 915 [2019-09-20 13:28:17,757 INFO L226 Difference]: Without dead ends: 915 [2019-09-20 13:28:17,757 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-09-20 13:28:17,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 819. [2019-09-20 13:28:17,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-09-20 13:28:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1213 transitions. [2019-09-20 13:28:17,770 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1213 transitions. Word has length 157 [2019-09-20 13:28:17,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:17,771 INFO L475 AbstractCegarLoop]: Abstraction has 819 states and 1213 transitions. [2019-09-20 13:28:17,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:17,771 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1213 transitions. [2019-09-20 13:28:17,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-20 13:28:17,773 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:17,773 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:17,773 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:17,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:17,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1777444000, now seen corresponding path program 1 times [2019-09-20 13:28:17,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:17,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:17,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:17,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:17,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:17,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:17,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:17,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:17,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,863 INFO L87 Difference]: Start difference. First operand 819 states and 1213 transitions. Second operand 4 states. [2019-09-20 13:28:18,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,175 INFO L93 Difference]: Finished difference Result 885 states and 1309 transitions. [2019-09-20 13:28:18,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:18,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-20 13:28:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:18,179 INFO L225 Difference]: With dead ends: 885 [2019-09-20 13:28:18,180 INFO L226 Difference]: Without dead ends: 885 [2019-09-20 13:28:18,180 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2019-09-20 13:28:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 819. [2019-09-20 13:28:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-09-20 13:28:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1210 transitions. [2019-09-20 13:28:18,191 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1210 transitions. Word has length 158 [2019-09-20 13:28:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:18,192 INFO L475 AbstractCegarLoop]: Abstraction has 819 states and 1210 transitions. [2019-09-20 13:28:18,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:18,192 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1210 transitions. [2019-09-20 13:28:18,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-20 13:28:18,194 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:18,194 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:18,194 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:18,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:18,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1065027834, now seen corresponding path program 1 times [2019-09-20 13:28:18,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:18,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:18,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,272 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:18,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:18,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:18,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:18,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,274 INFO L87 Difference]: Start difference. First operand 819 states and 1210 transitions. Second operand 4 states. [2019-09-20 13:28:18,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,582 INFO L93 Difference]: Finished difference Result 885 states and 1306 transitions. [2019-09-20 13:28:18,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:18,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-20 13:28:18,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:18,587 INFO L225 Difference]: With dead ends: 885 [2019-09-20 13:28:18,588 INFO L226 Difference]: Without dead ends: 885 [2019-09-20 13:28:18,588 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:18,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2019-09-20 13:28:18,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 819. [2019-09-20 13:28:18,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-09-20 13:28:18,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1207 transitions. [2019-09-20 13:28:18,599 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1207 transitions. Word has length 162 [2019-09-20 13:28:18,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:18,599 INFO L475 AbstractCegarLoop]: Abstraction has 819 states and 1207 transitions. [2019-09-20 13:28:18,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1207 transitions. [2019-09-20 13:28:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-20 13:28:18,601 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:18,602 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:18,602 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:18,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:18,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1863990759, now seen corresponding path program 1 times [2019-09-20 13:28:18,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:18,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:18,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:18,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:18,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:18,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:18,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,694 INFO L87 Difference]: Start difference. First operand 819 states and 1207 transitions. Second operand 4 states. [2019-09-20 13:28:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,994 INFO L93 Difference]: Finished difference Result 870 states and 1282 transitions. [2019-09-20 13:28:18,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:19,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-20 13:28:19,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,004 INFO L225 Difference]: With dead ends: 870 [2019-09-20 13:28:19,004 INFO L226 Difference]: Without dead ends: 870 [2019-09-20 13:28:19,005 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:19,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-09-20 13:28:19,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 819. [2019-09-20 13:28:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-09-20 13:28:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1204 transitions. [2019-09-20 13:28:19,017 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1204 transitions. Word has length 163 [2019-09-20 13:28:19,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,017 INFO L475 AbstractCegarLoop]: Abstraction has 819 states and 1204 transitions. [2019-09-20 13:28:19,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1204 transitions. [2019-09-20 13:28:19,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-20 13:28:19,020 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,021 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:19,021 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1440848518, now seen corresponding path program 1 times [2019-09-20 13:28:19,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-20 13:28:19,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:19,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:19,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:19,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:19,167 INFO L87 Difference]: Start difference. First operand 819 states and 1204 transitions. Second operand 3 states. [2019-09-20 13:28:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,246 INFO L93 Difference]: Finished difference Result 1083 states and 1594 transitions. [2019-09-20 13:28:19,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:19,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-20 13:28:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,253 INFO L225 Difference]: With dead ends: 1083 [2019-09-20 13:28:19,253 INFO L226 Difference]: Without dead ends: 1083 [2019-09-20 13:28:19,253 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:19,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-09-20 13:28:19,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2019-09-20 13:28:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-09-20 13:28:19,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1594 transitions. [2019-09-20 13:28:19,272 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1594 transitions. Word has length 165 [2019-09-20 13:28:19,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,272 INFO L475 AbstractCegarLoop]: Abstraction has 1083 states and 1594 transitions. [2019-09-20 13:28:19,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1594 transitions. [2019-09-20 13:28:19,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-20 13:28:19,275 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,275 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:19,276 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1020894241, now seen corresponding path program 1 times [2019-09-20 13:28:19,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-20 13:28:19,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:19,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:19,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:19,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:19,362 INFO L87 Difference]: Start difference. First operand 1083 states and 1594 transitions. Second operand 3 states. [2019-09-20 13:28:19,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,421 INFO L93 Difference]: Finished difference Result 1347 states and 1985 transitions. [2019-09-20 13:28:19,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:19,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-20 13:28:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,428 INFO L225 Difference]: With dead ends: 1347 [2019-09-20 13:28:19,428 INFO L226 Difference]: Without dead ends: 1347 [2019-09-20 13:28:19,429 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:19,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2019-09-20 13:28:19,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1347. [2019-09-20 13:28:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-09-20 13:28:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1985 transitions. [2019-09-20 13:28:19,448 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1985 transitions. Word has length 171 [2019-09-20 13:28:19,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,448 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 1985 transitions. [2019-09-20 13:28:19,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1985 transitions. [2019-09-20 13:28:19,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-20 13:28:19,451 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,451 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:19,452 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,452 INFO L82 PathProgramCache]: Analyzing trace with hash 579555470, now seen corresponding path program 1 times [2019-09-20 13:28:19,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-20 13:28:19,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:19,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:19,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:19,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:19,557 INFO L87 Difference]: Start difference. First operand 1347 states and 1985 transitions. Second operand 3 states. [2019-09-20 13:28:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,623 INFO L93 Difference]: Finished difference Result 1611 states and 2377 transitions. [2019-09-20 13:28:19,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:19,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-09-20 13:28:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,631 INFO L225 Difference]: With dead ends: 1611 [2019-09-20 13:28:19,631 INFO L226 Difference]: Without dead ends: 1611 [2019-09-20 13:28:19,632 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2019-09-20 13:28:19,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1611. [2019-09-20 13:28:19,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2019-09-20 13:28:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2377 transitions. [2019-09-20 13:28:19,653 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2377 transitions. Word has length 203 [2019-09-20 13:28:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,654 INFO L475 AbstractCegarLoop]: Abstraction has 1611 states and 2377 transitions. [2019-09-20 13:28:19,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2377 transitions. [2019-09-20 13:28:19,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-20 13:28:19,659 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,659 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:19,659 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,660 INFO L82 PathProgramCache]: Analyzing trace with hash -634035208, now seen corresponding path program 1 times [2019-09-20 13:28:19,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-20 13:28:19,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:19,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:19,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:19,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:19,777 INFO L87 Difference]: Start difference. First operand 1611 states and 2377 transitions. Second operand 3 states. [2019-09-20 13:28:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,834 INFO L93 Difference]: Finished difference Result 1875 states and 2770 transitions. [2019-09-20 13:28:19,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:19,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-09-20 13:28:19,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,843 INFO L225 Difference]: With dead ends: 1875 [2019-09-20 13:28:19,843 INFO L226 Difference]: Without dead ends: 1875 [2019-09-20 13:28:19,843 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:19,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2019-09-20 13:28:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1875. [2019-09-20 13:28:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-09-20 13:28:19,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2770 transitions. [2019-09-20 13:28:19,867 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2770 transitions. Word has length 205 [2019-09-20 13:28:19,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,868 INFO L475 AbstractCegarLoop]: Abstraction has 1875 states and 2770 transitions. [2019-09-20 13:28:19,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:19,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2770 transitions. [2019-09-20 13:28:19,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-20 13:28:19,872 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,872 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:19,873 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2918300, now seen corresponding path program 1 times [2019-09-20 13:28:19,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-20 13:28:19,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:19,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:19,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:19,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:19,986 INFO L87 Difference]: Start difference. First operand 1875 states and 2770 transitions. Second operand 3 states. [2019-09-20 13:28:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:20,043 INFO L93 Difference]: Finished difference Result 2139 states and 3164 transitions. [2019-09-20 13:28:20,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:20,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-09-20 13:28:20,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:20,050 INFO L225 Difference]: With dead ends: 2139 [2019-09-20 13:28:20,051 INFO L226 Difference]: Without dead ends: 2139 [2019-09-20 13:28:20,051 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:20,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2019-09-20 13:28:20,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2019-09-20 13:28:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2139 states. [2019-09-20 13:28:20,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 3164 transitions. [2019-09-20 13:28:20,079 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 3164 transitions. Word has length 238 [2019-09-20 13:28:20,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:20,079 INFO L475 AbstractCegarLoop]: Abstraction has 2139 states and 3164 transitions. [2019-09-20 13:28:20,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:20,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 3164 transitions. [2019-09-20 13:28:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-20 13:28:20,084 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:20,084 INFO L407 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:20,084 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:20,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:20,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1417777216, now seen corresponding path program 1 times [2019-09-20 13:28:20,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:20,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:20,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:20,264 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-20 13:28:20,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:20,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:20,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:20,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:20,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:20,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:20,265 INFO L87 Difference]: Start difference. First operand 2139 states and 3164 transitions. Second operand 3 states. [2019-09-20 13:28:20,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:20,325 INFO L93 Difference]: Finished difference Result 2398 states and 3543 transitions. [2019-09-20 13:28:20,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:20,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 273 [2019-09-20 13:28:20,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:20,331 INFO L225 Difference]: With dead ends: 2398 [2019-09-20 13:28:20,331 INFO L226 Difference]: Without dead ends: 2398 [2019-09-20 13:28:20,332 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:20,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2019-09-20 13:28:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2398. [2019-09-20 13:28:20,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2398 states. [2019-09-20 13:28:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 3543 transitions. [2019-09-20 13:28:20,360 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 3543 transitions. Word has length 273 [2019-09-20 13:28:20,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:20,360 INFO L475 AbstractCegarLoop]: Abstraction has 2398 states and 3543 transitions. [2019-09-20 13:28:20,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 3543 transitions. [2019-09-20 13:28:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-20 13:28:20,366 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:20,366 INFO L407 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:20,366 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:20,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:20,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1049258773, now seen corresponding path program 1 times [2019-09-20 13:28:20,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:20,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:20,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:20,521 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2019-09-20 13:28:20,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:20,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:20,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:20,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:20,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:20,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:20,523 INFO L87 Difference]: Start difference. First operand 2398 states and 3543 transitions. Second operand 3 states. [2019-09-20 13:28:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:20,616 INFO L93 Difference]: Finished difference Result 2662 states and 3939 transitions. [2019-09-20 13:28:20,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:20,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-20 13:28:20,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:20,626 INFO L225 Difference]: With dead ends: 2662 [2019-09-20 13:28:20,626 INFO L226 Difference]: Without dead ends: 2662 [2019-09-20 13:28:20,627 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:20,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2019-09-20 13:28:20,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2662. [2019-09-20 13:28:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2662 states. [2019-09-20 13:28:20,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 3939 transitions. [2019-09-20 13:28:20,673 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 3939 transitions. Word has length 312 [2019-09-20 13:28:20,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:20,673 INFO L475 AbstractCegarLoop]: Abstraction has 2662 states and 3939 transitions. [2019-09-20 13:28:20,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:20,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3939 transitions. [2019-09-20 13:28:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-20 13:28:20,681 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:20,682 INFO L407 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:20,682 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:20,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:20,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1852087659, now seen corresponding path program 1 times [2019-09-20 13:28:20,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:20,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:20,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:20,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2019-09-20 13:28:20,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:20,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:20,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:20,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:20,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:20,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:20,934 INFO L87 Difference]: Start difference. First operand 2662 states and 3939 transitions. Second operand 3 states. [2019-09-20 13:28:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:20,998 INFO L93 Difference]: Finished difference Result 2926 states and 4336 transitions. [2019-09-20 13:28:20,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:20,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2019-09-20 13:28:21,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:21,006 INFO L225 Difference]: With dead ends: 2926 [2019-09-20 13:28:21,007 INFO L226 Difference]: Without dead ends: 2926 [2019-09-20 13:28:21,007 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:21,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2019-09-20 13:28:21,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 2926. [2019-09-20 13:28:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2926 states. [2019-09-20 13:28:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4336 transitions. [2019-09-20 13:28:21,041 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4336 transitions. Word has length 353 [2019-09-20 13:28:21,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:21,042 INFO L475 AbstractCegarLoop]: Abstraction has 2926 states and 4336 transitions. [2019-09-20 13:28:21,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:21,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4336 transitions. [2019-09-20 13:28:21,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-20 13:28:21,048 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:21,048 INFO L407 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:21,049 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:21,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:21,049 INFO L82 PathProgramCache]: Analyzing trace with hash -171306805, now seen corresponding path program 1 times [2019-09-20 13:28:21,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:21,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:21,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 717 proven. 0 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2019-09-20 13:28:21,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:21,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:21,325 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:21,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:21,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:21,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:21,326 INFO L87 Difference]: Start difference. First operand 2926 states and 4336 transitions. Second operand 4 states. [2019-09-20 13:28:21,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:21,791 INFO L93 Difference]: Finished difference Result 4080 states and 6085 transitions. [2019-09-20 13:28:21,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:21,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2019-09-20 13:28:21,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:21,800 INFO L225 Difference]: With dead ends: 4080 [2019-09-20 13:28:21,800 INFO L226 Difference]: Without dead ends: 4080 [2019-09-20 13:28:21,800 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:21,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4080 states. [2019-09-20 13:28:21,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4080 to 3377. [2019-09-20 13:28:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2019-09-20 13:28:21,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 5161 transitions. [2019-09-20 13:28:21,844 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 5161 transitions. Word has length 396 [2019-09-20 13:28:21,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:21,845 INFO L475 AbstractCegarLoop]: Abstraction has 3377 states and 5161 transitions. [2019-09-20 13:28:21,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:21,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 5161 transitions. [2019-09-20 13:28:21,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-20 13:28:21,853 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:21,854 INFO L407 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:21,854 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:21,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:21,855 INFO L82 PathProgramCache]: Analyzing trace with hash 775731081, now seen corresponding path program 1 times [2019-09-20 13:28:21,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:21,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:21,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 366 proven. 924 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-20 13:28:23,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:28:23,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:28:23,929 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 397 with the following transitions: [2019-09-20 13:28:23,931 INFO L207 CegarAbsIntRunner]: [0], [43], [48], [50], [61], [63], [67], [76], [78], [83], [88], [93], [98], [103], [108], [113], [118], [121], [123], [128], [133], [136], [138], [143], [146], [148], [153], [156], [158], [163], [166], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [213], [218], [221], [223], [228], [231], [233], [238], [241], [312], [315], [323], [325], [328], [336], [341], [343], [345], [350], [353], [361], [363], [365], [368], [372], [375], [404], [407], [415], [425], [427], [430], [441], [443], [453], [455], [458], [466], [492], [495], [503], [508], [511], [519], [522], [525], [533], [535], [538], [546], [548], [551], [553], [556], [564], [569], [571], [573], [578], [581], [589], [594], [596], [599], [607], [610], [614], [635], [669], [671], [683], [686], [687], [699], [707], [708], [709] [2019-09-20 13:28:23,973 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:28:23,974 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:28:24,026 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-20 13:28:24,028 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-20 13:28:24,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:24,032 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-20 13:28:24,130 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-20 13:28:24,130 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-20 13:28:24,140 INFO L420 sIntCurrentIteration]: We unified 395 AI predicates to 395 [2019-09-20 13:28:24,140 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-20 13:28:24,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:28:24,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [16] total 16 [2019-09-20 13:28:24,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:24,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:28:24,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:28:24,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:28:24,143 INFO L87 Difference]: Start difference. First operand 3377 states and 5161 transitions. Second operand 2 states. [2019-09-20 13:28:24,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:24,143 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-20 13:28:24,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:28:24,144 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 396 [2019-09-20 13:28:24,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:24,144 INFO L225 Difference]: With dead ends: 2 [2019-09-20 13:28:24,144 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:28:24,144 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 395 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-20 13:28:24,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:28:24,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:28:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:28:24,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:28:24,145 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 396 [2019-09-20 13:28:24,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:24,145 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:28:24,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:28:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:28:24,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:28:24,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:28:24 BoogieIcfgContainer [2019-09-20 13:28:24,151 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:28:24,154 INFO L168 Benchmark]: Toolchain (without parser) took 29895.16 ms. Allocated memory was 129.0 MB in the beginning and 698.4 MB in the end (delta: 569.4 MB). Free memory was 82.1 MB in the beginning and 109.6 MB in the end (delta: -27.6 MB). Peak memory consumption was 541.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:28:24,155 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 129.0 MB. Free memory was 103.1 MB in the beginning and 102.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:28:24,155 INFO L168 Benchmark]: CACSL2BoogieTranslator took 892.21 ms. Allocated memory was 129.0 MB in the beginning and 197.7 MB in the end (delta: 68.7 MB). Free memory was 81.6 MB in the beginning and 152.8 MB in the end (delta: -71.1 MB). Peak memory consumption was 29.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:28:24,156 INFO L168 Benchmark]: Boogie Preprocessor took 242.79 ms. Allocated memory is still 197.7 MB. Free memory was 152.8 MB in the beginning and 144.4 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 7.1 GB. [2019-09-20 13:28:24,157 INFO L168 Benchmark]: RCFGBuilder took 1594.79 ms. Allocated memory was 197.7 MB in the beginning and 213.4 MB in the end (delta: 15.7 MB). Free memory was 144.4 MB in the beginning and 159.2 MB in the end (delta: -14.8 MB). Peak memory consumption was 88.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:28:24,157 INFO L168 Benchmark]: TraceAbstraction took 27158.99 ms. Allocated memory was 213.4 MB in the beginning and 698.4 MB in the end (delta: 485.0 MB). Free memory was 159.2 MB in the beginning and 109.6 MB in the end (delta: 49.6 MB). Peak memory consumption was 534.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:28:24,160 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 129.0 MB. Free memory was 103.1 MB in the beginning and 102.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 892.21 ms. Allocated memory was 129.0 MB in the beginning and 197.7 MB in the end (delta: 68.7 MB). Free memory was 81.6 MB in the beginning and 152.8 MB in the end (delta: -71.1 MB). Peak memory consumption was 29.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 242.79 ms. Allocated memory is still 197.7 MB. Free memory was 152.8 MB in the beginning and 144.4 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1594.79 ms. Allocated memory was 197.7 MB in the beginning and 213.4 MB in the end (delta: 15.7 MB). Free memory was 144.4 MB in the beginning and 159.2 MB in the end (delta: -14.8 MB). Peak memory consumption was 88.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27158.99 ms. Allocated memory was 213.4 MB in the beginning and 698.4 MB in the end (delta: 485.0 MB). Free memory was 159.2 MB in the beginning and 109.6 MB in the end (delta: 49.6 MB). Peak memory consumption was 534.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1742]: 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, 189 locations, 1 error locations. SAFE Result, 27.0s OverallTime, 58 OverallIterations, 12 TraceHistogramMax, 17.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12616 SDtfs, 4300 SDslu, 16519 SDs, 0 SdLazy, 9420 SolverSat, 544 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 706 GetRequests, 523 SyntacticMatches, 37 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3377occurred in iteration=57, 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.2050632911392405 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 58 MinimizatonAttempts, 2580 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 7529 NumberOfCodeBlocks, 7529 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 7471 ConstructedInterpolants, 0 QuantifiedInterpolants, 4929886 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 58 InterpolantComputations, 57 PerfectInterpolantSequences, 10071/10995 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...