java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_srvr.blast.09.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:05:31,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:05:31,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:05:31,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:05:31,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:05:31,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:05:31,137 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:05:31,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:05:31,149 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:05:31,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:05:31,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:05:31,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:05:31,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:05:31,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:05:31,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:05:31,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:05:31,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:05:31,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:05:31,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:05:31,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:05:31,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:05:31,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:05:31,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:05:31,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:05:31,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:05:31,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:05:31,168 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:05:31,169 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:05:31,170 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:05:31,171 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:05:31,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:05:31,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:05:31,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:05:31,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:05:31,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:05:31,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:05:31,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:05:31,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:05:31,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:05:31,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:05:31,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:05:31,179 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-16 17:05:31,201 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:05:31,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:05:31,202 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:05:31,202 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:05:31,203 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:05:31,203 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:05:31,203 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:05:31,203 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:05:31,204 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:05:31,204 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:05:31,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:05:31,207 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:05:31,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:05:31,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:05:31,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:05:31,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:05:31,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:05:31,209 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:05:31,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:05:31,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:05:31,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:05:31,210 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:05:31,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:05:31,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:05:31,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:05:31,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:05:31,211 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:05:31,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:05:31,212 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:05:31,212 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:05:31,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:05:31,288 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:05:31,292 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:05:31,293 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:05:31,294 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:05:31,295 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.09.i.cil-2.c [2019-09-16 17:05:31,375 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5424105fc/5119dc22ead24dc79a14fc05ae99d5a8/FLAGe341d665e [2019-09-16 17:05:31,985 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:05:31,986 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.09.i.cil-2.c [2019-09-16 17:05:32,022 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5424105fc/5119dc22ead24dc79a14fc05ae99d5a8/FLAGe341d665e [2019-09-16 17:05:32,221 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5424105fc/5119dc22ead24dc79a14fc05ae99d5a8 [2019-09-16 17:05:32,238 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:05:32,240 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:05:32,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:05:32,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:05:32,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:05:32,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:05:32" (1/1) ... [2019-09-16 17:05:32,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74d4930b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:32, skipping insertion in model container [2019-09-16 17:05:32,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:05:32" (1/1) ... [2019-09-16 17:05:32,264 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:05:32,363 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:05:33,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:05:33,119 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:05:33,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:05:33,357 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:05:33,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:33 WrapperNode [2019-09-16 17:05:33,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:05:33,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:05:33,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:05:33,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:05:33,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:33" (1/1) ... [2019-09-16 17:05:33,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:33" (1/1) ... [2019-09-16 17:05:33,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:33" (1/1) ... [2019-09-16 17:05:33,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:33" (1/1) ... [2019-09-16 17:05:33,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:33" (1/1) ... [2019-09-16 17:05:33,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:33" (1/1) ... [2019-09-16 17:05:33,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:33" (1/1) ... [2019-09-16 17:05:33,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:05:33,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:05:33,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:05:33,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:05:33,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:33" (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-16 17:05:33,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:05:33,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:05:33,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-16 17:05:33,584 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-16 17:05:33,584 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:05:33,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-16 17:05:33,584 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-16 17:05:33,584 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-16 17:05:33,584 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-16 17:05:33,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:05:33,585 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 17:05:33,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 17:05:33,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:05:33,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:05:33,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:05:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-16 17:05:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-16 17:05:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-16 17:05:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-16 17:05:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-16 17:05:33,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-16 17:05:33,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:05:33,587 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:05:33,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 17:05:33,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:05:33,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:05:33,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:05:33,588 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 17:05:33,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-16 17:05:33,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:05:33,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:05:33,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:05:33,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:05:33,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:05:33,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-16 17:05:33,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-16 17:05:33,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-16 17:05:33,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-16 17:05:33,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:05:34,084 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:05:34,758 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-16 17:05:34,759 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-16 17:05:34,779 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:05:34,780 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:05:34,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:05:34 BoogieIcfgContainer [2019-09-16 17:05:34,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:05:34,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:05:34,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:05:34,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:05:34,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:05:32" (1/3) ... [2019-09-16 17:05:34,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ed0f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:05:34, skipping insertion in model container [2019-09-16 17:05:34,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:33" (2/3) ... [2019-09-16 17:05:34,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ed0f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:05:34, skipping insertion in model container [2019-09-16 17:05:34,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:05:34" (3/3) ... [2019-09-16 17:05:34,790 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-2.c [2019-09-16 17:05:34,800 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:05:34,810 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:05:34,829 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:05:34,858 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:05:34,859 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:05:34,859 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:05:34,859 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:05:34,859 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:05:34,859 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:05:34,860 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:05:34,860 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:05:34,884 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2019-09-16 17:05:34,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-16 17:05:34,897 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:34,898 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:34,901 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:34,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:34,906 INFO L82 PathProgramCache]: Analyzing trace with hash 514312201, now seen corresponding path program 1 times [2019-09-16 17:05:34,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:34,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:34,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:35,331 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-16 17:05:35,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:35,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:35,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:35,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:35,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:35,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:35,366 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2019-09-16 17:05:35,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:35,857 INFO L93 Difference]: Finished difference Result 190 states and 310 transitions. [2019-09-16 17:05:35,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:35,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-16 17:05:35,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:35,879 INFO L225 Difference]: With dead ends: 190 [2019-09-16 17:05:35,879 INFO L226 Difference]: Without dead ends: 169 [2019-09-16 17:05:35,882 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-16 17:05:35,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-16 17:05:35,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-16 17:05:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-16 17:05:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2019-09-16 17:05:35,931 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 41 [2019-09-16 17:05:35,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:35,932 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2019-09-16 17:05:35,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2019-09-16 17:05:35,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-16 17:05:35,935 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:35,936 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:35,936 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:35,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:35,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1818416469, now seen corresponding path program 1 times [2019-09-16 17:05:35,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:35,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:35,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:36,103 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-16 17:05:36,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:36,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:36,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:36,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:36,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:36,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:36,108 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2019-09-16 17:05:36,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:36,584 INFO L93 Difference]: Finished difference Result 169 states and 252 transitions. [2019-09-16 17:05:36,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:36,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-09-16 17:05:36,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:36,589 INFO L225 Difference]: With dead ends: 169 [2019-09-16 17:05:36,589 INFO L226 Difference]: Without dead ends: 169 [2019-09-16 17:05:36,590 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-16 17:05:36,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-16 17:05:36,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-16 17:05:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-16 17:05:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2019-09-16 17:05:36,615 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 54 [2019-09-16 17:05:36,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:36,616 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2019-09-16 17:05:36,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:36,617 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2019-09-16 17:05:36,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-16 17:05:36,622 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:36,622 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:36,623 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:36,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:36,623 INFO L82 PathProgramCache]: Analyzing trace with hash 737556739, now seen corresponding path program 1 times [2019-09-16 17:05:36,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:36,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:36,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:36,795 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-16 17:05:36,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:36,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:36,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:36,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:36,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:36,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:36,797 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 4 states. [2019-09-16 17:05:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:37,146 INFO L93 Difference]: Finished difference Result 168 states and 250 transitions. [2019-09-16 17:05:37,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:37,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-16 17:05:37,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:37,148 INFO L225 Difference]: With dead ends: 168 [2019-09-16 17:05:37,148 INFO L226 Difference]: Without dead ends: 168 [2019-09-16 17:05:37,149 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-16 17:05:37,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-16 17:05:37,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 152. [2019-09-16 17:05:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-16 17:05:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 230 transitions. [2019-09-16 17:05:37,158 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 230 transitions. Word has length 55 [2019-09-16 17:05:37,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:37,158 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 230 transitions. [2019-09-16 17:05:37,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:37,159 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 230 transitions. [2019-09-16 17:05:37,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-16 17:05:37,161 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:37,161 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:37,162 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:37,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:37,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1603135895, now seen corresponding path program 1 times [2019-09-16 17:05:37,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:37,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:37,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:37,287 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-16 17:05:37,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:37,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:05:37,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:37,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:05:37,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:05:37,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:37,289 INFO L87 Difference]: Start difference. First operand 152 states and 230 transitions. Second operand 5 states. [2019-09-16 17:05:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:37,811 INFO L93 Difference]: Finished difference Result 173 states and 258 transitions. [2019-09-16 17:05:37,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:05:37,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-16 17:05:37,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:37,814 INFO L225 Difference]: With dead ends: 173 [2019-09-16 17:05:37,814 INFO L226 Difference]: Without dead ends: 173 [2019-09-16 17:05:37,815 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-16 17:05:37,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-16 17:05:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-09-16 17:05:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2019-09-16 17:05:37,823 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 55 [2019-09-16 17:05:37,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:37,824 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2019-09-16 17:05:37,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:05:37,824 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2019-09-16 17:05:37,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-16 17:05:37,826 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:37,826 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:37,826 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:37,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:37,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1781246799, now seen corresponding path program 1 times [2019-09-16 17:05:37,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:37,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:37,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:37,966 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-16 17:05:37,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:37,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:37,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:37,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:37,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:37,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:37,969 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2019-09-16 17:05:38,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:38,286 INFO L93 Difference]: Finished difference Result 187 states and 274 transitions. [2019-09-16 17:05:38,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:38,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-16 17:05:38,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:38,288 INFO L225 Difference]: With dead ends: 187 [2019-09-16 17:05:38,288 INFO L226 Difference]: Without dead ends: 187 [2019-09-16 17:05:38,289 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-16 17:05:38,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-16 17:05:38,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2019-09-16 17:05:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2019-09-16 17:05:38,297 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 55 [2019-09-16 17:05:38,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:38,298 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2019-09-16 17:05:38,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2019-09-16 17:05:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-16 17:05:38,300 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:38,300 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:38,300 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:38,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:38,301 INFO L82 PathProgramCache]: Analyzing trace with hash -870189042, now seen corresponding path program 1 times [2019-09-16 17:05:38,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:38,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:38,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:38,370 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-16 17:05:38,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:38,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:38,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:38,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:38,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:38,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:38,372 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2019-09-16 17:05:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:38,687 INFO L93 Difference]: Finished difference Result 185 states and 271 transitions. [2019-09-16 17:05:38,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:38,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-16 17:05:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:38,689 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:05:38,690 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:05:38,690 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-16 17:05:38,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:05:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:05:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2019-09-16 17:05:38,698 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 55 [2019-09-16 17:05:38,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:38,699 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2019-09-16 17:05:38,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:38,699 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2019-09-16 17:05:38,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-16 17:05:38,701 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:38,702 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:38,702 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:38,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:38,702 INFO L82 PathProgramCache]: Analyzing trace with hash 987281320, now seen corresponding path program 1 times [2019-09-16 17:05:38,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:38,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:38,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:38,779 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-16 17:05:38,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:38,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:38,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:38,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:38,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:38,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:38,782 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand 4 states. [2019-09-16 17:05:39,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:39,072 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2019-09-16 17:05:39,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:39,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-09-16 17:05:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:39,074 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:05:39,075 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:05:39,075 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-16 17:05:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:05:39,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:05:39,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:39,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 254 transitions. [2019-09-16 17:05:39,081 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 254 transitions. Word has length 56 [2019-09-16 17:05:39,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:39,081 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 254 transitions. [2019-09-16 17:05:39,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:39,082 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 254 transitions. [2019-09-16 17:05:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-16 17:05:39,083 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:39,083 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:39,083 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:39,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:39,084 INFO L82 PathProgramCache]: Analyzing trace with hash -365258357, now seen corresponding path program 1 times [2019-09-16 17:05:39,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:39,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:39,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:39,143 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-16 17:05:39,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:39,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:39,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:39,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:39,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:39,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:39,145 INFO L87 Difference]: Start difference. First operand 172 states and 254 transitions. Second operand 4 states. [2019-09-16 17:05:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:39,432 INFO L93 Difference]: Finished difference Result 185 states and 269 transitions. [2019-09-16 17:05:39,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:39,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-09-16 17:05:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:39,434 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:05:39,434 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:05:39,434 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-16 17:05:39,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:05:39,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:05:39,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:39,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2019-09-16 17:05:39,442 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 57 [2019-09-16 17:05:39,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:39,443 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2019-09-16 17:05:39,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:39,443 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2019-09-16 17:05:39,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-16 17:05:39,444 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:39,444 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:39,444 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:39,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:39,445 INFO L82 PathProgramCache]: Analyzing trace with hash -626349981, now seen corresponding path program 1 times [2019-09-16 17:05:39,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:39,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:39,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:39,501 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-16 17:05:39,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:39,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:39,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:39,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:39,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:39,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:39,503 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 4 states. [2019-09-16 17:05:39,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:39,800 INFO L93 Difference]: Finished difference Result 185 states and 268 transitions. [2019-09-16 17:05:39,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:39,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-16 17:05:39,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:39,803 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:05:39,803 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:05:39,804 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-16 17:05:39,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:05:39,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:05:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 252 transitions. [2019-09-16 17:05:39,815 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 252 transitions. Word has length 58 [2019-09-16 17:05:39,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:39,816 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 252 transitions. [2019-09-16 17:05:39,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 252 transitions. [2019-09-16 17:05:39,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-16 17:05:39,818 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:39,818 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:39,819 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:39,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:39,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1341820354, now seen corresponding path program 1 times [2019-09-16 17:05:39,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:39,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:39,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:39,943 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-16 17:05:39,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:39,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:39,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:39,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:39,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:39,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:39,945 INFO L87 Difference]: Start difference. First operand 172 states and 252 transitions. Second operand 4 states. [2019-09-16 17:05:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:40,369 INFO L93 Difference]: Finished difference Result 214 states and 314 transitions. [2019-09-16 17:05:40,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:40,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-16 17:05:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:40,373 INFO L225 Difference]: With dead ends: 214 [2019-09-16 17:05:40,373 INFO L226 Difference]: Without dead ends: 214 [2019-09-16 17:05:40,374 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-16 17:05:40,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-16 17:05:40,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-16 17:05:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2019-09-16 17:05:40,382 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 58 [2019-09-16 17:05:40,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:40,382 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2019-09-16 17:05:40,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2019-09-16 17:05:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-16 17:05:40,383 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:40,384 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:40,384 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:40,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:40,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1412290330, now seen corresponding path program 1 times [2019-09-16 17:05:40,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:40,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:40,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:40,485 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-16 17:05:40,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:40,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:40,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:40,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:40,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:40,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:40,488 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 4 states. [2019-09-16 17:05:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:40,835 INFO L93 Difference]: Finished difference Result 197 states and 292 transitions. [2019-09-16 17:05:40,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:40,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-09-16 17:05:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:40,839 INFO L225 Difference]: With dead ends: 197 [2019-09-16 17:05:40,839 INFO L226 Difference]: Without dead ends: 197 [2019-09-16 17:05:40,840 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-16 17:05:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-16 17:05:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2019-09-16 17:05:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:40,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2019-09-16 17:05:40,854 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 59 [2019-09-16 17:05:40,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:40,855 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2019-09-16 17:05:40,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:40,855 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2019-09-16 17:05:40,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-16 17:05:40,857 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:40,857 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:40,858 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:40,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:40,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2096707986, now seen corresponding path program 1 times [2019-09-16 17:05:40,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:40,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:40,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:40,960 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-16 17:05:40,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:40,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:40,961 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:40,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:40,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:40,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:40,963 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand 4 states. [2019-09-16 17:05:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:41,329 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2019-09-16 17:05:41,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:41,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-09-16 17:05:41,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:41,333 INFO L225 Difference]: With dead ends: 214 [2019-09-16 17:05:41,333 INFO L226 Difference]: Without dead ends: 214 [2019-09-16 17:05:41,334 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-16 17:05:41,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-16 17:05:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-16 17:05:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2019-09-16 17:05:41,340 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 71 [2019-09-16 17:05:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:41,340 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2019-09-16 17:05:41,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:41,341 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2019-09-16 17:05:41,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-16 17:05:41,347 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:41,347 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:41,349 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:41,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:41,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1403946680, now seen corresponding path program 1 times [2019-09-16 17:05:41,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:41,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:41,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:41,429 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-16 17:05:41,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:41,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:41,430 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:41,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:41,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:41,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:41,431 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 4 states. [2019-09-16 17:05:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:41,742 INFO L93 Difference]: Finished difference Result 213 states and 310 transitions. [2019-09-16 17:05:41,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:41,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-16 17:05:41,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:41,744 INFO L225 Difference]: With dead ends: 213 [2019-09-16 17:05:41,744 INFO L226 Difference]: Without dead ends: 213 [2019-09-16 17:05:41,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-16 17:05:41,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-16 17:05:41,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2019-09-16 17:05:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:41,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2019-09-16 17:05:41,750 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 72 [2019-09-16 17:05:41,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:41,751 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2019-09-16 17:05:41,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:41,751 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2019-09-16 17:05:41,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-16 17:05:41,752 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:41,752 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:41,752 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:41,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:41,753 INFO L82 PathProgramCache]: Analyzing trace with hash 239584775, now seen corresponding path program 1 times [2019-09-16 17:05:41,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:41,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:41,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:41,813 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-16 17:05:41,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:41,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:41,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:41,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:41,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:41,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:41,815 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand 4 states. [2019-09-16 17:05:42,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:42,085 INFO L93 Difference]: Finished difference Result 211 states and 307 transitions. [2019-09-16 17:05:42,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:42,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-16 17:05:42,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:42,088 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:05:42,088 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:05:42,088 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-16 17:05:42,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:05:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:05:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:42,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2019-09-16 17:05:42,094 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 72 [2019-09-16 17:05:42,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:42,094 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2019-09-16 17:05:42,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:42,095 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2019-09-16 17:05:42,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-16 17:05:42,096 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:42,096 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:42,096 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:42,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:42,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1030531279, now seen corresponding path program 1 times [2019-09-16 17:05:42,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:42,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:42,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:42,160 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-16 17:05:42,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:42,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:42,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:42,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:42,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:42,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:42,162 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand 4 states. [2019-09-16 17:05:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:42,431 INFO L93 Difference]: Finished difference Result 211 states and 306 transitions. [2019-09-16 17:05:42,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:42,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-16 17:05:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:42,433 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:05:42,433 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:05:42,433 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-16 17:05:42,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:05:42,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:05:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2019-09-16 17:05:42,439 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 73 [2019-09-16 17:05:42,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:42,439 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2019-09-16 17:05:42,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2019-09-16 17:05:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-16 17:05:42,440 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:42,440 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:42,441 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:42,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:42,441 INFO L82 PathProgramCache]: Analyzing trace with hash 975490372, now seen corresponding path program 1 times [2019-09-16 17:05:42,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:42,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:42,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:42,505 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-16 17:05:42,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:42,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:42,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:42,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:42,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:42,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:42,507 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 4 states. [2019-09-16 17:05:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:42,780 INFO L93 Difference]: Finished difference Result 211 states and 305 transitions. [2019-09-16 17:05:42,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:42,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-09-16 17:05:42,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:42,782 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:05:42,782 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:05:42,783 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-16 17:05:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:05:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:05:42,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:42,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2019-09-16 17:05:42,788 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 74 [2019-09-16 17:05:42,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:42,788 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2019-09-16 17:05:42,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:42,789 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2019-09-16 17:05:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-16 17:05:42,790 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:42,790 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:42,790 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:42,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:42,791 INFO L82 PathProgramCache]: Analyzing trace with hash -2012812342, now seen corresponding path program 1 times [2019-09-16 17:05:42,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:42,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:42,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:42,846 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-16 17:05:42,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:42,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:42,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:42,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:42,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:42,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:42,848 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 4 states. [2019-09-16 17:05:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:43,147 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2019-09-16 17:05:43,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:43,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-16 17:05:43,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:43,149 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:05:43,149 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:05:43,149 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-16 17:05:43,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:05:43,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:05:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2019-09-16 17:05:43,155 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 75 [2019-09-16 17:05:43,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:43,156 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2019-09-16 17:05:43,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2019-09-16 17:05:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-16 17:05:43,157 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:43,157 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:43,157 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:43,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:43,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1442950561, now seen corresponding path program 1 times [2019-09-16 17:05:43,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:43,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:43,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:43,223 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-16 17:05:43,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:43,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:43,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:43,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:43,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:43,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:43,225 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand 4 states. [2019-09-16 17:05:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:43,548 INFO L93 Difference]: Finished difference Result 201 states and 291 transitions. [2019-09-16 17:05:43,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:43,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-09-16 17:05:43,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:43,551 INFO L225 Difference]: With dead ends: 201 [2019-09-16 17:05:43,551 INFO L226 Difference]: Without dead ends: 201 [2019-09-16 17:05:43,552 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-16 17:05:43,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-16 17:05:43,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2019-09-16 17:05:43,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2019-09-16 17:05:43,559 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 76 [2019-09-16 17:05:43,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:43,560 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2019-09-16 17:05:43,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:43,560 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2019-09-16 17:05:43,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:05:43,562 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:43,562 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:43,562 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:43,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:43,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1893403063, now seen corresponding path program 1 times [2019-09-16 17:05:43,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:43,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:43,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:43,655 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-16 17:05:43,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:43,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:43,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:43,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:43,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:43,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:43,658 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 4 states. [2019-09-16 17:05:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:44,173 INFO L93 Difference]: Finished difference Result 300 states and 442 transitions. [2019-09-16 17:05:44,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:44,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:05:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:44,175 INFO L225 Difference]: With dead ends: 300 [2019-09-16 17:05:44,175 INFO L226 Difference]: Without dead ends: 300 [2019-09-16 17:05:44,176 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-16 17:05:44,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-16 17:05:44,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 224. [2019-09-16 17:05:44,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-16 17:05:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2019-09-16 17:05:44,182 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 80 [2019-09-16 17:05:44,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:44,182 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2019-09-16 17:05:44,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2019-09-16 17:05:44,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:05:44,184 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:44,184 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:44,184 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:44,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:44,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1821016505, now seen corresponding path program 1 times [2019-09-16 17:05:44,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:44,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:44,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:44,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:44,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:44,253 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-16 17:05:44,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:44,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:44,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:44,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:44,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:44,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:44,254 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand 4 states. [2019-09-16 17:05:44,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:44,668 INFO L93 Difference]: Finished difference Result 273 states and 405 transitions. [2019-09-16 17:05:44,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:44,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:05:44,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:44,672 INFO L225 Difference]: With dead ends: 273 [2019-09-16 17:05:44,672 INFO L226 Difference]: Without dead ends: 273 [2019-09-16 17:05:44,672 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-16 17:05:44,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-09-16 17:05:44,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 248. [2019-09-16 17:05:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-16 17:05:44,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2019-09-16 17:05:44,682 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 80 [2019-09-16 17:05:44,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:44,683 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2019-09-16 17:05:44,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:44,683 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2019-09-16 17:05:44,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:44,685 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:44,685 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:44,686 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:44,686 INFO L82 PathProgramCache]: Analyzing trace with hash -852863592, now seen corresponding path program 1 times [2019-09-16 17:05:44,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:44,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:44,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:44,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:44,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:44,779 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-16 17:05:44,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:44,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:44,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:44,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:44,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:44,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:44,782 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand 4 states. [2019-09-16 17:05:45,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:45,241 INFO L93 Difference]: Finished difference Result 316 states and 469 transitions. [2019-09-16 17:05:45,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:45,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:05:45,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:45,244 INFO L225 Difference]: With dead ends: 316 [2019-09-16 17:05:45,244 INFO L226 Difference]: Without dead ends: 316 [2019-09-16 17:05:45,244 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-16 17:05:45,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 249. [2019-09-16 17:05:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-16 17:05:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 374 transitions. [2019-09-16 17:05:45,254 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 374 transitions. Word has length 81 [2019-09-16 17:05:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:45,254 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 374 transitions. [2019-09-16 17:05:45,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 374 transitions. [2019-09-16 17:05:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-16 17:05:45,256 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:45,256 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:45,257 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:45,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:45,257 INFO L82 PathProgramCache]: Analyzing trace with hash 69064469, now seen corresponding path program 1 times [2019-09-16 17:05:45,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:45,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:45,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:45,358 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-16 17:05:45,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:45,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:45,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:45,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:45,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:45,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:45,360 INFO L87 Difference]: Start difference. First operand 249 states and 374 transitions. Second operand 4 states. [2019-09-16 17:05:45,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:45,863 INFO L93 Difference]: Finished difference Result 316 states and 468 transitions. [2019-09-16 17:05:45,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:45,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-16 17:05:45,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:45,866 INFO L225 Difference]: With dead ends: 316 [2019-09-16 17:05:45,867 INFO L226 Difference]: Without dead ends: 316 [2019-09-16 17:05:45,867 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-16 17:05:45,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-16 17:05:45,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 259. [2019-09-16 17:05:45,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-16 17:05:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2019-09-16 17:05:45,878 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 86 [2019-09-16 17:05:45,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:45,879 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2019-09-16 17:05:45,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:45,879 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2019-09-16 17:05:45,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-16 17:05:45,881 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:45,881 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-16 17:05:45,882 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:45,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:45,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2133991217, now seen corresponding path program 1 times [2019-09-16 17:05:45,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:45,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:45,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:45,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:45,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:45,984 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-16 17:05:45,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:45,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:45,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:45,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:45,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:45,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:45,985 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2019-09-16 17:05:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:46,386 INFO L93 Difference]: Finished difference Result 310 states and 460 transitions. [2019-09-16 17:05:46,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:46,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-16 17:05:46,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:46,394 INFO L225 Difference]: With dead ends: 310 [2019-09-16 17:05:46,395 INFO L226 Difference]: Without dead ends: 310 [2019-09-16 17:05:46,395 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-16 17:05:46,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-16 17:05:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2019-09-16 17:05:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2019-09-16 17:05:46,406 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 87 [2019-09-16 17:05:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:46,407 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2019-09-16 17:05:46,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2019-09-16 17:05:46,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-16 17:05:46,408 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:46,408 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:46,409 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:46,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:46,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2126867523, now seen corresponding path program 1 times [2019-09-16 17:05:46,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:46,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:46,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:46,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:46,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:46,479 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-16 17:05:46,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:46,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:46,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:46,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:46,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:46,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:46,483 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2019-09-16 17:05:46,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:46,890 INFO L93 Difference]: Finished difference Result 310 states and 459 transitions. [2019-09-16 17:05:46,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:46,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-16 17:05:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:46,892 INFO L225 Difference]: With dead ends: 310 [2019-09-16 17:05:46,892 INFO L226 Difference]: Without dead ends: 310 [2019-09-16 17:05:46,893 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-16 17:05:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-16 17:05:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2019-09-16 17:05:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2019-09-16 17:05:46,900 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 93 [2019-09-16 17:05:46,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:46,901 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2019-09-16 17:05:46,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2019-09-16 17:05:46,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-16 17:05:46,902 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:46,902 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:46,903 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:46,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:46,903 INFO L82 PathProgramCache]: Analyzing trace with hash -198594821, now seen corresponding path program 1 times [2019-09-16 17:05:46,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:46,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:46,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:46,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:46,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:46,968 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-16 17:05:46,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:46,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:46,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:46,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:46,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:46,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:46,970 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2019-09-16 17:05:47,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:47,390 INFO L93 Difference]: Finished difference Result 285 states and 424 transitions. [2019-09-16 17:05:47,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:47,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-16 17:05:47,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:47,393 INFO L225 Difference]: With dead ends: 285 [2019-09-16 17:05:47,393 INFO L226 Difference]: Without dead ends: 285 [2019-09-16 17:05:47,394 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-16 17:05:47,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-16 17:05:47,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2019-09-16 17:05:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2019-09-16 17:05:47,403 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 93 [2019-09-16 17:05:47,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:47,403 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2019-09-16 17:05:47,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:47,403 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2019-09-16 17:05:47,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-16 17:05:47,405 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:47,405 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:47,405 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:47,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:47,406 INFO L82 PathProgramCache]: Analyzing trace with hash 809198717, now seen corresponding path program 1 times [2019-09-16 17:05:47,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:47,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:47,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:47,482 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-16 17:05:47,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:47,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:47,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:47,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:47,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:47,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:47,486 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2019-09-16 17:05:47,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:47,874 INFO L93 Difference]: Finished difference Result 309 states and 456 transitions. [2019-09-16 17:05:47,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:47,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-16 17:05:47,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:47,876 INFO L225 Difference]: With dead ends: 309 [2019-09-16 17:05:47,876 INFO L226 Difference]: Without dead ends: 309 [2019-09-16 17:05:47,877 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-16 17:05:47,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-16 17:05:47,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 260. [2019-09-16 17:05:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2019-09-16 17:05:47,884 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 94 [2019-09-16 17:05:47,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:47,884 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2019-09-16 17:05:47,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2019-09-16 17:05:47,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-16 17:05:47,886 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:47,886 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:47,886 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:47,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:47,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1842237124, now seen corresponding path program 1 times [2019-09-16 17:05:47,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:47,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:47,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:47,962 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-16 17:05:47,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:47,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:47,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:47,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:47,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:47,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:47,964 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2019-09-16 17:05:48,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:48,322 INFO L93 Difference]: Finished difference Result 307 states and 453 transitions. [2019-09-16 17:05:48,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:48,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-16 17:05:48,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:48,325 INFO L225 Difference]: With dead ends: 307 [2019-09-16 17:05:48,325 INFO L226 Difference]: Without dead ends: 307 [2019-09-16 17:05:48,325 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-16 17:05:48,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-16 17:05:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-16 17:05:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2019-09-16 17:05:48,332 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 94 [2019-09-16 17:05:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:48,333 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2019-09-16 17:05:48,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:48,333 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2019-09-16 17:05:48,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-16 17:05:48,334 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:48,334 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:48,334 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:48,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:48,335 INFO L82 PathProgramCache]: Analyzing trace with hash 456110335, now seen corresponding path program 1 times [2019-09-16 17:05:48,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:48,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:48,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:48,406 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-16 17:05:48,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:48,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:48,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:48,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:48,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:48,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:48,407 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2019-09-16 17:05:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:48,700 INFO L93 Difference]: Finished difference Result 284 states and 420 transitions. [2019-09-16 17:05:48,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:48,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-16 17:05:48,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:48,703 INFO L225 Difference]: With dead ends: 284 [2019-09-16 17:05:48,703 INFO L226 Difference]: Without dead ends: 284 [2019-09-16 17:05:48,704 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-16 17:05:48,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-16 17:05:48,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2019-09-16 17:05:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2019-09-16 17:05:48,710 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 94 [2019-09-16 17:05:48,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:48,711 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2019-09-16 17:05:48,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2019-09-16 17:05:48,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-16 17:05:48,712 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:48,712 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:48,713 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:48,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:48,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2099641790, now seen corresponding path program 1 times [2019-09-16 17:05:48,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:48,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:48,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:48,784 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-16 17:05:48,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:48,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:48,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:48,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:48,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:48,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:48,785 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2019-09-16 17:05:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:49,117 INFO L93 Difference]: Finished difference Result 282 states and 417 transitions. [2019-09-16 17:05:49,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:49,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-16 17:05:49,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:49,119 INFO L225 Difference]: With dead ends: 282 [2019-09-16 17:05:49,119 INFO L226 Difference]: Without dead ends: 282 [2019-09-16 17:05:49,120 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-16 17:05:49,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-16 17:05:49,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-16 17:05:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2019-09-16 17:05:49,127 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 94 [2019-09-16 17:05:49,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:49,127 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2019-09-16 17:05:49,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:49,128 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2019-09-16 17:05:49,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-16 17:05:49,129 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:49,130 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:49,130 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:49,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:49,130 INFO L82 PathProgramCache]: Analyzing trace with hash 918561850, now seen corresponding path program 1 times [2019-09-16 17:05:49,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:49,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:49,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:49,195 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-16 17:05:49,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:49,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:49,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:49,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:49,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:49,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:49,198 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2019-09-16 17:05:49,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:49,606 INFO L93 Difference]: Finished difference Result 307 states and 450 transitions. [2019-09-16 17:05:49,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:49,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-16 17:05:49,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:49,610 INFO L225 Difference]: With dead ends: 307 [2019-09-16 17:05:49,610 INFO L226 Difference]: Without dead ends: 307 [2019-09-16 17:05:49,610 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-16 17:05:49,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-16 17:05:49,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-16 17:05:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2019-09-16 17:05:49,617 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 95 [2019-09-16 17:05:49,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:49,617 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2019-09-16 17:05:49,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2019-09-16 17:05:49,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-16 17:05:49,618 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:49,619 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:49,619 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:49,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:49,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1437243400, now seen corresponding path program 1 times [2019-09-16 17:05:49,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:49,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:49,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:49,678 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-16 17:05:49,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:49,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:49,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:49,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:49,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:49,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:49,680 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 4 states. [2019-09-16 17:05:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:49,970 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2019-09-16 17:05:49,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:49,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-16 17:05:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:49,973 INFO L225 Difference]: With dead ends: 282 [2019-09-16 17:05:49,973 INFO L226 Difference]: Without dead ends: 282 [2019-09-16 17:05:49,974 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-16 17:05:49,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-16 17:05:49,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-16 17:05:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 386 transitions. [2019-09-16 17:05:49,980 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 386 transitions. Word has length 95 [2019-09-16 17:05:49,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:49,980 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 386 transitions. [2019-09-16 17:05:49,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 386 transitions. [2019-09-16 17:05:49,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-16 17:05:49,982 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:49,982 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:49,982 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:49,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:49,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1799405369, now seen corresponding path program 1 times [2019-09-16 17:05:49,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:49,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:49,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:50,050 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-16 17:05:50,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:50,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:50,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:50,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:50,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:50,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:50,052 INFO L87 Difference]: Start difference. First operand 260 states and 386 transitions. Second operand 4 states. [2019-09-16 17:05:50,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:50,451 INFO L93 Difference]: Finished difference Result 307 states and 448 transitions. [2019-09-16 17:05:50,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:50,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-16 17:05:50,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:50,455 INFO L225 Difference]: With dead ends: 307 [2019-09-16 17:05:50,455 INFO L226 Difference]: Without dead ends: 307 [2019-09-16 17:05:50,456 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-16 17:05:50,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-16 17:05:50,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:50,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 385 transitions. [2019-09-16 17:05:50,463 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 385 transitions. Word has length 96 [2019-09-16 17:05:50,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:50,463 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 385 transitions. [2019-09-16 17:05:50,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 385 transitions. [2019-09-16 17:05:50,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-16 17:05:50,465 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:50,465 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:50,465 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:50,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:50,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1783886651, now seen corresponding path program 1 times [2019-09-16 17:05:50,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:50,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:50,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:50,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:50,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:50,553 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-16 17:05:50,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:50,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:50,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:50,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:50,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:50,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:50,559 INFO L87 Difference]: Start difference. First operand 260 states and 385 transitions. Second operand 4 states. [2019-09-16 17:05:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:50,886 INFO L93 Difference]: Finished difference Result 282 states and 413 transitions. [2019-09-16 17:05:50,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:50,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-16 17:05:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:50,888 INFO L225 Difference]: With dead ends: 282 [2019-09-16 17:05:50,889 INFO L226 Difference]: Without dead ends: 282 [2019-09-16 17:05:50,889 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-16 17:05:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-16 17:05:50,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-16 17:05:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2019-09-16 17:05:50,897 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 96 [2019-09-16 17:05:50,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:50,898 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2019-09-16 17:05:50,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2019-09-16 17:05:50,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-16 17:05:50,900 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:50,900 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:50,900 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:50,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:50,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2053716085, now seen corresponding path program 1 times [2019-09-16 17:05:50,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:50,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:50,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:50,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:50,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:50,965 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-16 17:05:50,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:50,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:50,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:50,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:50,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:50,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:50,967 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand 4 states. [2019-09-16 17:05:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:51,339 INFO L93 Difference]: Finished difference Result 307 states and 446 transitions. [2019-09-16 17:05:51,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:51,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-16 17:05:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:51,342 INFO L225 Difference]: With dead ends: 307 [2019-09-16 17:05:51,343 INFO L226 Difference]: Without dead ends: 307 [2019-09-16 17:05:51,343 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-16 17:05:51,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-16 17:05:51,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-16 17:05:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:51,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2019-09-16 17:05:51,351 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 97 [2019-09-16 17:05:51,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:51,352 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2019-09-16 17:05:51,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2019-09-16 17:05:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-16 17:05:51,354 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:51,354 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:51,354 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:51,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:51,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1572635827, now seen corresponding path program 1 times [2019-09-16 17:05:51,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:51,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:51,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:51,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:51,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:51,436 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-16 17:05:51,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:51,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:51,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:51,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:51,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:51,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:51,438 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand 4 states. [2019-09-16 17:05:51,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:51,778 INFO L93 Difference]: Finished difference Result 282 states and 411 transitions. [2019-09-16 17:05:51,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:51,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-16 17:05:51,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:51,780 INFO L225 Difference]: With dead ends: 282 [2019-09-16 17:05:51,780 INFO L226 Difference]: Without dead ends: 282 [2019-09-16 17:05:51,780 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:51,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-16 17:05:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-16 17:05:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2019-09-16 17:05:51,787 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 97 [2019-09-16 17:05:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:51,787 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2019-09-16 17:05:51,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:51,788 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2019-09-16 17:05:51,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-16 17:05:51,789 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:51,789 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:51,789 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:51,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:51,790 INFO L82 PathProgramCache]: Analyzing trace with hash 65379092, now seen corresponding path program 1 times [2019-09-16 17:05:51,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:51,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:51,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:51,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:51,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:51,854 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-16 17:05:51,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:51,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:51,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:51,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:51,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:51,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:51,856 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand 4 states. [2019-09-16 17:05:52,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:52,196 INFO L93 Difference]: Finished difference Result 297 states and 432 transitions. [2019-09-16 17:05:52,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:52,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-16 17:05:52,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:52,199 INFO L225 Difference]: With dead ends: 297 [2019-09-16 17:05:52,199 INFO L226 Difference]: Without dead ends: 297 [2019-09-16 17:05:52,199 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-16 17:05:52,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-16 17:05:52,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 260. [2019-09-16 17:05:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 381 transitions. [2019-09-16 17:05:52,206 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 381 transitions. Word has length 98 [2019-09-16 17:05:52,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:52,206 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 381 transitions. [2019-09-16 17:05:52,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 381 transitions. [2019-09-16 17:05:52,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-16 17:05:52,208 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:52,208 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:52,208 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:52,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:52,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1963207018, now seen corresponding path program 1 times [2019-09-16 17:05:52,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:52,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:52,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:52,281 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-16 17:05:52,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:52,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:52,283 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:52,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:52,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:52,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:52,284 INFO L87 Difference]: Start difference. First operand 260 states and 381 transitions. Second operand 4 states. [2019-09-16 17:05:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:52,531 INFO L93 Difference]: Finished difference Result 272 states and 397 transitions. [2019-09-16 17:05:52,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:52,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-16 17:05:52,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:52,533 INFO L225 Difference]: With dead ends: 272 [2019-09-16 17:05:52,533 INFO L226 Difference]: Without dead ends: 272 [2019-09-16 17:05:52,534 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-16 17:05:52,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-16 17:05:52,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2019-09-16 17:05:52,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:52,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 380 transitions. [2019-09-16 17:05:52,540 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 380 transitions. Word has length 98 [2019-09-16 17:05:52,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:52,541 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 380 transitions. [2019-09-16 17:05:52,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2019-09-16 17:05:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:05:52,542 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:52,542 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:52,543 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:52,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:52,543 INFO L82 PathProgramCache]: Analyzing trace with hash 445820602, now seen corresponding path program 1 times [2019-09-16 17:05:52,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:52,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:52,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:52,633 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-16 17:05:52,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:52,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:52,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:52,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:52,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:52,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:52,635 INFO L87 Difference]: Start difference. First operand 260 states and 380 transitions. Second operand 4 states. [2019-09-16 17:05:52,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:52,991 INFO L93 Difference]: Finished difference Result 297 states and 430 transitions. [2019-09-16 17:05:52,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:52,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-16 17:05:52,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:52,993 INFO L225 Difference]: With dead ends: 297 [2019-09-16 17:05:52,993 INFO L226 Difference]: Without dead ends: 297 [2019-09-16 17:05:52,994 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-16 17:05:52,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-16 17:05:53,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 260. [2019-09-16 17:05:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:53,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 379 transitions. [2019-09-16 17:05:53,001 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 379 transitions. Word has length 102 [2019-09-16 17:05:53,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:53,002 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 379 transitions. [2019-09-16 17:05:53,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:53,002 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 379 transitions. [2019-09-16 17:05:53,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:05:53,006 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:53,007 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:53,007 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:53,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:53,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1832606012, now seen corresponding path program 1 times [2019-09-16 17:05:53,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:53,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:53,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:53,074 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-16 17:05:53,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:53,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:53,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:53,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:53,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:53,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:53,076 INFO L87 Difference]: Start difference. First operand 260 states and 379 transitions. Second operand 3 states. [2019-09-16 17:05:53,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:53,116 INFO L93 Difference]: Finished difference Result 493 states and 723 transitions. [2019-09-16 17:05:53,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:53,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-16 17:05:53,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:53,120 INFO L225 Difference]: With dead ends: 493 [2019-09-16 17:05:53,120 INFO L226 Difference]: Without dead ends: 493 [2019-09-16 17:05:53,120 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-16 17:05:53,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-16 17:05:53,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-09-16 17:05:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-09-16 17:05:53,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 723 transitions. [2019-09-16 17:05:53,130 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 723 transitions. Word has length 102 [2019-09-16 17:05:53,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:53,130 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 723 transitions. [2019-09-16 17:05:53,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:53,131 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 723 transitions. [2019-09-16 17:05:53,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:05:53,132 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:53,132 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:53,133 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:53,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:53,133 INFO L82 PathProgramCache]: Analyzing trace with hash 881301798, now seen corresponding path program 1 times [2019-09-16 17:05:53,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:53,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:53,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:53,195 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-16 17:05:53,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:53,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:53,195 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:53,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:53,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:53,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:53,196 INFO L87 Difference]: Start difference. First operand 493 states and 723 transitions. Second operand 3 states. [2019-09-16 17:05:53,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:53,244 INFO L93 Difference]: Finished difference Result 728 states and 1072 transitions. [2019-09-16 17:05:53,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:53,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-16 17:05:53,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:53,248 INFO L225 Difference]: With dead ends: 728 [2019-09-16 17:05:53,248 INFO L226 Difference]: Without dead ends: 728 [2019-09-16 17:05:53,248 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-16 17:05:53,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-09-16 17:05:53,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2019-09-16 17:05:53,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-09-16 17:05:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1071 transitions. [2019-09-16 17:05:53,261 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1071 transitions. Word has length 104 [2019-09-16 17:05:53,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:53,261 INFO L475 AbstractCegarLoop]: Abstraction has 726 states and 1071 transitions. [2019-09-16 17:05:53,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1071 transitions. [2019-09-16 17:05:53,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-16 17:05:53,263 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:53,264 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:53,264 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:53,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:53,264 INFO L82 PathProgramCache]: Analyzing trace with hash -508111036, now seen corresponding path program 1 times [2019-09-16 17:05:53,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:53,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:53,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:53,329 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-16 17:05:53,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:53,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:53,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:53,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:53,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:53,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:53,331 INFO L87 Difference]: Start difference. First operand 726 states and 1071 transitions. Second operand 3 states. [2019-09-16 17:05:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:53,390 INFO L93 Difference]: Finished difference Result 961 states and 1406 transitions. [2019-09-16 17:05:53,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:53,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-16 17:05:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:53,396 INFO L225 Difference]: With dead ends: 961 [2019-09-16 17:05:53,396 INFO L226 Difference]: Without dead ends: 961 [2019-09-16 17:05:53,396 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-16 17:05:53,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-09-16 17:05:53,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2019-09-16 17:05:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-09-16 17:05:53,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1405 transitions. [2019-09-16 17:05:53,416 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1405 transitions. Word has length 110 [2019-09-16 17:05:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:53,417 INFO L475 AbstractCegarLoop]: Abstraction has 959 states and 1405 transitions. [2019-09-16 17:05:53,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1405 transitions. [2019-09-16 17:05:53,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-16 17:05:53,420 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:53,420 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:53,421 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:53,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:53,421 INFO L82 PathProgramCache]: Analyzing trace with hash 340355395, now seen corresponding path program 1 times [2019-09-16 17:05:53,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:53,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:53,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:53,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:53,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:53,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:53,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:53,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:53,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:53,537 INFO L87 Difference]: Start difference. First operand 959 states and 1405 transitions. Second operand 4 states. [2019-09-16 17:05:54,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:54,068 INFO L93 Difference]: Finished difference Result 1369 states and 2020 transitions. [2019-09-16 17:05:54,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:54,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-16 17:05:54,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:54,077 INFO L225 Difference]: With dead ends: 1369 [2019-09-16 17:05:54,077 INFO L226 Difference]: Without dead ends: 1369 [2019-09-16 17:05:54,078 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-16 17:05:54,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2019-09-16 17:05:54,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1115. [2019-09-16 17:05:54,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-09-16 17:05:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1689 transitions. [2019-09-16 17:05:54,110 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1689 transitions. Word has length 127 [2019-09-16 17:05:54,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:54,110 INFO L475 AbstractCegarLoop]: Abstraction has 1115 states and 1689 transitions. [2019-09-16 17:05:54,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:54,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1689 transitions. [2019-09-16 17:05:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-16 17:05:54,114 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:54,115 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:54,115 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:54,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:54,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1954075331, now seen corresponding path program 1 times [2019-09-16 17:05:54,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:54,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:54,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:54,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:54,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:54,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:54,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:54,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:54,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:54,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:54,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:54,242 INFO L87 Difference]: Start difference. First operand 1115 states and 1689 transitions. Second operand 4 states. [2019-09-16 17:05:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:54,702 INFO L93 Difference]: Finished difference Result 1351 states and 1994 transitions. [2019-09-16 17:05:54,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:54,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-16 17:05:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:54,709 INFO L225 Difference]: With dead ends: 1351 [2019-09-16 17:05:54,709 INFO L226 Difference]: Without dead ends: 1351 [2019-09-16 17:05:54,710 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-16 17:05:54,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-09-16 17:05:54,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1075. [2019-09-16 17:05:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-09-16 17:05:54,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1613 transitions. [2019-09-16 17:05:54,731 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1613 transitions. Word has length 128 [2019-09-16 17:05:54,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:54,732 INFO L475 AbstractCegarLoop]: Abstraction has 1075 states and 1613 transitions. [2019-09-16 17:05:54,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:54,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1613 transitions. [2019-09-16 17:05:54,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-16 17:05:54,735 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:54,735 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:54,735 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:54,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:54,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1490307687, now seen corresponding path program 1 times [2019-09-16 17:05:54,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:54,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:54,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:54,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:54,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:54,807 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-16 17:05:54,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:54,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:54,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:54,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:54,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:54,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:54,809 INFO L87 Difference]: Start difference. First operand 1075 states and 1613 transitions. Second operand 3 states. [2019-09-16 17:05:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:54,859 INFO L93 Difference]: Finished difference Result 1339 states and 2008 transitions. [2019-09-16 17:05:54,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:54,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-09-16 17:05:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:54,865 INFO L225 Difference]: With dead ends: 1339 [2019-09-16 17:05:54,865 INFO L226 Difference]: Without dead ends: 1339 [2019-09-16 17:05:54,866 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-16 17:05:54,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-09-16 17:05:54,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2019-09-16 17:05:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2007 transitions. [2019-09-16 17:05:54,888 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2007 transitions. Word has length 133 [2019-09-16 17:05:54,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:54,889 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 2007 transitions. [2019-09-16 17:05:54,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:54,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2007 transitions. [2019-09-16 17:05:54,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-16 17:05:54,891 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:54,892 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:54,892 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:54,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:54,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1260334381, now seen corresponding path program 1 times [2019-09-16 17:05:54,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:54,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:54,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:54,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:54,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:54,963 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:54,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:54,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:54,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:54,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:54,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:54,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:54,965 INFO L87 Difference]: Start difference. First operand 1337 states and 2007 transitions. Second operand 4 states. [2019-09-16 17:05:55,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:55,452 INFO L93 Difference]: Finished difference Result 1682 states and 2477 transitions. [2019-09-16 17:05:55,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:55,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-16 17:05:55,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:55,460 INFO L225 Difference]: With dead ends: 1682 [2019-09-16 17:05:55,460 INFO L226 Difference]: Without dead ends: 1682 [2019-09-16 17:05:55,460 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-16 17:05:55,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2019-09-16 17:05:55,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1337. [2019-09-16 17:05:55,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:55,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2002 transitions. [2019-09-16 17:05:55,487 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2002 transitions. Word has length 140 [2019-09-16 17:05:55,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:55,487 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 2002 transitions. [2019-09-16 17:05:55,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:55,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2002 transitions. [2019-09-16 17:05:55,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-16 17:05:55,490 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:55,490 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:55,490 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:55,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:55,491 INFO L82 PathProgramCache]: Analyzing trace with hash -950685943, now seen corresponding path program 1 times [2019-09-16 17:05:55,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:55,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:55,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:55,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:55,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:55,613 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:55,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:55,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:55,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:55,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:55,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:55,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:55,614 INFO L87 Difference]: Start difference. First operand 1337 states and 2002 transitions. Second operand 4 states. [2019-09-16 17:05:56,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:56,175 INFO L93 Difference]: Finished difference Result 1677 states and 2467 transitions. [2019-09-16 17:05:56,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:56,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-16 17:05:56,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:56,185 INFO L225 Difference]: With dead ends: 1677 [2019-09-16 17:05:56,185 INFO L226 Difference]: Without dead ends: 1677 [2019-09-16 17:05:56,185 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-16 17:05:56,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2019-09-16 17:05:56,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1337. [2019-09-16 17:05:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1997 transitions. [2019-09-16 17:05:56,210 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1997 transitions. Word has length 141 [2019-09-16 17:05:56,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:56,211 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1997 transitions. [2019-09-16 17:05:56,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1997 transitions. [2019-09-16 17:05:56,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-16 17:05:56,214 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:56,214 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:56,214 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:56,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:56,214 INFO L82 PathProgramCache]: Analyzing trace with hash 707342472, now seen corresponding path program 1 times [2019-09-16 17:05:56,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:56,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:56,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:56,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:56,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:56,291 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:56,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:56,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:56,292 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:56,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:56,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:56,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:56,293 INFO L87 Difference]: Start difference. First operand 1337 states and 1997 transitions. Second operand 4 states. [2019-09-16 17:05:56,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:56,724 INFO L93 Difference]: Finished difference Result 1667 states and 2452 transitions. [2019-09-16 17:05:56,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:56,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-16 17:05:56,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:56,731 INFO L225 Difference]: With dead ends: 1667 [2019-09-16 17:05:56,731 INFO L226 Difference]: Without dead ends: 1667 [2019-09-16 17:05:56,732 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-16 17:05:56,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-16 17:05:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-16 17:05:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1992 transitions. [2019-09-16 17:05:56,753 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1992 transitions. Word has length 141 [2019-09-16 17:05:56,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:56,754 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1992 transitions. [2019-09-16 17:05:56,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1992 transitions. [2019-09-16 17:05:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-16 17:05:56,757 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:56,757 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:56,757 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:56,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:56,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1800130410, now seen corresponding path program 1 times [2019-09-16 17:05:56,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:56,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:56,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:56,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:56,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:56,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:56,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:56,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:56,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:56,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:56,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:56,826 INFO L87 Difference]: Start difference. First operand 1337 states and 1992 transitions. Second operand 4 states. [2019-09-16 17:05:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:57,256 INFO L93 Difference]: Finished difference Result 1667 states and 2447 transitions. [2019-09-16 17:05:57,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:57,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-16 17:05:57,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:57,267 INFO L225 Difference]: With dead ends: 1667 [2019-09-16 17:05:57,267 INFO L226 Difference]: Without dead ends: 1667 [2019-09-16 17:05:57,268 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-16 17:05:57,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-16 17:05:57,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-16 17:05:57,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:57,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1987 transitions. [2019-09-16 17:05:57,289 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1987 transitions. Word has length 142 [2019-09-16 17:05:57,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:57,290 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1987 transitions. [2019-09-16 17:05:57,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:57,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1987 transitions. [2019-09-16 17:05:57,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-16 17:05:57,293 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:57,293 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:57,294 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:57,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:57,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1021270341, now seen corresponding path program 1 times [2019-09-16 17:05:57,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:57,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:57,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:57,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:57,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:57,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:57,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:57,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:57,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:57,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:57,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:57,368 INFO L87 Difference]: Start difference. First operand 1337 states and 1987 transitions. Second operand 4 states. [2019-09-16 17:05:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:57,788 INFO L93 Difference]: Finished difference Result 1667 states and 2442 transitions. [2019-09-16 17:05:57,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:57,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-16 17:05:57,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:57,796 INFO L225 Difference]: With dead ends: 1667 [2019-09-16 17:05:57,796 INFO L226 Difference]: Without dead ends: 1667 [2019-09-16 17:05:57,797 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-16 17:05:57,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-16 17:05:57,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-16 17:05:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1982 transitions. [2019-09-16 17:05:57,818 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1982 transitions. Word has length 143 [2019-09-16 17:05:57,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:57,818 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1982 transitions. [2019-09-16 17:05:57,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:57,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1982 transitions. [2019-09-16 17:05:57,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-16 17:05:57,821 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:57,821 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:57,822 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:57,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:57,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1024642789, now seen corresponding path program 1 times [2019-09-16 17:05:57,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:57,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:57,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:57,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:57,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:57,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:57,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:57,895 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:57,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:57,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:57,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:57,896 INFO L87 Difference]: Start difference. First operand 1337 states and 1982 transitions. Second operand 4 states. [2019-09-16 17:05:58,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:58,352 INFO L93 Difference]: Finished difference Result 1667 states and 2437 transitions. [2019-09-16 17:05:58,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:58,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-09-16 17:05:58,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:58,361 INFO L225 Difference]: With dead ends: 1667 [2019-09-16 17:05:58,361 INFO L226 Difference]: Without dead ends: 1667 [2019-09-16 17:05:58,362 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:58,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-16 17:05:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-16 17:05:58,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1977 transitions. [2019-09-16 17:05:58,384 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1977 transitions. Word has length 144 [2019-09-16 17:05:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:58,385 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1977 transitions. [2019-09-16 17:05:58,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1977 transitions. [2019-09-16 17:05:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-16 17:05:58,388 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:58,388 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:58,389 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:58,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:58,389 INFO L82 PathProgramCache]: Analyzing trace with hash -492580512, now seen corresponding path program 1 times [2019-09-16 17:05:58,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:58,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:58,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:58,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:58,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:58,461 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:58,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:58,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:58,462 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:58,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:58,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:58,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:58,463 INFO L87 Difference]: Start difference. First operand 1337 states and 1977 transitions. Second operand 4 states. [2019-09-16 17:05:58,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:58,881 INFO L93 Difference]: Finished difference Result 1617 states and 2372 transitions. [2019-09-16 17:05:58,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:58,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-16 17:05:58,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:58,887 INFO L225 Difference]: With dead ends: 1617 [2019-09-16 17:05:58,888 INFO L226 Difference]: Without dead ends: 1617 [2019-09-16 17:05:58,888 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-16 17:05:58,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-09-16 17:05:58,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1337. [2019-09-16 17:05:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:58,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1972 transitions. [2019-09-16 17:05:58,909 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1972 transitions. Word has length 145 [2019-09-16 17:05:58,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:58,909 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1972 transitions. [2019-09-16 17:05:58,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:58,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1972 transitions. [2019-09-16 17:05:58,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-16 17:05:58,913 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:58,913 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:58,913 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:58,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:58,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1212937850, now seen corresponding path program 1 times [2019-09-16 17:05:58,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:58,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:58,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:58,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:58,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:58,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:58,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:58,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:58,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:58,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:58,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:58,988 INFO L87 Difference]: Start difference. First operand 1337 states and 1972 transitions. Second operand 4 states. [2019-09-16 17:05:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:59,385 INFO L93 Difference]: Finished difference Result 1617 states and 2367 transitions. [2019-09-16 17:05:59,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:59,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-09-16 17:05:59,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:59,400 INFO L225 Difference]: With dead ends: 1617 [2019-09-16 17:05:59,400 INFO L226 Difference]: Without dead ends: 1617 [2019-09-16 17:05:59,400 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-16 17:05:59,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-09-16 17:05:59,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1337. [2019-09-16 17:05:59,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:59,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1967 transitions. [2019-09-16 17:05:59,426 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1967 transitions. Word has length 149 [2019-09-16 17:05:59,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:59,427 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1967 transitions. [2019-09-16 17:05:59,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1967 transitions. [2019-09-16 17:05:59,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-16 17:05:59,430 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:59,430 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:59,430 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:59,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:59,431 INFO L82 PathProgramCache]: Analyzing trace with hash 338308875, now seen corresponding path program 1 times [2019-09-16 17:05:59,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:59,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:59,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:59,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:59,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:59,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:59,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:59,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:59,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:59,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:59,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:59,510 INFO L87 Difference]: Start difference. First operand 1337 states and 1967 transitions. Second operand 4 states. [2019-09-16 17:05:59,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:59,915 INFO L93 Difference]: Finished difference Result 1592 states and 2330 transitions. [2019-09-16 17:05:59,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:59,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-16 17:05:59,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:59,921 INFO L225 Difference]: With dead ends: 1592 [2019-09-16 17:05:59,922 INFO L226 Difference]: Without dead ends: 1592 [2019-09-16 17:05:59,922 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-16 17:05:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2019-09-16 17:05:59,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1337. [2019-09-16 17:05:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:59,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1962 transitions. [2019-09-16 17:05:59,948 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1962 transitions. Word has length 150 [2019-09-16 17:05:59,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:59,948 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1962 transitions. [2019-09-16 17:05:59,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:59,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1962 transitions. [2019-09-16 17:05:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-16 17:05:59,951 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:59,952 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:59,952 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:59,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:59,952 INFO L82 PathProgramCache]: Analyzing trace with hash 582401643, now seen corresponding path program 1 times [2019-09-16 17:05:59,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:59,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:59,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:59,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:59,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:00,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:00,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:00,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:00,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:00,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:00,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:00,030 INFO L87 Difference]: Start difference. First operand 1337 states and 1962 transitions. Second operand 4 states. [2019-09-16 17:06:00,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:00,417 INFO L93 Difference]: Finished difference Result 1592 states and 2325 transitions. [2019-09-16 17:06:00,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:00,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-16 17:06:00,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:00,421 INFO L225 Difference]: With dead ends: 1592 [2019-09-16 17:06:00,422 INFO L226 Difference]: Without dead ends: 1592 [2019-09-16 17:06:00,422 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-16 17:06:00,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2019-09-16 17:06:00,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1337. [2019-09-16 17:06:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:00,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1957 transitions. [2019-09-16 17:06:00,440 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1957 transitions. Word has length 152 [2019-09-16 17:06:00,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:00,441 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1957 transitions. [2019-09-16 17:06:00,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:00,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1957 transitions. [2019-09-16 17:06:00,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-16 17:06:00,444 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:00,444 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:00,444 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:00,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:00,445 INFO L82 PathProgramCache]: Analyzing trace with hash 226930054, now seen corresponding path program 1 times [2019-09-16 17:06:00,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:00,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:00,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:00,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:00,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:00,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:00,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:00,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:00,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:00,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:00,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:00,572 INFO L87 Difference]: Start difference. First operand 1337 states and 1957 transitions. Second operand 4 states. [2019-09-16 17:06:00,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:00,915 INFO L93 Difference]: Finished difference Result 1552 states and 2255 transitions. [2019-09-16 17:06:00,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:00,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-16 17:06:00,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:00,920 INFO L225 Difference]: With dead ends: 1552 [2019-09-16 17:06:00,920 INFO L226 Difference]: Without dead ends: 1552 [2019-09-16 17:06:00,920 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-16 17:06:00,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-09-16 17:06:00,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1317. [2019-09-16 17:06:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2019-09-16 17:06:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1922 transitions. [2019-09-16 17:06:00,936 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1922 transitions. Word has length 153 [2019-09-16 17:06:00,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:00,937 INFO L475 AbstractCegarLoop]: Abstraction has 1317 states and 1922 transitions. [2019-09-16 17:06:00,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:00,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1922 transitions. [2019-09-16 17:06:00,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-16 17:06:00,939 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:00,939 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:00,940 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:00,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:00,940 INFO L82 PathProgramCache]: Analyzing trace with hash -955663798, now seen corresponding path program 1 times [2019-09-16 17:06:00,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:00,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:00,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:00,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:00,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:01,016 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:01,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:01,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:01,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:01,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:01,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:01,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:01,018 INFO L87 Difference]: Start difference. First operand 1317 states and 1922 transitions. Second operand 4 states. [2019-09-16 17:06:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:01,343 INFO L93 Difference]: Finished difference Result 1552 states and 2250 transitions. [2019-09-16 17:06:01,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:01,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-16 17:06:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:01,347 INFO L225 Difference]: With dead ends: 1552 [2019-09-16 17:06:01,347 INFO L226 Difference]: Without dead ends: 1552 [2019-09-16 17:06:01,347 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-16 17:06:01,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-09-16 17:06:01,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1342. [2019-09-16 17:06:01,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-09-16 17:06:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1957 transitions. [2019-09-16 17:06:01,362 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1957 transitions. Word has length 154 [2019-09-16 17:06:01,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:01,362 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 1957 transitions. [2019-09-16 17:06:01,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:01,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1957 transitions. [2019-09-16 17:06:01,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-16 17:06:01,365 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:01,365 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:01,365 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:01,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:01,366 INFO L82 PathProgramCache]: Analyzing trace with hash -943372069, now seen corresponding path program 1 times [2019-09-16 17:06:01,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:01,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:01,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:01,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:01,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:01,435 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:01,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:01,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:01,436 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:01,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:01,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:01,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:01,437 INFO L87 Difference]: Start difference. First operand 1342 states and 1957 transitions. Second operand 4 states. [2019-09-16 17:06:01,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:01,858 INFO L93 Difference]: Finished difference Result 1552 states and 2245 transitions. [2019-09-16 17:06:01,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:01,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-16 17:06:01,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:01,862 INFO L225 Difference]: With dead ends: 1552 [2019-09-16 17:06:01,863 INFO L226 Difference]: Without dead ends: 1552 [2019-09-16 17:06:01,863 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-16 17:06:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-09-16 17:06:01,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1342. [2019-09-16 17:06:01,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-09-16 17:06:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1952 transitions. [2019-09-16 17:06:01,880 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1952 transitions. Word has length 155 [2019-09-16 17:06:01,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:01,880 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 1952 transitions. [2019-09-16 17:06:01,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1952 transitions. [2019-09-16 17:06:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-16 17:06:01,883 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:01,883 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:01,884 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:01,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1336878587, now seen corresponding path program 1 times [2019-09-16 17:06:01,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:01,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:01,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:01,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:01,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:01,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:01,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:01,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:01,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:01,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:01,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:01,967 INFO L87 Difference]: Start difference. First operand 1342 states and 1952 transitions. Second operand 4 states. [2019-09-16 17:06:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:02,288 INFO L93 Difference]: Finished difference Result 1542 states and 2230 transitions. [2019-09-16 17:06:02,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:02,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-16 17:06:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:02,293 INFO L225 Difference]: With dead ends: 1542 [2019-09-16 17:06:02,293 INFO L226 Difference]: Without dead ends: 1542 [2019-09-16 17:06:02,294 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-16 17:06:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-09-16 17:06:02,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1347. [2019-09-16 17:06:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-09-16 17:06:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1957 transitions. [2019-09-16 17:06:02,310 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1957 transitions. Word has length 155 [2019-09-16 17:06:02,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:02,310 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 1957 transitions. [2019-09-16 17:06:02,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:02,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1957 transitions. [2019-09-16 17:06:02,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:06:02,312 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:02,313 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:02,313 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:02,313 INFO L82 PathProgramCache]: Analyzing trace with hash -631109824, now seen corresponding path program 1 times [2019-09-16 17:06:02,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:02,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:02,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:02,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:02,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:02,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:02,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:02,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:02,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:02,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:02,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:02,391 INFO L87 Difference]: Start difference. First operand 1347 states and 1957 transitions. Second operand 4 states. [2019-09-16 17:06:02,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:02,727 INFO L93 Difference]: Finished difference Result 1532 states and 2210 transitions. [2019-09-16 17:06:02,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:02,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:06:02,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:02,730 INFO L225 Difference]: With dead ends: 1532 [2019-09-16 17:06:02,730 INFO L226 Difference]: Without dead ends: 1532 [2019-09-16 17:06:02,731 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:02,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-09-16 17:06:02,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1347. [2019-09-16 17:06:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-09-16 17:06:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1952 transitions. [2019-09-16 17:06:02,750 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1952 transitions. Word has length 156 [2019-09-16 17:06:02,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:02,751 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 1952 transitions. [2019-09-16 17:06:02,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:02,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1952 transitions. [2019-09-16 17:06:02,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:06:02,754 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:02,754 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:02,754 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:02,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:02,755 INFO L82 PathProgramCache]: Analyzing trace with hash 616877608, now seen corresponding path program 1 times [2019-09-16 17:06:02,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:02,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:02,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:02,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:02,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:02,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:02,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:02,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:02,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:02,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:02,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:02,863 INFO L87 Difference]: Start difference. First operand 1347 states and 1952 transitions. Second operand 4 states. [2019-09-16 17:06:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:03,164 INFO L93 Difference]: Finished difference Result 1517 states and 2185 transitions. [2019-09-16 17:06:03,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:03,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:06:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:03,170 INFO L225 Difference]: With dead ends: 1517 [2019-09-16 17:06:03,170 INFO L226 Difference]: Without dead ends: 1517 [2019-09-16 17:06:03,171 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-16 17:06:03,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-09-16 17:06:03,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1352. [2019-09-16 17:06:03,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-09-16 17:06:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1957 transitions. [2019-09-16 17:06:03,186 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1957 transitions. Word has length 156 [2019-09-16 17:06:03,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:03,186 INFO L475 AbstractCegarLoop]: Abstraction has 1352 states and 1957 transitions. [2019-09-16 17:06:03,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:03,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1957 transitions. [2019-09-16 17:06:03,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-16 17:06:03,188 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:03,189 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:03,189 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:03,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:03,189 INFO L82 PathProgramCache]: Analyzing trace with hash -680355751, now seen corresponding path program 1 times [2019-09-16 17:06:03,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:03,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:03,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:03,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:03,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:03,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:03,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:03,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:03,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:03,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:03,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:03,271 INFO L87 Difference]: Start difference. First operand 1352 states and 1957 transitions. Second operand 4 states. [2019-09-16 17:06:03,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:03,609 INFO L93 Difference]: Finished difference Result 1517 states and 2180 transitions. [2019-09-16 17:06:03,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:03,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-16 17:06:03,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:03,612 INFO L225 Difference]: With dead ends: 1517 [2019-09-16 17:06:03,612 INFO L226 Difference]: Without dead ends: 1517 [2019-09-16 17:06:03,613 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-16 17:06:03,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-09-16 17:06:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1357. [2019-09-16 17:06:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2019-09-16 17:06:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1962 transitions. [2019-09-16 17:06:03,629 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1962 transitions. Word has length 158 [2019-09-16 17:06:03,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:03,629 INFO L475 AbstractCegarLoop]: Abstraction has 1357 states and 1962 transitions. [2019-09-16 17:06:03,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:03,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1962 transitions. [2019-09-16 17:06:03,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-16 17:06:03,632 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:03,632 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:03,632 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:03,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:03,633 INFO L82 PathProgramCache]: Analyzing trace with hash -490771207, now seen corresponding path program 1 times [2019-09-16 17:06:03,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:03,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:03,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:03,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:03,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:03,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:03,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:03,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:03,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:03,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:03,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:03,738 INFO L87 Difference]: Start difference. First operand 1357 states and 1962 transitions. Second operand 4 states. [2019-09-16 17:06:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:04,061 INFO L93 Difference]: Finished difference Result 1497 states and 2150 transitions. [2019-09-16 17:06:04,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:04,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-16 17:06:04,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:04,064 INFO L225 Difference]: With dead ends: 1497 [2019-09-16 17:06:04,064 INFO L226 Difference]: Without dead ends: 1497 [2019-09-16 17:06:04,064 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-16 17:06:04,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2019-09-16 17:06:04,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1362. [2019-09-16 17:06:04,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-09-16 17:06:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1967 transitions. [2019-09-16 17:06:04,076 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1967 transitions. Word has length 159 [2019-09-16 17:06:04,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:04,076 INFO L475 AbstractCegarLoop]: Abstraction has 1362 states and 1967 transitions. [2019-09-16 17:06:04,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1967 transitions. [2019-09-16 17:06:04,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-16 17:06:04,078 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:04,078 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:04,079 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:04,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:04,079 INFO L82 PathProgramCache]: Analyzing trace with hash 888709627, now seen corresponding path program 1 times [2019-09-16 17:06:04,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:04,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:04,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:04,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:04,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:04,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:04,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:04,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:04,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:04,160 INFO L87 Difference]: Start difference. First operand 1362 states and 1967 transitions. Second operand 4 states. [2019-09-16 17:06:04,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:04,468 INFO L93 Difference]: Finished difference Result 1497 states and 2145 transitions. [2019-09-16 17:06:04,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:04,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-16 17:06:04,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:04,471 INFO L225 Difference]: With dead ends: 1497 [2019-09-16 17:06:04,471 INFO L226 Difference]: Without dead ends: 1497 [2019-09-16 17:06:04,471 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-16 17:06:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2019-09-16 17:06:04,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1367. [2019-09-16 17:06:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2019-09-16 17:06:04,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1972 transitions. [2019-09-16 17:06:04,488 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1972 transitions. Word has length 159 [2019-09-16 17:06:04,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:04,488 INFO L475 AbstractCegarLoop]: Abstraction has 1367 states and 1972 transitions. [2019-09-16 17:06:04,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1972 transitions. [2019-09-16 17:06:04,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-16 17:06:04,492 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:04,494 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:04,494 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:04,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:04,495 INFO L82 PathProgramCache]: Analyzing trace with hash 100461755, now seen corresponding path program 1 times [2019-09-16 17:06:04,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:04,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:04,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:04,592 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:04,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:04,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:04,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:04,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:04,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:04,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:04,596 INFO L87 Difference]: Start difference. First operand 1367 states and 1972 transitions. Second operand 4 states. [2019-09-16 17:06:04,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:04,903 INFO L93 Difference]: Finished difference Result 1487 states and 2130 transitions. [2019-09-16 17:06:04,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:04,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-16 17:06:04,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:04,906 INFO L225 Difference]: With dead ends: 1487 [2019-09-16 17:06:04,906 INFO L226 Difference]: Without dead ends: 1487 [2019-09-16 17:06:04,907 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-16 17:06:04,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-09-16 17:06:04,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1372. [2019-09-16 17:06:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-09-16 17:06:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1977 transitions. [2019-09-16 17:06:04,963 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1977 transitions. Word has length 160 [2019-09-16 17:06:04,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:04,963 INFO L475 AbstractCegarLoop]: Abstraction has 1372 states and 1977 transitions. [2019-09-16 17:06:04,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:04,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1977 transitions. [2019-09-16 17:06:04,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-16 17:06:04,966 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:04,967 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:04,967 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:04,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:04,967 INFO L82 PathProgramCache]: Analyzing trace with hash 828422518, now seen corresponding path program 1 times [2019-09-16 17:06:04,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:04,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:04,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:05,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:05,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:05,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:05,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:05,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:05,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:05,059 INFO L87 Difference]: Start difference. First operand 1372 states and 1977 transitions. Second operand 4 states. [2019-09-16 17:06:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:05,346 INFO L93 Difference]: Finished difference Result 1487 states and 2125 transitions. [2019-09-16 17:06:05,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:05,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-16 17:06:05,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:05,348 INFO L225 Difference]: With dead ends: 1487 [2019-09-16 17:06:05,348 INFO L226 Difference]: Without dead ends: 1487 [2019-09-16 17:06:05,349 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-16 17:06:05,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-09-16 17:06:05,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1377. [2019-09-16 17:06:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2019-09-16 17:06:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1982 transitions. [2019-09-16 17:06:05,359 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1982 transitions. Word has length 161 [2019-09-16 17:06:05,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:05,360 INFO L475 AbstractCegarLoop]: Abstraction has 1377 states and 1982 transitions. [2019-09-16 17:06:05,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1982 transitions. [2019-09-16 17:06:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-16 17:06:05,361 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:05,362 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:05,362 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:05,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:05,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1161027478, now seen corresponding path program 1 times [2019-09-16 17:06:05,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:05,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:05,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:05,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:05,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:05,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:05,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:05,442 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:05,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:05,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:05,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:05,443 INFO L87 Difference]: Start difference. First operand 1377 states and 1982 transitions. Second operand 4 states. [2019-09-16 17:06:05,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:05,738 INFO L93 Difference]: Finished difference Result 1477 states and 2110 transitions. [2019-09-16 17:06:05,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:05,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-16 17:06:05,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:05,740 INFO L225 Difference]: With dead ends: 1477 [2019-09-16 17:06:05,740 INFO L226 Difference]: Without dead ends: 1477 [2019-09-16 17:06:05,741 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:05,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2019-09-16 17:06:05,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1382. [2019-09-16 17:06:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-09-16 17:06:05,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1987 transitions. [2019-09-16 17:06:05,753 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1987 transitions. Word has length 162 [2019-09-16 17:06:05,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:05,753 INFO L475 AbstractCegarLoop]: Abstraction has 1382 states and 1987 transitions. [2019-09-16 17:06:05,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:05,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1987 transitions. [2019-09-16 17:06:05,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-16 17:06:05,756 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:05,756 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:05,756 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:05,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:05,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1999755179, now seen corresponding path program 1 times [2019-09-16 17:06:05,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:05,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:05,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:05,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:05,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:06,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:06:06,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:06:06,528 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2019-09-16 17:06:06,534 INFO L207 CegarAbsIntRunner]: [0], [43], [48], [50], [61], [63], [67], [76], [78], [83], [88], [93], [98], [103], [108], [113], [118], [121], [123], [128], [133], [136], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [193], [198], [203], [208], [213], [218], [221], [223], [228], [231], [233], [238], [241], [312], [315], [323], [325], [328], [336], [339], [343], [523], [526], [542], [547], [550], [558], [563], [565], [568], [586], [589], [593], [614], [648], [650], [662], [665], [666], [678], [686], [687], [688] [2019-09-16 17:06:06,612 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:06:06,612 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:06:06,680 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:06:06,681 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-16 17:06:06,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:06,687 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:06:06,783 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-16 17:06:06,784 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:06:06,794 INFO L420 sIntCurrentIteration]: We unified 169 AI predicates to 169 [2019-09-16 17:06:06,794 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:06:06,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:06:06,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-09-16 17:06:06,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:06,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 17:06:06,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 17:06:06,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:06:06,797 INFO L87 Difference]: Start difference. First operand 1382 states and 1987 transitions. Second operand 2 states. [2019-09-16 17:06:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:06,798 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-16 17:06:06,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 17:06:06,798 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 170 [2019-09-16 17:06:06,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:06,798 INFO L225 Difference]: With dead ends: 2 [2019-09-16 17:06:06,798 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:06:06,798 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:06:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:06:06,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:06:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:06:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:06:06,799 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 170 [2019-09-16 17:06:06,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:06,799 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:06:06,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 17:06:06,799 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:06:06,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:06:06,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:06:06 BoogieIcfgContainer [2019-09-16 17:06:06,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:06:06,807 INFO L168 Benchmark]: Toolchain (without parser) took 34566.35 ms. Allocated memory was 138.4 MB in the beginning and 667.4 MB in the end (delta: 529.0 MB). Free memory was 84.1 MB in the beginning and 182.5 MB in the end (delta: -98.4 MB). Peak memory consumption was 430.6 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:06,807 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory was 104.4 MB in the beginning and 104.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:06:06,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1117.77 ms. Allocated memory was 138.4 MB in the beginning and 198.7 MB in the end (delta: 60.3 MB). Free memory was 83.7 MB in the beginning and 155.3 MB in the end (delta: -71.6 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:06,809 INFO L168 Benchmark]: Boogie Preprocessor took 153.99 ms. Allocated memory is still 198.7 MB. Free memory was 155.3 MB in the beginning and 146.8 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:06,809 INFO L168 Benchmark]: RCFGBuilder took 1267.21 ms. Allocated memory was 198.7 MB in the beginning and 220.7 MB in the end (delta: 22.0 MB). Free memory was 146.8 MB in the beginning and 164.9 MB in the end (delta: -18.0 MB). Peak memory consumption was 84.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:06,811 INFO L168 Benchmark]: TraceAbstraction took 32021.71 ms. Allocated memory was 220.7 MB in the beginning and 667.4 MB in the end (delta: 446.7 MB). Free memory was 163.5 MB in the beginning and 182.5 MB in the end (delta: -19.0 MB). Peak memory consumption was 427.7 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:06,814 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.24 ms. Allocated memory is still 138.4 MB. Free memory was 104.4 MB in the beginning and 104.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1117.77 ms. Allocated memory was 138.4 MB in the beginning and 198.7 MB in the end (delta: 60.3 MB). Free memory was 83.7 MB in the beginning and 155.3 MB in the end (delta: -71.6 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 153.99 ms. Allocated memory is still 198.7 MB. Free memory was 155.3 MB in the beginning and 146.8 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1267.21 ms. Allocated memory was 198.7 MB in the beginning and 220.7 MB in the end (delta: 22.0 MB). Free memory was 146.8 MB in the beginning and 164.9 MB in the end (delta: -18.0 MB). Peak memory consumption was 84.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32021.71 ms. Allocated memory was 220.7 MB in the beginning and 667.4 MB in the end (delta: 446.7 MB). Free memory was 163.5 MB in the beginning and 182.5 MB in the end (delta: -19.0 MB). Peak memory consumption was 427.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1726]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 186 locations, 1 error locations. SAFE Result, 31.9s OverallTime, 67 OverallIterations, 5 TraceHistogramMax, 23.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15117 SDtfs, 4539 SDslu, 21251 SDs, 0 SdLazy, 12780 SolverSat, 521 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 530 GetRequests, 307 SyntacticMatches, 34 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1382occurred in iteration=66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.2603550295857988 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 67 MinimizatonAttempts, 6596 StatesRemovedByMinimization, 65 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 7175 NumberOfCodeBlocks, 7175 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 7108 ConstructedInterpolants, 0 QuantifiedInterpolants, 2744487 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 66 PerfectInterpolantSequences, 5778/5963 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...