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.07.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:05:16,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:05:16,077 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:05:16,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:05:16,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:05:16,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:05:16,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:05:16,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:05:16,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:05:16,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:05:16,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:05:16,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:05:16,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:05:16,114 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:05:16,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:05:16,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:05:16,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:05:16,122 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:05:16,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:05:16,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:05:16,127 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:05:16,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:05:16,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:05:16,130 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:05:16,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:05:16,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:05:16,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:05:16,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:05:16,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:05:16,136 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:05:16,136 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:05:16,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:05:16,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:05:16,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:05:16,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:05:16,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:05:16,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:05:16,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:05:16,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:05:16,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:05:16,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:05:16,144 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:16,159 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:05:16,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:05:16,160 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:05:16,160 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:05:16,161 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:05:16,161 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:05:16,161 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:05:16,161 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:05:16,162 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:05:16,162 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:05:16,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:05:16,163 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:05:16,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:05:16,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:05:16,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:05:16,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:05:16,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:05:16,164 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:05:16,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:05:16,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:05:16,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:05:16,165 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:05:16,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:05:16,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:05:16,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:05:16,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:05:16,166 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:05:16,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:05:16,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:05:16,167 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:05:16,211 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:05:16,229 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:05:16,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:05:16,235 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:05:16,236 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:05:16,236 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.07.i.cil-1.c [2019-09-16 17:05:16,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df8a60876/0f73441c5a44474782dca6355778eb83/FLAGf6450f309 [2019-09-16 17:05:16,958 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:05:16,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.07.i.cil-1.c [2019-09-16 17:05:16,985 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df8a60876/0f73441c5a44474782dca6355778eb83/FLAGf6450f309 [2019-09-16 17:05:17,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df8a60876/0f73441c5a44474782dca6355778eb83 [2019-09-16 17:05:17,201 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:05:17,202 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:05:17,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:05:17,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:05:17,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:05:17,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:05:17" (1/1) ... [2019-09-16 17:05:17,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f05bdf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:17, skipping insertion in model container [2019-09-16 17:05:17,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:05:17" (1/1) ... [2019-09-16 17:05:17,222 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:05:17,304 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:05:17,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:05:17,944 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:05:18,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:05:18,243 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:05:18,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:18 WrapperNode [2019-09-16 17:05:18,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:05:18,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:05:18,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:05:18,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:05:18,267 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:18" (1/1) ... [2019-09-16 17:05:18,269 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:18" (1/1) ... [2019-09-16 17:05:18,320 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:18" (1/1) ... [2019-09-16 17:05:18,321 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:18" (1/1) ... [2019-09-16 17:05:18,401 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:18" (1/1) ... [2019-09-16 17:05:18,412 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:18" (1/1) ... [2019-09-16 17:05:18,418 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:18" (1/1) ... [2019-09-16 17:05:18,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:05:18,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:05:18,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:05:18,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:05:18,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:18" (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:18,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:05:18,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:05:18,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-16 17:05:18,525 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-16 17:05:18,525 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:05:18,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-16 17:05:18,526 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-16 17:05:18,526 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-16 17:05:18,527 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-16 17:05:18,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:05:18,527 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 17:05:18,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 17:05:18,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:05:18,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:05:18,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:05:18,530 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-16 17:05:18,530 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-16 17:05:18,530 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-16 17:05:18,531 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-16 17:05:18,531 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-16 17:05:18,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-16 17:05:18,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:05:18,532 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:05:18,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 17:05:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:05:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:05:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:05:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 17:05:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-16 17:05:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:05:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:05:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:05:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:05:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:05:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-16 17:05:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-16 17:05:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-16 17:05:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-16 17:05:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:05:19,038 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:05:19,789 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-16 17:05:19,789 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-16 17:05:19,809 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:05:19,810 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:05:19,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:05:19 BoogieIcfgContainer [2019-09-16 17:05:19,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:05:19,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:05:19,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:05:19,816 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:05:19,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:05:17" (1/3) ... [2019-09-16 17:05:19,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f5c6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:05:19, skipping insertion in model container [2019-09-16 17:05:19,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:18" (2/3) ... [2019-09-16 17:05:19,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f5c6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:05:19, skipping insertion in model container [2019-09-16 17:05:19,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:05:19" (3/3) ... [2019-09-16 17:05:19,819 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07.i.cil-1.c [2019-09-16 17:05:19,830 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:05:19,839 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:05:19,857 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:05:19,885 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:05:19,885 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:05:19,885 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:05:19,885 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:05:19,886 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:05:19,886 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:05:19,886 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:05:19,886 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:05:19,906 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2019-09-16 17:05:19,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-16 17:05:19,922 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:19,923 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:19,926 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:19,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:19,933 INFO L82 PathProgramCache]: Analyzing trace with hash 514312201, now seen corresponding path program 1 times [2019-09-16 17:05:19,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:20,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:20,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:20,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:20,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:20,357 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:20,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:20,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:20,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:20,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:20,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:20,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:20,384 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2019-09-16 17:05:20,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:20,893 INFO L93 Difference]: Finished difference Result 190 states and 310 transitions. [2019-09-16 17:05:20,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:20,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-16 17:05:20,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:20,909 INFO L225 Difference]: With dead ends: 190 [2019-09-16 17:05:20,909 INFO L226 Difference]: Without dead ends: 169 [2019-09-16 17:05:20,911 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:20,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-16 17:05:20,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-16 17:05:20,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-16 17:05:20,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2019-09-16 17:05:20,966 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 41 [2019-09-16 17:05:20,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:20,967 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2019-09-16 17:05:20,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:20,968 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2019-09-16 17:05:20,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-16 17:05:20,970 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:20,971 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:20,971 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:20,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:20,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1818416469, now seen corresponding path program 1 times [2019-09-16 17:05:20,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:20,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:20,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:20,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:20,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:21,155 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:21,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:21,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:21,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:21,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:21,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:21,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:21,163 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2019-09-16 17:05:21,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:21,603 INFO L93 Difference]: Finished difference Result 169 states and 252 transitions. [2019-09-16 17:05:21,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:21,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-09-16 17:05:21,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:21,607 INFO L225 Difference]: With dead ends: 169 [2019-09-16 17:05:21,607 INFO L226 Difference]: Without dead ends: 169 [2019-09-16 17:05:21,608 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:21,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-16 17:05:21,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-16 17:05:21,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-16 17:05:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2019-09-16 17:05:21,626 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 54 [2019-09-16 17:05:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:21,627 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2019-09-16 17:05:21,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:21,627 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2019-09-16 17:05:21,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-16 17:05:21,629 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:21,629 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:21,629 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:21,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:21,630 INFO L82 PathProgramCache]: Analyzing trace with hash 737556739, now seen corresponding path program 1 times [2019-09-16 17:05:21,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:21,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:21,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:21,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:21,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:21,714 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:21,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:21,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:21,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:21,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:21,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:21,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:21,716 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 4 states. [2019-09-16 17:05:22,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:22,024 INFO L93 Difference]: Finished difference Result 168 states and 250 transitions. [2019-09-16 17:05:22,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:22,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-16 17:05:22,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:22,026 INFO L225 Difference]: With dead ends: 168 [2019-09-16 17:05:22,027 INFO L226 Difference]: Without dead ends: 168 [2019-09-16 17:05:22,027 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:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-16 17:05:22,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 152. [2019-09-16 17:05:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-16 17:05:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 230 transitions. [2019-09-16 17:05:22,038 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 230 transitions. Word has length 55 [2019-09-16 17:05:22,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:22,038 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 230 transitions. [2019-09-16 17:05:22,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 230 transitions. [2019-09-16 17:05:22,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-16 17:05:22,041 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:22,041 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:22,041 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:22,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:22,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1603135895, now seen corresponding path program 1 times [2019-09-16 17:05:22,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:22,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:22,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:22,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:22,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:22,160 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:22,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:22,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:05:22,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:22,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:05:22,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:05:22,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:22,163 INFO L87 Difference]: Start difference. First operand 152 states and 230 transitions. Second operand 5 states. [2019-09-16 17:05:22,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:22,658 INFO L93 Difference]: Finished difference Result 173 states and 258 transitions. [2019-09-16 17:05:22,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:05:22,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-16 17:05:22,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:22,660 INFO L225 Difference]: With dead ends: 173 [2019-09-16 17:05:22,661 INFO L226 Difference]: Without dead ends: 173 [2019-09-16 17:05:22,661 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:22,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-16 17:05:22,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-09-16 17:05:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2019-09-16 17:05:22,672 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 55 [2019-09-16 17:05:22,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:22,672 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2019-09-16 17:05:22,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:05:22,673 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2019-09-16 17:05:22,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-16 17:05:22,675 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:22,675 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:22,676 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:22,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:22,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1781246799, now seen corresponding path program 1 times [2019-09-16 17:05:22,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:22,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:22,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:22,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:22,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:22,786 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:22,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:22,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:22,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:22,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:22,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:22,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:22,808 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2019-09-16 17:05:23,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:23,098 INFO L93 Difference]: Finished difference Result 187 states and 274 transitions. [2019-09-16 17:05:23,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:23,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-16 17:05:23,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:23,100 INFO L225 Difference]: With dead ends: 187 [2019-09-16 17:05:23,100 INFO L226 Difference]: Without dead ends: 187 [2019-09-16 17:05:23,101 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:23,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-16 17:05:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2019-09-16 17:05:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2019-09-16 17:05:23,109 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 55 [2019-09-16 17:05:23,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:23,109 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2019-09-16 17:05:23,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:23,110 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2019-09-16 17:05:23,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-16 17:05:23,111 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:23,111 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:23,112 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:23,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:23,112 INFO L82 PathProgramCache]: Analyzing trace with hash -870189042, now seen corresponding path program 1 times [2019-09-16 17:05:23,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:23,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:23,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:23,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:23,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:23,224 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:23,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:23,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:23,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:23,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:23,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:23,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:23,231 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2019-09-16 17:05:23,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:23,516 INFO L93 Difference]: Finished difference Result 185 states and 271 transitions. [2019-09-16 17:05:23,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:23,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-16 17:05:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:23,518 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:05:23,518 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:05:23,519 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:23,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:05:23,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:05:23,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2019-09-16 17:05:23,525 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 55 [2019-09-16 17:05:23,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:23,526 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2019-09-16 17:05:23,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:23,526 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2019-09-16 17:05:23,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-16 17:05:23,527 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:23,528 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:23,528 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:23,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:23,528 INFO L82 PathProgramCache]: Analyzing trace with hash 987281320, now seen corresponding path program 1 times [2019-09-16 17:05:23,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:23,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:23,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:23,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:23,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:23,593 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:23,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:23,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:23,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:23,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:23,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:23,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:23,595 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand 4 states. [2019-09-16 17:05:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:23,879 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2019-09-16 17:05:23,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:23,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-09-16 17:05:23,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:23,881 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:05:23,882 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:05:23,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:23,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:05:23,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:05:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 254 transitions. [2019-09-16 17:05:23,888 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 254 transitions. Word has length 56 [2019-09-16 17:05:23,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:23,889 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 254 transitions. [2019-09-16 17:05:23,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:23,889 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 254 transitions. [2019-09-16 17:05:23,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-16 17:05:23,890 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:23,890 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:23,891 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:23,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:23,891 INFO L82 PathProgramCache]: Analyzing trace with hash -365258357, now seen corresponding path program 1 times [2019-09-16 17:05:23,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:23,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:23,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:23,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:23,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:23,945 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:23,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:23,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:23,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:23,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:23,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:23,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:23,947 INFO L87 Difference]: Start difference. First operand 172 states and 254 transitions. Second operand 4 states. [2019-09-16 17:05:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:24,250 INFO L93 Difference]: Finished difference Result 185 states and 269 transitions. [2019-09-16 17:05:24,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:24,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-09-16 17:05:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:24,252 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:05:24,252 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:05:24,252 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:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:05:24,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:05:24,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:24,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2019-09-16 17:05:24,259 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 57 [2019-09-16 17:05:24,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:24,259 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2019-09-16 17:05:24,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:24,260 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2019-09-16 17:05:24,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-16 17:05:24,260 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:24,261 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:24,261 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:24,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:24,261 INFO L82 PathProgramCache]: Analyzing trace with hash -626349981, now seen corresponding path program 1 times [2019-09-16 17:05:24,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:24,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:24,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:24,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:24,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:24,321 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:24,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:24,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:24,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:24,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:24,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:24,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:24,323 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 4 states. [2019-09-16 17:05:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:24,595 INFO L93 Difference]: Finished difference Result 185 states and 268 transitions. [2019-09-16 17:05:24,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:24,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-16 17:05:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:24,597 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:05:24,597 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:05:24,597 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:24,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:05:24,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:05:24,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 252 transitions. [2019-09-16 17:05:24,603 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 252 transitions. Word has length 58 [2019-09-16 17:05:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:24,603 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 252 transitions. [2019-09-16 17:05:24,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 252 transitions. [2019-09-16 17:05:24,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-16 17:05:24,604 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:24,604 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:24,605 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:24,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:24,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1341820354, now seen corresponding path program 1 times [2019-09-16 17:05:24,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:24,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:24,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:24,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:24,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:24,687 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:24,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:24,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:24,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:24,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:24,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:24,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:24,689 INFO L87 Difference]: Start difference. First operand 172 states and 252 transitions. Second operand 4 states. [2019-09-16 17:05:25,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:25,056 INFO L93 Difference]: Finished difference Result 214 states and 314 transitions. [2019-09-16 17:05:25,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:25,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-16 17:05:25,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:25,059 INFO L225 Difference]: With dead ends: 214 [2019-09-16 17:05:25,060 INFO L226 Difference]: Without dead ends: 214 [2019-09-16 17:05:25,060 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:25,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-16 17:05:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-16 17:05:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2019-09-16 17:05:25,066 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 58 [2019-09-16 17:05:25,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:25,067 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2019-09-16 17:05:25,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:25,067 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2019-09-16 17:05:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-16 17:05:25,068 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:25,068 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:25,068 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:25,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:25,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1412290330, now seen corresponding path program 1 times [2019-09-16 17:05:25,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:25,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:25,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:25,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:25,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:25,122 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:25,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:25,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:25,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:25,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:25,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:25,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:25,124 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 4 states. [2019-09-16 17:05:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:25,372 INFO L93 Difference]: Finished difference Result 197 states and 292 transitions. [2019-09-16 17:05:25,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:25,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-09-16 17:05:25,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:25,375 INFO L225 Difference]: With dead ends: 197 [2019-09-16 17:05:25,375 INFO L226 Difference]: Without dead ends: 197 [2019-09-16 17:05:25,376 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:25,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-16 17:05:25,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2019-09-16 17:05:25,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2019-09-16 17:05:25,381 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 59 [2019-09-16 17:05:25,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:25,382 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2019-09-16 17:05:25,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:25,382 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2019-09-16 17:05:25,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-16 17:05:25,383 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:25,383 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:25,383 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:25,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:25,384 INFO L82 PathProgramCache]: Analyzing trace with hash 2096707986, now seen corresponding path program 1 times [2019-09-16 17:05:25,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:25,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:25,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:25,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:25,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:25,447 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:25,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:25,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:25,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:25,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:25,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:25,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:25,449 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand 4 states. [2019-09-16 17:05:25,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:25,785 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2019-09-16 17:05:25,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:25,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-09-16 17:05:25,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:25,788 INFO L225 Difference]: With dead ends: 214 [2019-09-16 17:05:25,788 INFO L226 Difference]: Without dead ends: 214 [2019-09-16 17:05:25,788 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:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-16 17:05:25,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-16 17:05:25,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2019-09-16 17:05:25,794 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 71 [2019-09-16 17:05:25,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:25,795 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2019-09-16 17:05:25,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2019-09-16 17:05:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-16 17:05:25,796 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:25,796 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:25,796 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:25,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:25,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1403946680, now seen corresponding path program 1 times [2019-09-16 17:05:25,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:25,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:25,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:25,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:25,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:25,849 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:25,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:25,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:25,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:25,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:25,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:25,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:25,851 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 4 states. [2019-09-16 17:05:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:26,125 INFO L93 Difference]: Finished difference Result 213 states and 310 transitions. [2019-09-16 17:05:26,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:26,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-16 17:05:26,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:26,128 INFO L225 Difference]: With dead ends: 213 [2019-09-16 17:05:26,128 INFO L226 Difference]: Without dead ends: 213 [2019-09-16 17:05:26,129 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:26,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-16 17:05:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2019-09-16 17:05:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2019-09-16 17:05:26,135 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 72 [2019-09-16 17:05:26,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:26,136 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2019-09-16 17:05:26,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2019-09-16 17:05:26,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-16 17:05:26,137 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:26,137 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:26,138 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:26,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:26,138 INFO L82 PathProgramCache]: Analyzing trace with hash 239584775, now seen corresponding path program 1 times [2019-09-16 17:05:26,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:26,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:26,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:26,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:26,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:26,198 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:26,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:26,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:26,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:26,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:26,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:26,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:26,200 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand 4 states. [2019-09-16 17:05:26,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:26,460 INFO L93 Difference]: Finished difference Result 211 states and 307 transitions. [2019-09-16 17:05:26,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:26,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-16 17:05:26,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:26,462 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:05:26,462 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:05:26,463 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:26,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:05:26,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:05:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:26,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2019-09-16 17:05:26,469 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 72 [2019-09-16 17:05:26,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:26,469 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2019-09-16 17:05:26,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:26,470 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2019-09-16 17:05:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-16 17:05:26,471 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:26,471 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:26,471 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:26,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:26,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1030531279, now seen corresponding path program 1 times [2019-09-16 17:05:26,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:26,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:26,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:26,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:26,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:26,568 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:26,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:26,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:26,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:26,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:26,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:26,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:26,569 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand 4 states. [2019-09-16 17:05:26,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:26,849 INFO L93 Difference]: Finished difference Result 211 states and 306 transitions. [2019-09-16 17:05:26,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:26,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-16 17:05:26,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:26,851 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:05:26,851 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:05:26,852 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:26,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:05:26,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:05:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:26,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2019-09-16 17:05:26,858 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 73 [2019-09-16 17:05:26,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:26,858 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2019-09-16 17:05:26,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:26,858 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2019-09-16 17:05:26,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-16 17:05:26,859 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:26,860 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:26,860 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:26,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:26,860 INFO L82 PathProgramCache]: Analyzing trace with hash 975490372, now seen corresponding path program 1 times [2019-09-16 17:05:26,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:26,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:26,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:26,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:26,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:26,929 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:26,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:26,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:26,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:26,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:26,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:26,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:26,931 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 4 states. [2019-09-16 17:05:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:27,249 INFO L93 Difference]: Finished difference Result 211 states and 305 transitions. [2019-09-16 17:05:27,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:27,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-09-16 17:05:27,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:27,251 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:05:27,252 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:05:27,252 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:27,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:05:27,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:05:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:27,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2019-09-16 17:05:27,261 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 74 [2019-09-16 17:05:27,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:27,262 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2019-09-16 17:05:27,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:27,262 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2019-09-16 17:05:27,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-16 17:05:27,264 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:27,264 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:27,265 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:27,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:27,265 INFO L82 PathProgramCache]: Analyzing trace with hash -2012812342, now seen corresponding path program 1 times [2019-09-16 17:05:27,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:27,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:27,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:27,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:27,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:27,345 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:27,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:27,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:27,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:27,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:27,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:27,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:27,347 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 4 states. [2019-09-16 17:05:27,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:27,629 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2019-09-16 17:05:27,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:27,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-16 17:05:27,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:27,632 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:05:27,632 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:05:27,633 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:27,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:05:27,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:05:27,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2019-09-16 17:05:27,640 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 75 [2019-09-16 17:05:27,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:27,640 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2019-09-16 17:05:27,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2019-09-16 17:05:27,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-16 17:05:27,641 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:27,642 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:27,643 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:27,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:27,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1442950561, now seen corresponding path program 1 times [2019-09-16 17:05:27,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:27,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:27,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:27,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:27,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:27,728 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:27,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:27,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:27,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:27,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:27,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:27,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:27,730 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand 4 states. [2019-09-16 17:05:27,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:27,983 INFO L93 Difference]: Finished difference Result 201 states and 291 transitions. [2019-09-16 17:05:27,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:27,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-09-16 17:05:27,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:27,985 INFO L225 Difference]: With dead ends: 201 [2019-09-16 17:05:27,985 INFO L226 Difference]: Without dead ends: 201 [2019-09-16 17:05:27,986 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:27,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-16 17:05:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2019-09-16 17:05:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2019-09-16 17:05:27,991 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 76 [2019-09-16 17:05:27,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:27,991 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2019-09-16 17:05:27,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2019-09-16 17:05:27,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:05:27,993 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:27,993 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:27,993 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:27,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:27,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1893403063, now seen corresponding path program 1 times [2019-09-16 17:05:27,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:27,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:27,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:27,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:27,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:28,123 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:28,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:28,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:28,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:28,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:28,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:28,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:28,125 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 4 states. [2019-09-16 17:05:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:28,716 INFO L93 Difference]: Finished difference Result 298 states and 438 transitions. [2019-09-16 17:05:28,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:28,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:05:28,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:28,719 INFO L225 Difference]: With dead ends: 298 [2019-09-16 17:05:28,719 INFO L226 Difference]: Without dead ends: 298 [2019-09-16 17:05:28,719 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:28,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-16 17:05:28,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 224. [2019-09-16 17:05:28,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-16 17:05:28,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2019-09-16 17:05:28,726 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 80 [2019-09-16 17:05:28,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:28,727 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2019-09-16 17:05:28,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:28,727 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2019-09-16 17:05:28,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:05:28,728 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:28,728 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:28,728 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:28,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:28,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1821016505, now seen corresponding path program 1 times [2019-09-16 17:05:28,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:28,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:28,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:28,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:28,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:28,795 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:28,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:28,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:28,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:28,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:28,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:28,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:28,798 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand 4 states. [2019-09-16 17:05:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:29,151 INFO L93 Difference]: Finished difference Result 273 states and 405 transitions. [2019-09-16 17:05:29,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:29,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:05:29,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:29,154 INFO L225 Difference]: With dead ends: 273 [2019-09-16 17:05:29,154 INFO L226 Difference]: Without dead ends: 273 [2019-09-16 17:05:29,154 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:29,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-09-16 17:05:29,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 248. [2019-09-16 17:05:29,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-16 17:05:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2019-09-16 17:05:29,161 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 80 [2019-09-16 17:05:29,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:29,162 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2019-09-16 17:05:29,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:29,162 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2019-09-16 17:05:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:29,163 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:29,163 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:29,163 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:29,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:29,164 INFO L82 PathProgramCache]: Analyzing trace with hash -852863592, now seen corresponding path program 1 times [2019-09-16 17:05:29,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:29,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:29,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:29,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:29,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:29,230 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:29,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:29,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:29,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:29,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:29,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:29,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:29,231 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand 4 states. [2019-09-16 17:05:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:29,611 INFO L93 Difference]: Finished difference Result 314 states and 465 transitions. [2019-09-16 17:05:29,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:29,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:05:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:29,614 INFO L225 Difference]: With dead ends: 314 [2019-09-16 17:05:29,614 INFO L226 Difference]: Without dead ends: 314 [2019-09-16 17:05:29,614 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:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-16 17:05:29,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 249. [2019-09-16 17:05:29,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-16 17:05:29,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 374 transitions. [2019-09-16 17:05:29,621 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 374 transitions. Word has length 81 [2019-09-16 17:05:29,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:29,622 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 374 transitions. [2019-09-16 17:05:29,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 374 transitions. [2019-09-16 17:05:29,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-16 17:05:29,623 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:29,623 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:29,623 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:29,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:29,624 INFO L82 PathProgramCache]: Analyzing trace with hash 69064469, now seen corresponding path program 1 times [2019-09-16 17:05:29,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:29,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:29,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:29,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:29,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:29,699 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:29,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:29,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:29,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:29,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:29,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:29,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:29,702 INFO L87 Difference]: Start difference. First operand 249 states and 374 transitions. Second operand 4 states. [2019-09-16 17:05:30,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:30,194 INFO L93 Difference]: Finished difference Result 314 states and 464 transitions. [2019-09-16 17:05:30,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:30,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-16 17:05:30,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:30,200 INFO L225 Difference]: With dead ends: 314 [2019-09-16 17:05:30,200 INFO L226 Difference]: Without dead ends: 314 [2019-09-16 17:05:30,200 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:30,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-16 17:05:30,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 259. [2019-09-16 17:05:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-16 17:05:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2019-09-16 17:05:30,209 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 86 [2019-09-16 17:05:30,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:30,209 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2019-09-16 17:05:30,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:30,209 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2019-09-16 17:05:30,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-16 17:05:30,210 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:30,211 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:30,211 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:30,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:30,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2133991217, now seen corresponding path program 1 times [2019-09-16 17:05:30,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:30,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:30,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:30,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:30,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:30,323 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:30,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:30,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:30,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:30,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:30,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:30,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:30,324 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2019-09-16 17:05:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:30,765 INFO L93 Difference]: Finished difference Result 308 states and 456 transitions. [2019-09-16 17:05:30,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:30,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-16 17:05:30,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:30,767 INFO L225 Difference]: With dead ends: 308 [2019-09-16 17:05:30,767 INFO L226 Difference]: Without dead ends: 308 [2019-09-16 17:05:30,767 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:30,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-16 17:05:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2019-09-16 17:05:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:30,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2019-09-16 17:05:30,772 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 87 [2019-09-16 17:05:30,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:30,772 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2019-09-16 17:05:30,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2019-09-16 17:05:30,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-16 17:05:30,774 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:30,774 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:30,774 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:30,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:30,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2126867523, now seen corresponding path program 1 times [2019-09-16 17:05:30,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:30,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:30,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:30,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:30,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:30,883 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:30,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:30,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:30,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:30,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:30,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:30,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:30,885 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2019-09-16 17:05:31,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:31,303 INFO L93 Difference]: Finished difference Result 308 states and 455 transitions. [2019-09-16 17:05:31,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:31,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-16 17:05:31,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:31,306 INFO L225 Difference]: With dead ends: 308 [2019-09-16 17:05:31,306 INFO L226 Difference]: Without dead ends: 308 [2019-09-16 17:05:31,307 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:31,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-16 17:05:31,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2019-09-16 17:05:31,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:31,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2019-09-16 17:05:31,313 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 93 [2019-09-16 17:05:31,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:31,314 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2019-09-16 17:05:31,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2019-09-16 17:05:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-16 17:05:31,315 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:31,315 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:31,315 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:31,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:31,316 INFO L82 PathProgramCache]: Analyzing trace with hash -198594821, now seen corresponding path program 1 times [2019-09-16 17:05:31,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:31,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:31,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:31,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:31,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:31,380 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:31,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:31,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:31,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:31,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:31,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:31,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:31,382 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2019-09-16 17:05:31,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:31,696 INFO L93 Difference]: Finished difference Result 285 states and 424 transitions. [2019-09-16 17:05:31,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:31,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-16 17:05:31,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:31,698 INFO L225 Difference]: With dead ends: 285 [2019-09-16 17:05:31,699 INFO L226 Difference]: Without dead ends: 285 [2019-09-16 17:05:31,699 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:31,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-16 17:05:31,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2019-09-16 17:05:31,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:31,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2019-09-16 17:05:31,705 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 93 [2019-09-16 17:05:31,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:31,706 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2019-09-16 17:05:31,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:31,706 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2019-09-16 17:05:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-16 17:05:31,708 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:31,708 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:31,708 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:31,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:31,709 INFO L82 PathProgramCache]: Analyzing trace with hash 809198717, now seen corresponding path program 1 times [2019-09-16 17:05:31,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:31,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:31,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:31,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:31,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:31,770 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:31,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:31,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:31,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:31,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:31,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:31,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:31,772 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2019-09-16 17:05:32,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:32,147 INFO L93 Difference]: Finished difference Result 307 states and 452 transitions. [2019-09-16 17:05:32,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:32,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-16 17:05:32,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:32,149 INFO L225 Difference]: With dead ends: 307 [2019-09-16 17:05:32,150 INFO L226 Difference]: Without dead ends: 307 [2019-09-16 17:05:32,150 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:32,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-16 17:05:32,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-16 17:05:32,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:32,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2019-09-16 17:05:32,157 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 94 [2019-09-16 17:05:32,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:32,157 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2019-09-16 17:05:32,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:32,157 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2019-09-16 17:05:32,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-16 17:05:32,158 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:32,159 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:32,159 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:32,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:32,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1842237124, now seen corresponding path program 1 times [2019-09-16 17:05:32,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:32,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:32,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:32,220 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:32,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:32,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:32,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:32,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:32,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:32,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:32,221 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2019-09-16 17:05:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:32,599 INFO L93 Difference]: Finished difference Result 305 states and 449 transitions. [2019-09-16 17:05:32,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:32,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-16 17:05:32,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:32,602 INFO L225 Difference]: With dead ends: 305 [2019-09-16 17:05:32,603 INFO L226 Difference]: Without dead ends: 305 [2019-09-16 17:05:32,603 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:32,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-16 17:05:32,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2019-09-16 17:05:32,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2019-09-16 17:05:32,609 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 94 [2019-09-16 17:05:32,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:32,609 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2019-09-16 17:05:32,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:32,610 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2019-09-16 17:05:32,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-16 17:05:32,611 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:32,611 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:32,611 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:32,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:32,612 INFO L82 PathProgramCache]: Analyzing trace with hash 456110335, now seen corresponding path program 1 times [2019-09-16 17:05:32,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:32,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:32,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:32,687 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:32,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:32,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:32,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:32,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:32,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:32,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:32,689 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2019-09-16 17:05:33,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:33,068 INFO L93 Difference]: Finished difference Result 284 states and 420 transitions. [2019-09-16 17:05:33,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:33,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-16 17:05:33,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:33,071 INFO L225 Difference]: With dead ends: 284 [2019-09-16 17:05:33,071 INFO L226 Difference]: Without dead ends: 284 [2019-09-16 17:05:33,071 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:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-16 17:05:33,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2019-09-16 17:05:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2019-09-16 17:05:33,079 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 94 [2019-09-16 17:05:33,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:33,080 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2019-09-16 17:05:33,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:33,080 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2019-09-16 17:05:33,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-16 17:05:33,081 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:33,082 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:33,082 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:33,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:33,083 INFO L82 PathProgramCache]: Analyzing trace with hash 2099641790, now seen corresponding path program 1 times [2019-09-16 17:05:33,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:33,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:33,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:33,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:33,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:33,185 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:33,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:33,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:33,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:33,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:33,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:33,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:33,188 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2019-09-16 17:05:33,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:33,584 INFO L93 Difference]: Finished difference Result 282 states and 417 transitions. [2019-09-16 17:05:33,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:33,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-16 17:05:33,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:33,587 INFO L225 Difference]: With dead ends: 282 [2019-09-16 17:05:33,588 INFO L226 Difference]: Without dead ends: 282 [2019-09-16 17:05:33,588 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:33,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-16 17:05:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-16 17:05:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:33,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2019-09-16 17:05:33,601 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 94 [2019-09-16 17:05:33,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:33,602 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2019-09-16 17:05:33,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:33,602 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2019-09-16 17:05:33,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-16 17:05:33,604 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:33,604 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:33,604 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:33,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:33,605 INFO L82 PathProgramCache]: Analyzing trace with hash 918561850, now seen corresponding path program 1 times [2019-09-16 17:05:33,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:33,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:33,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:33,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:33,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:33,675 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:33,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:33,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:33,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:33,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:33,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:33,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:33,677 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2019-09-16 17:05:34,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:34,030 INFO L93 Difference]: Finished difference Result 305 states and 446 transitions. [2019-09-16 17:05:34,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:34,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-16 17:05:34,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:34,032 INFO L225 Difference]: With dead ends: 305 [2019-09-16 17:05:34,032 INFO L226 Difference]: Without dead ends: 305 [2019-09-16 17:05:34,032 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:34,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-16 17:05:34,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2019-09-16 17:05:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2019-09-16 17:05:34,038 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 95 [2019-09-16 17:05:34,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:34,039 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2019-09-16 17:05:34,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:34,039 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2019-09-16 17:05:34,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-16 17:05:34,040 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:34,040 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:34,040 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:34,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:34,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1437243400, now seen corresponding path program 1 times [2019-09-16 17:05:34,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:34,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:34,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:34,093 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:34,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:34,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:34,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:34,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:34,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:34,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:34,095 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 4 states. [2019-09-16 17:05:34,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:34,363 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2019-09-16 17:05:34,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:34,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-16 17:05:34,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:34,366 INFO L225 Difference]: With dead ends: 282 [2019-09-16 17:05:34,366 INFO L226 Difference]: Without dead ends: 282 [2019-09-16 17:05:34,367 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:34,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-16 17:05:34,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-16 17:05:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 386 transitions. [2019-09-16 17:05:34,372 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 386 transitions. Word has length 95 [2019-09-16 17:05:34,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:34,373 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 386 transitions. [2019-09-16 17:05:34,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:34,373 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 386 transitions. [2019-09-16 17:05:34,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-16 17:05:34,374 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:34,374 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:34,374 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:34,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:34,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1799405369, now seen corresponding path program 1 times [2019-09-16 17:05:34,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:34,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:34,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:34,440 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:34,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:34,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:34,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:34,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:34,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:34,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:34,442 INFO L87 Difference]: Start difference. First operand 260 states and 386 transitions. Second operand 4 states. [2019-09-16 17:05:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:34,812 INFO L93 Difference]: Finished difference Result 305 states and 444 transitions. [2019-09-16 17:05:34,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:34,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-16 17:05:34,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:34,814 INFO L225 Difference]: With dead ends: 305 [2019-09-16 17:05:34,815 INFO L226 Difference]: Without dead ends: 305 [2019-09-16 17:05:34,815 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:34,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-16 17:05:34,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2019-09-16 17:05:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 385 transitions. [2019-09-16 17:05:34,822 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 385 transitions. Word has length 96 [2019-09-16 17:05:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:34,822 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 385 transitions. [2019-09-16 17:05:34,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 385 transitions. [2019-09-16 17:05:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-16 17:05:34,823 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:34,824 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:34,824 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:34,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:34,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1783886651, now seen corresponding path program 1 times [2019-09-16 17:05:34,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:34,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:34,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:34,909 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:34,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:34,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:34,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:34,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:34,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:34,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:34,915 INFO L87 Difference]: Start difference. First operand 260 states and 385 transitions. Second operand 4 states. [2019-09-16 17:05:35,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:35,261 INFO L93 Difference]: Finished difference Result 282 states and 413 transitions. [2019-09-16 17:05:35,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:35,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-16 17:05:35,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:35,264 INFO L225 Difference]: With dead ends: 282 [2019-09-16 17:05:35,264 INFO L226 Difference]: Without dead ends: 282 [2019-09-16 17:05:35,265 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,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-16 17:05:35,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-16 17:05:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:35,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2019-09-16 17:05:35,273 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 96 [2019-09-16 17:05:35,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:35,274 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2019-09-16 17:05:35,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:35,274 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2019-09-16 17:05:35,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-16 17:05:35,276 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:35,276 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:35,277 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:35,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:35,277 INFO L82 PathProgramCache]: Analyzing trace with hash 2053716085, now seen corresponding path program 1 times [2019-09-16 17:05:35,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:35,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:35,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:35,355 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:35,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:35,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:35,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:35,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:35,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:35,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:35,357 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand 4 states. [2019-09-16 17:05:35,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:35,758 INFO L93 Difference]: Finished difference Result 305 states and 442 transitions. [2019-09-16 17:05:35,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:35,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-16 17:05:35,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:35,761 INFO L225 Difference]: With dead ends: 305 [2019-09-16 17:05:35,761 INFO L226 Difference]: Without dead ends: 305 [2019-09-16 17:05:35,761 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,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-16 17:05:35,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2019-09-16 17:05:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2019-09-16 17:05:35,766 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 97 [2019-09-16 17:05:35,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:35,767 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2019-09-16 17:05:35,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2019-09-16 17:05:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-16 17:05:35,768 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:35,768 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:35,768 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:35,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:35,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1572635827, now seen corresponding path program 1 times [2019-09-16 17:05:35,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:35,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:35,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:35,825 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:35,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:35,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:35,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:35,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:35,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:35,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:35,827 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand 4 states. [2019-09-16 17:05:36,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:36,115 INFO L93 Difference]: Finished difference Result 282 states and 411 transitions. [2019-09-16 17:05:36,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:36,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-16 17:05:36,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:36,118 INFO L225 Difference]: With dead ends: 282 [2019-09-16 17:05:36,118 INFO L226 Difference]: Without dead ends: 282 [2019-09-16 17:05:36,118 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,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-16 17:05:36,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-16 17:05:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2019-09-16 17:05:36,123 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 97 [2019-09-16 17:05:36,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:36,124 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2019-09-16 17:05:36,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:36,124 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2019-09-16 17:05:36,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-16 17:05:36,125 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:36,125 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:36,125 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:36,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:36,126 INFO L82 PathProgramCache]: Analyzing trace with hash 65379092, now seen corresponding path program 1 times [2019-09-16 17:05:36,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:36,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:36,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:36,184 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:36,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:36,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:36,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:36,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:36,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:36,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:36,186 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand 4 states. [2019-09-16 17:05:36,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:36,508 INFO L93 Difference]: Finished difference Result 295 states and 428 transitions. [2019-09-16 17:05:36,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:36,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-16 17:05:36,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:36,510 INFO L225 Difference]: With dead ends: 295 [2019-09-16 17:05:36,510 INFO L226 Difference]: Without dead ends: 295 [2019-09-16 17:05:36,511 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,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-16 17:05:36,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 260. [2019-09-16 17:05:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 381 transitions. [2019-09-16 17:05:36,519 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 381 transitions. Word has length 98 [2019-09-16 17:05:36,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:36,519 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 381 transitions. [2019-09-16 17:05:36,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:36,519 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 381 transitions. [2019-09-16 17:05:36,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-16 17:05:36,520 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:36,520 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:36,520 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:36,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:36,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1963207018, now seen corresponding path program 1 times [2019-09-16 17:05:36,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:36,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:36,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:36,588 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:36,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:36,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:36,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:36,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:36,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:36,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:36,592 INFO L87 Difference]: Start difference. First operand 260 states and 381 transitions. Second operand 4 states. [2019-09-16 17:05:36,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:36,861 INFO L93 Difference]: Finished difference Result 272 states and 397 transitions. [2019-09-16 17:05:36,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:36,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-16 17:05:36,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:36,864 INFO L225 Difference]: With dead ends: 272 [2019-09-16 17:05:36,864 INFO L226 Difference]: Without dead ends: 272 [2019-09-16 17:05:36,864 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,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-16 17:05:36,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2019-09-16 17:05:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:36,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 380 transitions. [2019-09-16 17:05:36,871 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 380 transitions. Word has length 98 [2019-09-16 17:05:36,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:36,873 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 380 transitions. [2019-09-16 17:05:36,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:36,873 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2019-09-16 17:05:36,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:05:36,874 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:36,875 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:36,875 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:36,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:36,875 INFO L82 PathProgramCache]: Analyzing trace with hash 445820602, now seen corresponding path program 1 times [2019-09-16 17:05:36,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:36,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:36,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:36,966 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:36,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:36,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:36,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:36,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:36,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:36,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:36,968 INFO L87 Difference]: Start difference. First operand 260 states and 380 transitions. Second operand 4 states. [2019-09-16 17:05:37,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:37,320 INFO L93 Difference]: Finished difference Result 295 states and 426 transitions. [2019-09-16 17:05:37,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:37,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-16 17:05:37,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:37,322 INFO L225 Difference]: With dead ends: 295 [2019-09-16 17:05:37,322 INFO L226 Difference]: Without dead ends: 295 [2019-09-16 17:05:37,322 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,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-16 17:05:37,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 260. [2019-09-16 17:05:37,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 379 transitions. [2019-09-16 17:05:37,328 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 379 transitions. Word has length 102 [2019-09-16 17:05:37,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:37,329 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 379 transitions. [2019-09-16 17:05:37,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 379 transitions. [2019-09-16 17:05:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:05:37,330 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:37,330 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:37,330 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:37,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:37,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1832606012, now seen corresponding path program 1 times [2019-09-16 17:05:37,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:37,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:37,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:37,394 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:37,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:37,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:37,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:37,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:37,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:37,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:37,396 INFO L87 Difference]: Start difference. First operand 260 states and 379 transitions. Second operand 3 states. [2019-09-16 17:05:37,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:37,439 INFO L93 Difference]: Finished difference Result 493 states and 723 transitions. [2019-09-16 17:05:37,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:37,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-16 17:05:37,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:37,443 INFO L225 Difference]: With dead ends: 493 [2019-09-16 17:05:37,443 INFO L226 Difference]: Without dead ends: 493 [2019-09-16 17:05:37,443 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:37,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-16 17:05:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-09-16 17:05:37,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-09-16 17:05:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 723 transitions. [2019-09-16 17:05:37,452 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 723 transitions. Word has length 102 [2019-09-16 17:05:37,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:37,453 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 723 transitions. [2019-09-16 17:05:37,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 723 transitions. [2019-09-16 17:05:37,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:05:37,455 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:37,455 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:37,456 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:37,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:37,456 INFO L82 PathProgramCache]: Analyzing trace with hash 881301798, now seen corresponding path program 1 times [2019-09-16 17:05:37,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:37,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:37,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:37,523 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:37,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:37,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:37,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:37,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:37,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:37,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:37,525 INFO L87 Difference]: Start difference. First operand 493 states and 723 transitions. Second operand 3 states. [2019-09-16 17:05:37,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:37,566 INFO L93 Difference]: Finished difference Result 728 states and 1072 transitions. [2019-09-16 17:05:37,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:37,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-16 17:05:37,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:37,570 INFO L225 Difference]: With dead ends: 728 [2019-09-16 17:05:37,570 INFO L226 Difference]: Without dead ends: 728 [2019-09-16 17:05:37,570 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:37,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-09-16 17:05:37,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2019-09-16 17:05:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-09-16 17:05:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1071 transitions. [2019-09-16 17:05:37,583 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1071 transitions. Word has length 104 [2019-09-16 17:05:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:37,583 INFO L475 AbstractCegarLoop]: Abstraction has 726 states and 1071 transitions. [2019-09-16 17:05:37,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1071 transitions. [2019-09-16 17:05:37,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-16 17:05:37,585 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:37,585 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:37,586 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:37,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:37,586 INFO L82 PathProgramCache]: Analyzing trace with hash -508111036, now seen corresponding path program 1 times [2019-09-16 17:05:37,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:37,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:37,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:37,640 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:37,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:37,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:37,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:37,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:37,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:37,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:37,642 INFO L87 Difference]: Start difference. First operand 726 states and 1071 transitions. Second operand 3 states. [2019-09-16 17:05:37,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:37,685 INFO L93 Difference]: Finished difference Result 961 states and 1406 transitions. [2019-09-16 17:05:37,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:37,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-16 17:05:37,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:37,689 INFO L225 Difference]: With dead ends: 961 [2019-09-16 17:05:37,689 INFO L226 Difference]: Without dead ends: 961 [2019-09-16 17:05:37,690 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:37,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-09-16 17:05:37,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2019-09-16 17:05:37,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-09-16 17:05:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1405 transitions. [2019-09-16 17:05:37,705 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1405 transitions. Word has length 110 [2019-09-16 17:05:37,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:37,705 INFO L475 AbstractCegarLoop]: Abstraction has 959 states and 1405 transitions. [2019-09-16 17:05:37,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:37,706 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1405 transitions. [2019-09-16 17:05:37,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-16 17:05:37,708 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:37,708 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:37,708 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:37,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:37,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1148375037, now seen corresponding path program 1 times [2019-09-16 17:05:37,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:37,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:37,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:37,793 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:37,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:37,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:37,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:37,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:37,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:37,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:37,795 INFO L87 Difference]: Start difference. First operand 959 states and 1405 transitions. Second operand 4 states. [2019-09-16 17:05:38,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:38,247 INFO L93 Difference]: Finished difference Result 1361 states and 2010 transitions. [2019-09-16 17:05:38,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:38,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-16 17:05:38,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:38,253 INFO L225 Difference]: With dead ends: 1361 [2019-09-16 17:05:38,253 INFO L226 Difference]: Without dead ends: 1361 [2019-09-16 17:05:38,254 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:38,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2019-09-16 17:05:38,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1115. [2019-09-16 17:05:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-09-16 17:05:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1689 transitions. [2019-09-16 17:05:38,273 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1689 transitions. Word has length 127 [2019-09-16 17:05:38,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:38,273 INFO L475 AbstractCegarLoop]: Abstraction has 1115 states and 1689 transitions. [2019-09-16 17:05:38,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1689 transitions. [2019-09-16 17:05:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-16 17:05:38,276 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:38,276 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:38,276 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:38,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:38,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1246895101, now seen corresponding path program 1 times [2019-09-16 17:05:38,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:38,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:38,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:38,345 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:38,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:38,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:38,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:38,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:38,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:38,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:38,347 INFO L87 Difference]: Start difference. First operand 1115 states and 1689 transitions. Second operand 4 states. [2019-09-16 17:05:38,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:38,806 INFO L93 Difference]: Finished difference Result 1343 states and 1984 transitions. [2019-09-16 17:05:38,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:38,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-16 17:05:38,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:38,812 INFO L225 Difference]: With dead ends: 1343 [2019-09-16 17:05:38,813 INFO L226 Difference]: Without dead ends: 1343 [2019-09-16 17:05:38,813 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:38,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2019-09-16 17:05:38,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1075. [2019-09-16 17:05:38,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-09-16 17:05:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1613 transitions. [2019-09-16 17:05:38,832 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1613 transitions. Word has length 128 [2019-09-16 17:05:38,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:38,832 INFO L475 AbstractCegarLoop]: Abstraction has 1075 states and 1613 transitions. [2019-09-16 17:05:38,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1613 transitions. [2019-09-16 17:05:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-16 17:05:38,835 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:38,835 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:38,836 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:38,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:38,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1490307687, now seen corresponding path program 1 times [2019-09-16 17:05:38,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:38,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:38,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:38,903 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:38,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:38,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:38,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:38,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:38,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:38,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:38,905 INFO L87 Difference]: Start difference. First operand 1075 states and 1613 transitions. Second operand 3 states. [2019-09-16 17:05:38,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:38,947 INFO L93 Difference]: Finished difference Result 1339 states and 2008 transitions. [2019-09-16 17:05:38,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:38,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-09-16 17:05:38,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:38,953 INFO L225 Difference]: With dead ends: 1339 [2019-09-16 17:05:38,954 INFO L226 Difference]: Without dead ends: 1339 [2019-09-16 17:05:38,954 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:38,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-09-16 17:05:38,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2019-09-16 17:05:38,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2007 transitions. [2019-09-16 17:05:38,974 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2007 transitions. Word has length 133 [2019-09-16 17:05:38,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:38,975 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 2007 transitions. [2019-09-16 17:05:38,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:38,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2007 transitions. [2019-09-16 17:05:38,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-16 17:05:38,978 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:38,978 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:38,979 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:38,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:38,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1190896019, now seen corresponding path program 1 times [2019-09-16 17:05:38,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:38,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:38,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:39,049 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:39,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:39,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:39,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:39,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:39,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:39,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:39,051 INFO L87 Difference]: Start difference. First operand 1337 states and 2007 transitions. Second operand 4 states. [2019-09-16 17:05:39,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:39,506 INFO L93 Difference]: Finished difference Result 1672 states and 2464 transitions. [2019-09-16 17:05:39,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:39,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-16 17:05:39,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:39,514 INFO L225 Difference]: With dead ends: 1672 [2019-09-16 17:05:39,514 INFO L226 Difference]: Without dead ends: 1672 [2019-09-16 17:05:39,515 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:39,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2019-09-16 17:05:39,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1337. [2019-09-16 17:05:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2002 transitions. [2019-09-16 17:05:39,536 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2002 transitions. Word has length 140 [2019-09-16 17:05:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:39,536 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 2002 transitions. [2019-09-16 17:05:39,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2002 transitions. [2019-09-16 17:05:39,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-16 17:05:39,539 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:39,539 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:39,539 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:39,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:39,540 INFO L82 PathProgramCache]: Analyzing trace with hash 370582985, now seen corresponding path program 1 times [2019-09-16 17:05:39,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:39,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:39,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:39,619 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:39,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:39,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:39,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:39,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:39,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:39,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:39,620 INFO L87 Difference]: Start difference. First operand 1337 states and 2002 transitions. Second operand 4 states. [2019-09-16 17:05:40,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:40,211 INFO L93 Difference]: Finished difference Result 1667 states and 2454 transitions. [2019-09-16 17:05:40,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:40,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-16 17:05:40,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:40,219 INFO L225 Difference]: With dead ends: 1667 [2019-09-16 17:05:40,219 INFO L226 Difference]: Without dead ends: 1667 [2019-09-16 17:05:40,219 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,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-16 17:05:40,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-16 17:05:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:40,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1997 transitions. [2019-09-16 17:05:40,236 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1997 transitions. Word has length 141 [2019-09-16 17:05:40,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:40,236 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1997 transitions. [2019-09-16 17:05:40,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:40,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1997 transitions. [2019-09-16 17:05:40,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-16 17:05:40,240 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:40,240 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:40,240 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:40,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:40,241 INFO L82 PathProgramCache]: Analyzing trace with hash 2028611400, now seen corresponding path program 1 times [2019-09-16 17:05:40,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:40,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:40,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:40,332 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:40,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:40,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:40,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:40,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:40,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:40,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:40,334 INFO L87 Difference]: Start difference. First operand 1337 states and 1997 transitions. Second operand 4 states. [2019-09-16 17:05:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:40,845 INFO L93 Difference]: Finished difference Result 1657 states and 2439 transitions. [2019-09-16 17:05:40,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:40,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-16 17:05:40,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:40,853 INFO L225 Difference]: With dead ends: 1657 [2019-09-16 17:05:40,853 INFO L226 Difference]: Without dead ends: 1657 [2019-09-16 17:05:40,854 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,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2019-09-16 17:05:40,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1337. [2019-09-16 17:05:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1992 transitions. [2019-09-16 17:05:40,872 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1992 transitions. Word has length 141 [2019-09-16 17:05:40,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:40,873 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1992 transitions. [2019-09-16 17:05:40,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1992 transitions. [2019-09-16 17:05:40,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-16 17:05:40,875 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:40,876 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:40,876 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:40,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:40,876 INFO L82 PathProgramCache]: Analyzing trace with hash -190205782, now seen corresponding path program 1 times [2019-09-16 17:05:40,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:40,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:40,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:40,948 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:40,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:40,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:40,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:40,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:40,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:40,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:40,951 INFO L87 Difference]: Start difference. First operand 1337 states and 1992 transitions. Second operand 4 states. [2019-09-16 17:05:41,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:41,379 INFO L93 Difference]: Finished difference Result 1657 states and 2434 transitions. [2019-09-16 17:05:41,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:41,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-16 17:05:41,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:41,388 INFO L225 Difference]: With dead ends: 1657 [2019-09-16 17:05:41,388 INFO L226 Difference]: Without dead ends: 1657 [2019-09-16 17:05:41,388 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,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2019-09-16 17:05:41,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1337. [2019-09-16 17:05:41,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1987 transitions. [2019-09-16 17:05:41,407 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1987 transitions. Word has length 142 [2019-09-16 17:05:41,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:41,408 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1987 transitions. [2019-09-16 17:05:41,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:41,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1987 transitions. [2019-09-16 17:05:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-16 17:05:41,410 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:41,410 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:41,410 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:41,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:41,411 INFO L82 PathProgramCache]: Analyzing trace with hash -549609467, now seen corresponding path program 1 times [2019-09-16 17:05:41,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:41,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:41,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:41,483 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:41,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:41,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:41,484 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:41,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:41,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:41,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:41,485 INFO L87 Difference]: Start difference. First operand 1337 states and 1987 transitions. Second operand 4 states. [2019-09-16 17:05:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:41,921 INFO L93 Difference]: Finished difference Result 1657 states and 2429 transitions. [2019-09-16 17:05:41,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:41,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-16 17:05:41,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:41,928 INFO L225 Difference]: With dead ends: 1657 [2019-09-16 17:05:41,928 INFO L226 Difference]: Without dead ends: 1657 [2019-09-16 17:05:41,928 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,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2019-09-16 17:05:41,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1337. [2019-09-16 17:05:41,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:41,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1982 transitions. [2019-09-16 17:05:41,945 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1982 transitions. Word has length 143 [2019-09-16 17:05:41,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:41,946 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1982 transitions. [2019-09-16 17:05:41,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:41,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1982 transitions. [2019-09-16 17:05:41,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-16 17:05:41,948 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:41,948 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:41,949 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:41,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:41,949 INFO L82 PathProgramCache]: Analyzing trace with hash -427991003, now seen corresponding path program 1 times [2019-09-16 17:05:41,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:41,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:41,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:42,024 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:42,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:42,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:42,024 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:42,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:42,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:42,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:42,025 INFO L87 Difference]: Start difference. First operand 1337 states and 1982 transitions. Second operand 4 states. [2019-09-16 17:05:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:42,455 INFO L93 Difference]: Finished difference Result 1657 states and 2424 transitions. [2019-09-16 17:05:42,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:42,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-09-16 17:05:42,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:42,464 INFO L225 Difference]: With dead ends: 1657 [2019-09-16 17:05:42,465 INFO L226 Difference]: Without dead ends: 1657 [2019-09-16 17:05:42,465 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,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2019-09-16 17:05:42,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1337. [2019-09-16 17:05:42,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1977 transitions. [2019-09-16 17:05:42,483 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1977 transitions. Word has length 144 [2019-09-16 17:05:42,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:42,484 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1977 transitions. [2019-09-16 17:05:42,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1977 transitions. [2019-09-16 17:05:42,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-16 17:05:42,486 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:42,487 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:42,487 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:42,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:42,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1720412192, now seen corresponding path program 1 times [2019-09-16 17:05:42,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:42,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:42,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:42,562 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:42,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:42,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:42,563 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:42,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:42,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:42,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:42,564 INFO L87 Difference]: Start difference. First operand 1337 states and 1977 transitions. Second operand 4 states. [2019-09-16 17:05:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:42,984 INFO L93 Difference]: Finished difference Result 1607 states and 2359 transitions. [2019-09-16 17:05:42,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:42,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-16 17:05:42,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:42,991 INFO L225 Difference]: With dead ends: 1607 [2019-09-16 17:05:42,991 INFO L226 Difference]: Without dead ends: 1607 [2019-09-16 17:05:42,992 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,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-09-16 17:05:43,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1337. [2019-09-16 17:05:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1972 transitions. [2019-09-16 17:05:43,008 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1972 transitions. Word has length 145 [2019-09-16 17:05:43,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:43,008 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1972 transitions. [2019-09-16 17:05:43,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:43,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1972 transitions. [2019-09-16 17:05:43,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-16 17:05:43,011 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:43,011 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:43,011 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:43,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:43,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1014120518, now seen corresponding path program 1 times [2019-09-16 17:05:43,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:43,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:43,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:43,088 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:43,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:43,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:43,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:43,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:43,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:43,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:43,090 INFO L87 Difference]: Start difference. First operand 1337 states and 1972 transitions. Second operand 4 states. [2019-09-16 17:05:43,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:43,485 INFO L93 Difference]: Finished difference Result 1607 states and 2354 transitions. [2019-09-16 17:05:43,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:43,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-09-16 17:05:43,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:43,492 INFO L225 Difference]: With dead ends: 1607 [2019-09-16 17:05:43,492 INFO L226 Difference]: Without dead ends: 1607 [2019-09-16 17:05:43,493 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,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-09-16 17:05:43,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1337. [2019-09-16 17:05:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1967 transitions. [2019-09-16 17:05:43,509 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1967 transitions. Word has length 149 [2019-09-16 17:05:43,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:43,510 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1967 transitions. [2019-09-16 17:05:43,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:43,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1967 transitions. [2019-09-16 17:05:43,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-16 17:05:43,511 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:43,511 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:43,512 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:43,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:43,512 INFO L82 PathProgramCache]: Analyzing trace with hash 657641547, now seen corresponding path program 1 times [2019-09-16 17:05:43,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:43,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:43,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:43,582 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:43,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:43,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:43,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:43,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:43,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:43,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:43,584 INFO L87 Difference]: Start difference. First operand 1337 states and 1967 transitions. Second operand 4 states. [2019-09-16 17:05:43,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:43,956 INFO L93 Difference]: Finished difference Result 1582 states and 2317 transitions. [2019-09-16 17:05:43,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:43,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-16 17:05:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:43,960 INFO L225 Difference]: With dead ends: 1582 [2019-09-16 17:05:43,960 INFO L226 Difference]: Without dead ends: 1582 [2019-09-16 17:05:43,960 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,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2019-09-16 17:05:43,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1337. [2019-09-16 17:05:43,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:43,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1962 transitions. [2019-09-16 17:05:43,977 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1962 transitions. Word has length 150 [2019-09-16 17:05:43,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:43,977 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1962 transitions. [2019-09-16 17:05:43,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:43,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1962 transitions. [2019-09-16 17:05:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-16 17:05:43,979 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:43,980 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:43,980 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:43,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:43,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1776545877, now seen corresponding path program 1 times [2019-09-16 17:05:43,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:43,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:43,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:44,066 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:05:44,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:44,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:44,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:44,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:44,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:44,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:44,068 INFO L87 Difference]: Start difference. First operand 1337 states and 1962 transitions. Second operand 4 states. [2019-09-16 17:05:44,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:44,452 INFO L93 Difference]: Finished difference Result 1582 states and 2312 transitions. [2019-09-16 17:05:44,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:44,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-16 17:05:44,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:44,456 INFO L225 Difference]: With dead ends: 1582 [2019-09-16 17:05:44,457 INFO L226 Difference]: Without dead ends: 1582 [2019-09-16 17:05:44,457 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:44,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2019-09-16 17:05:44,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1337. [2019-09-16 17:05:44,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:05:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1957 transitions. [2019-09-16 17:05:44,470 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1957 transitions. Word has length 152 [2019-09-16 17:05:44,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:44,470 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1957 transitions. [2019-09-16 17:05:44,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1957 transitions. [2019-09-16 17:05:44,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-16 17:05:44,472 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:44,473 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:05:44,473 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:44,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:44,473 INFO L82 PathProgramCache]: Analyzing trace with hash 114000966, now seen corresponding path program 1 times [2019-09-16 17:05:44,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:44,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:44,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:44,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:44,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:44,561 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:05:44,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:44,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:44,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:44,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:44,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:44,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:44,563 INFO L87 Difference]: Start difference. First operand 1337 states and 1957 transitions. Second operand 4 states. [2019-09-16 17:05:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:44,920 INFO L93 Difference]: Finished difference Result 1542 states and 2242 transitions. [2019-09-16 17:05:44,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:44,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-16 17:05:44,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:44,924 INFO L225 Difference]: With dead ends: 1542 [2019-09-16 17:05:44,924 INFO L226 Difference]: Without dead ends: 1542 [2019-09-16 17:05:44,924 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:44,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-09-16 17:05:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1317. [2019-09-16 17:05:44,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2019-09-16 17:05:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1922 transitions. [2019-09-16 17:05:44,970 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1922 transitions. Word has length 153 [2019-09-16 17:05:44,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:44,971 INFO L475 AbstractCegarLoop]: Abstraction has 1317 states and 1922 transitions. [2019-09-16 17:05:44,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1922 transitions. [2019-09-16 17:05:44,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-16 17:05:44,973 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:44,974 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:05:44,974 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:44,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:44,974 INFO L82 PathProgramCache]: Analyzing trace with hash -161498230, now seen corresponding path program 1 times [2019-09-16 17:05:44,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:44,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:44,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:44,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:44,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:45,059 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:05:45,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:45,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:45,060 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:45,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:45,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:45,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:45,061 INFO L87 Difference]: Start difference. First operand 1317 states and 1922 transitions. Second operand 4 states. [2019-09-16 17:05:45,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:45,427 INFO L93 Difference]: Finished difference Result 1542 states and 2237 transitions. [2019-09-16 17:05:45,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:45,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-16 17:05:45,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:45,430 INFO L225 Difference]: With dead ends: 1542 [2019-09-16 17:05:45,431 INFO L226 Difference]: Without dead ends: 1542 [2019-09-16 17:05:45,431 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:45,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-09-16 17:05:45,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1342. [2019-09-16 17:05:45,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-09-16 17:05:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1957 transitions. [2019-09-16 17:05:45,446 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1957 transitions. Word has length 154 [2019-09-16 17:05:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:45,446 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 1957 transitions. [2019-09-16 17:05:45,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1957 transitions. [2019-09-16 17:05:45,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-16 17:05:45,449 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:45,449 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:05:45,449 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:45,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:45,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2094043237, now seen corresponding path program 1 times [2019-09-16 17:05:45,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:45,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:45,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:45,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:45,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:45,535 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:05:45,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:45,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:45,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:45,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:45,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:45,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:45,537 INFO L87 Difference]: Start difference. First operand 1342 states and 1957 transitions. Second operand 4 states. [2019-09-16 17:05:45,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:45,891 INFO L93 Difference]: Finished difference Result 1542 states and 2232 transitions. [2019-09-16 17:05:45,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:45,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-16 17:05:45,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:45,895 INFO L225 Difference]: With dead ends: 1542 [2019-09-16 17:05:45,896 INFO L226 Difference]: Without dead ends: 1542 [2019-09-16 17:05:45,896 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:45,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-09-16 17:05:45,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1342. [2019-09-16 17:05:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-09-16 17:05:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1952 transitions. [2019-09-16 17:05:45,913 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1952 transitions. Word has length 155 [2019-09-16 17:05:45,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:45,914 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 1952 transitions. [2019-09-16 17:05:45,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1952 transitions. [2019-09-16 17:05:45,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-16 17:05:45,916 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:45,916 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:05:45,917 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:45,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:45,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1807417541, now seen corresponding path program 1 times [2019-09-16 17:05:45,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:45,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:45,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:45,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:45,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:45,996 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:05:45,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:45,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:45,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:45,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:45,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:45,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:45,999 INFO L87 Difference]: Start difference. First operand 1342 states and 1952 transitions. Second operand 4 states. [2019-09-16 17:05:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:46,360 INFO L93 Difference]: Finished difference Result 1532 states and 2217 transitions. [2019-09-16 17:05:46,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:46,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-16 17:05:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:46,365 INFO L225 Difference]: With dead ends: 1532 [2019-09-16 17:05:46,365 INFO L226 Difference]: Without dead ends: 1532 [2019-09-16 17:05:46,366 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:46,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-09-16 17:05:46,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1347. [2019-09-16 17:05:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-09-16 17:05:46,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1957 transitions. [2019-09-16 17:05:46,382 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1957 transitions. Word has length 155 [2019-09-16 17:05:46,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:46,382 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 1957 transitions. [2019-09-16 17:05:46,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1957 transitions. [2019-09-16 17:05:46,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:05:46,385 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:46,385 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:05:46,385 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:46,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:46,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1942177664, now seen corresponding path program 1 times [2019-09-16 17:05:46,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:46,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:46,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:46,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:46,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:46,464 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:05:46,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:46,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:46,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:46,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:46,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:46,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:46,465 INFO L87 Difference]: Start difference. First operand 1347 states and 1957 transitions. Second operand 4 states. [2019-09-16 17:05:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:46,783 INFO L93 Difference]: Finished difference Result 1522 states and 2197 transitions. [2019-09-16 17:05:46,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:46,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:05:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:46,788 INFO L225 Difference]: With dead ends: 1522 [2019-09-16 17:05:46,788 INFO L226 Difference]: Without dead ends: 1522 [2019-09-16 17:05:46,788 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:46,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2019-09-16 17:05:46,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1347. [2019-09-16 17:05:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-09-16 17:05:46,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1952 transitions. [2019-09-16 17:05:46,806 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1952 transitions. Word has length 156 [2019-09-16 17:05:46,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:46,806 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 1952 transitions. [2019-09-16 17:05:46,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:46,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1952 transitions. [2019-09-16 17:05:46,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:05:46,808 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:46,809 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:05:46,809 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:46,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:46,809 INFO L82 PathProgramCache]: Analyzing trace with hash -694190232, now seen corresponding path program 1 times [2019-09-16 17:05:46,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:46,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:46,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:46,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:46,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:46,936 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:05:46,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:46,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:46,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:46,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:46,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:46,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:46,938 INFO L87 Difference]: Start difference. First operand 1347 states and 1952 transitions. Second operand 4 states. [2019-09-16 17:05:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:47,261 INFO L93 Difference]: Finished difference Result 1507 states and 2172 transitions. [2019-09-16 17:05:47,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:47,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:05:47,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:47,264 INFO L225 Difference]: With dead ends: 1507 [2019-09-16 17:05:47,264 INFO L226 Difference]: Without dead ends: 1507 [2019-09-16 17:05:47,264 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:47,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2019-09-16 17:05:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1352. [2019-09-16 17:05:47,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-09-16 17:05:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1957 transitions. [2019-09-16 17:05:47,276 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1957 transitions. Word has length 156 [2019-09-16 17:05:47,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:47,277 INFO L475 AbstractCegarLoop]: Abstraction has 1352 states and 1957 transitions. [2019-09-16 17:05:47,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:47,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1957 transitions. [2019-09-16 17:05:47,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-16 17:05:47,278 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:47,279 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:05:47,279 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:47,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:47,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2103835033, now seen corresponding path program 1 times [2019-09-16 17:05:47,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:47,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:47,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:47,359 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:05:47,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:47,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:47,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:47,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:47,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:47,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:47,361 INFO L87 Difference]: Start difference. First operand 1352 states and 1957 transitions. Second operand 4 states. [2019-09-16 17:05:47,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:47,685 INFO L93 Difference]: Finished difference Result 1507 states and 2167 transitions. [2019-09-16 17:05:47,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:47,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-16 17:05:47,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:47,688 INFO L225 Difference]: With dead ends: 1507 [2019-09-16 17:05:47,688 INFO L226 Difference]: Without dead ends: 1507 [2019-09-16 17:05:47,688 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:47,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2019-09-16 17:05:47,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1357. [2019-09-16 17:05:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2019-09-16 17:05:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1962 transitions. [2019-09-16 17:05:47,703 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1962 transitions. Word has length 158 [2019-09-16 17:05:47,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:47,703 INFO L475 AbstractCegarLoop]: Abstraction has 1357 states and 1962 transitions. [2019-09-16 17:05:47,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:47,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1962 transitions. [2019-09-16 17:05:47,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-16 17:05:47,705 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:47,705 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:05:47,705 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:47,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:47,706 INFO L82 PathProgramCache]: Analyzing trace with hash -80202823, now seen corresponding path program 1 times [2019-09-16 17:05:47,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:47,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:47,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:47,781 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:05:47,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:47,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:47,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:47,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:47,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:47,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:47,782 INFO L87 Difference]: Start difference. First operand 1357 states and 1962 transitions. Second operand 4 states. [2019-09-16 17:05:48,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:48,096 INFO L93 Difference]: Finished difference Result 1487 states and 2137 transitions. [2019-09-16 17:05:48,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:48,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-16 17:05:48,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:48,099 INFO L225 Difference]: With dead ends: 1487 [2019-09-16 17:05:48,099 INFO L226 Difference]: Without dead ends: 1487 [2019-09-16 17:05:48,099 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:48,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-09-16 17:05:48,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1362. [2019-09-16 17:05:48,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-09-16 17:05:48,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1967 transitions. [2019-09-16 17:05:48,115 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1967 transitions. Word has length 159 [2019-09-16 17:05:48,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:48,116 INFO L475 AbstractCegarLoop]: Abstraction has 1362 states and 1967 transitions. [2019-09-16 17:05:48,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1967 transitions. [2019-09-16 17:05:48,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-16 17:05:48,118 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:48,118 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:05:48,119 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:48,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:48,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1299278011, now seen corresponding path program 1 times [2019-09-16 17:05:48,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:48,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:48,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:48,195 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:05:48,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:48,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:48,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:48,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:48,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:48,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:48,197 INFO L87 Difference]: Start difference. First operand 1362 states and 1967 transitions. Second operand 4 states. [2019-09-16 17:05:48,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:48,499 INFO L93 Difference]: Finished difference Result 1487 states and 2132 transitions. [2019-09-16 17:05:48,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:48,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-16 17:05:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:48,502 INFO L225 Difference]: With dead ends: 1487 [2019-09-16 17:05:48,502 INFO L226 Difference]: Without dead ends: 1487 [2019-09-16 17:05:48,502 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:48,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-09-16 17:05:48,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1367. [2019-09-16 17:05:48,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2019-09-16 17:05:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1972 transitions. [2019-09-16 17:05:48,518 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1972 transitions. Word has length 159 [2019-09-16 17:05:48,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:48,518 INFO L475 AbstractCegarLoop]: Abstraction has 1367 states and 1972 transitions. [2019-09-16 17:05:48,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:48,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1972 transitions. [2019-09-16 17:05:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-16 17:05:48,522 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:48,524 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:05:48,525 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:48,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:48,525 INFO L82 PathProgramCache]: Analyzing trace with hash -56820229, now seen corresponding path program 1 times [2019-09-16 17:05:48,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:48,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:48,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:48,629 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:05:48,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:48,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:48,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:48,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:48,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:48,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:48,631 INFO L87 Difference]: Start difference. First operand 1367 states and 1972 transitions. Second operand 4 states. [2019-09-16 17:05:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:48,964 INFO L93 Difference]: Finished difference Result 1477 states and 2117 transitions. [2019-09-16 17:05:48,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:48,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-16 17:05:48,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:48,966 INFO L225 Difference]: With dead ends: 1477 [2019-09-16 17:05:48,966 INFO L226 Difference]: Without dead ends: 1477 [2019-09-16 17:05:48,967 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:48,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2019-09-16 17:05:48,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1372. [2019-09-16 17:05:48,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-09-16 17:05:48,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1977 transitions. [2019-09-16 17:05:48,983 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1977 transitions. Word has length 160 [2019-09-16 17:05:48,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:48,983 INFO L475 AbstractCegarLoop]: Abstraction has 1372 states and 1977 transitions. [2019-09-16 17:05:48,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:48,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1977 transitions. [2019-09-16 17:05:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-16 17:05:48,986 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:48,986 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:05:48,986 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:48,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:48,987 INFO L82 PathProgramCache]: Analyzing trace with hash 247648310, now seen corresponding path program 1 times [2019-09-16 17:05:48,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:48,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:48,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:49,069 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:05:49,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:49,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:49,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:49,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:49,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:49,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:49,071 INFO L87 Difference]: Start difference. First operand 1372 states and 1977 transitions. Second operand 4 states. [2019-09-16 17:05:49,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:49,373 INFO L93 Difference]: Finished difference Result 1477 states and 2112 transitions. [2019-09-16 17:05:49,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:49,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-16 17:05:49,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:49,376 INFO L225 Difference]: With dead ends: 1477 [2019-09-16 17:05:49,376 INFO L226 Difference]: Without dead ends: 1477 [2019-09-16 17:05:49,376 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:49,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2019-09-16 17:05:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1377. [2019-09-16 17:05:49,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2019-09-16 17:05:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1982 transitions. [2019-09-16 17:05:49,394 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1982 transitions. Word has length 161 [2019-09-16 17:05:49,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:49,394 INFO L475 AbstractCegarLoop]: Abstraction has 1377 states and 1982 transitions. [2019-09-16 17:05:49,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1982 transitions. [2019-09-16 17:05:49,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-16 17:05:49,397 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:49,397 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:05:49,397 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:49,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:49,398 INFO L82 PathProgramCache]: Analyzing trace with hash 336896214, now seen corresponding path program 1 times [2019-09-16 17:05:49,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:49,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:49,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:49,479 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:05:49,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:49,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:49,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:49,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:49,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:49,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:49,481 INFO L87 Difference]: Start difference. First operand 1377 states and 1982 transitions. Second operand 4 states. [2019-09-16 17:05:49,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:49,776 INFO L93 Difference]: Finished difference Result 1467 states and 2097 transitions. [2019-09-16 17:05:49,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:49,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-16 17:05:49,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:49,779 INFO L225 Difference]: With dead ends: 1467 [2019-09-16 17:05:49,779 INFO L226 Difference]: Without dead ends: 1467 [2019-09-16 17:05:49,780 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:49,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2019-09-16 17:05:49,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1382. [2019-09-16 17:05:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-09-16 17:05:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1987 transitions. [2019-09-16 17:05:49,791 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1987 transitions. Word has length 162 [2019-09-16 17:05:49,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:49,791 INFO L475 AbstractCegarLoop]: Abstraction has 1382 states and 1987 transitions. [2019-09-16 17:05:49,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:49,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1987 transitions. [2019-09-16 17:05:49,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-16 17:05:49,793 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:49,793 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:05:49,793 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:49,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:49,793 INFO L82 PathProgramCache]: Analyzing trace with hash -391157035, now seen corresponding path program 1 times [2019-09-16 17:05:49,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:49,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:49,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-16 17:05:49,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:49,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:49,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:49,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:49,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:49,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:49,874 INFO L87 Difference]: Start difference. First operand 1382 states and 1987 transitions. Second operand 3 states. [2019-09-16 17:05:49,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:49,919 INFO L93 Difference]: Finished difference Result 1653 states and 2381 transitions. [2019-09-16 17:05:49,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:49,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-16 17:05:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:49,922 INFO L225 Difference]: With dead ends: 1653 [2019-09-16 17:05:49,922 INFO L226 Difference]: Without dead ends: 1653 [2019-09-16 17:05:49,922 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:49,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2019-09-16 17:05:49,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1653. [2019-09-16 17:05:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1653 states. [2019-09-16 17:05:49,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2381 transitions. [2019-09-16 17:05:49,935 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2381 transitions. Word has length 170 [2019-09-16 17:05:49,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:49,936 INFO L475 AbstractCegarLoop]: Abstraction has 1653 states and 2381 transitions. [2019-09-16 17:05:49,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:49,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2381 transitions. [2019-09-16 17:05:49,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-16 17:05:49,938 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:49,938 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:49,938 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:49,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:49,939 INFO L82 PathProgramCache]: Analyzing trace with hash 99809750, now seen corresponding path program 1 times [2019-09-16 17:05:49,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:49,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:49,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-16 17:05:50,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:50,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:50,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:50,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:50,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:50,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:50,031 INFO L87 Difference]: Start difference. First operand 1653 states and 2381 transitions. Second operand 4 states. [2019-09-16 17:05:50,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:50,364 INFO L93 Difference]: Finished difference Result 1755 states and 2509 transitions. [2019-09-16 17:05:50,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:50,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-09-16 17:05:50,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:50,368 INFO L225 Difference]: With dead ends: 1755 [2019-09-16 17:05:50,368 INFO L226 Difference]: Without dead ends: 1755 [2019-09-16 17:05:50,368 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:50,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2019-09-16 17:05:50,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1671. [2019-09-16 17:05:50,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2019-09-16 17:05:50,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2399 transitions. [2019-09-16 17:05:50,388 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2399 transitions. Word has length 212 [2019-09-16 17:05:50,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:50,389 INFO L475 AbstractCegarLoop]: Abstraction has 1671 states and 2399 transitions. [2019-09-16 17:05:50,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2399 transitions. [2019-09-16 17:05:50,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-16 17:05:50,392 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:50,393 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:50,393 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:50,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:50,394 INFO L82 PathProgramCache]: Analyzing trace with hash 387288694, now seen corresponding path program 1 times [2019-09-16 17:05:50,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:50,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:50,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:50,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:50,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:50,529 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-16 17:05:50,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:50,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:50,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:50,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:50,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:50,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:50,530 INFO L87 Difference]: Start difference. First operand 1671 states and 2399 transitions. Second operand 4 states. [2019-09-16 17:05:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:50,831 INFO L93 Difference]: Finished difference Result 1749 states and 2497 transitions. [2019-09-16 17:05:50,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:50,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2019-09-16 17:05:50,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:50,834 INFO L225 Difference]: With dead ends: 1749 [2019-09-16 17:05:50,834 INFO L226 Difference]: Without dead ends: 1749 [2019-09-16 17:05:50,835 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:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2019-09-16 17:05:50,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1677. [2019-09-16 17:05:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2019-09-16 17:05:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2405 transitions. [2019-09-16 17:05:50,853 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2405 transitions. Word has length 213 [2019-09-16 17:05:50,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:50,853 INFO L475 AbstractCegarLoop]: Abstraction has 1677 states and 2405 transitions. [2019-09-16 17:05:50,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:50,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2405 transitions. [2019-09-16 17:05:50,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-16 17:05:50,857 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:50,857 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:50,857 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:50,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:50,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1595826126, now seen corresponding path program 1 times [2019-09-16 17:05:50,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:50,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:50,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:50,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:50,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-16 17:05:50,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:50,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:50,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:50,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:50,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:50,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:50,951 INFO L87 Difference]: Start difference. First operand 1677 states and 2405 transitions. Second operand 4 states. [2019-09-16 17:05:51,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:51,371 INFO L93 Difference]: Finished difference Result 2055 states and 2978 transitions. [2019-09-16 17:05:51,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:51,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-09-16 17:05:51,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:51,376 INFO L225 Difference]: With dead ends: 2055 [2019-09-16 17:05:51,376 INFO L226 Difference]: Without dead ends: 2055 [2019-09-16 17:05:51,376 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:51,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2019-09-16 17:05:51,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1845. [2019-09-16 17:05:51,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-09-16 17:05:51,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2699 transitions. [2019-09-16 17:05:51,410 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2699 transitions. Word has length 219 [2019-09-16 17:05:51,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:51,411 INFO L475 AbstractCegarLoop]: Abstraction has 1845 states and 2699 transitions. [2019-09-16 17:05:51,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:51,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2699 transitions. [2019-09-16 17:05:51,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-16 17:05:51,417 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:51,417 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:51,417 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:51,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:51,418 INFO L82 PathProgramCache]: Analyzing trace with hash -225266188, now seen corresponding path program 1 times [2019-09-16 17:05:51,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:51,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:51,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:51,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:51,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-16 17:05:51,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:51,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:51,567 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:51,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:51,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:51,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:51,569 INFO L87 Difference]: Start difference. First operand 1845 states and 2699 transitions. Second operand 4 states. [2019-09-16 17:05:51,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:51,972 INFO L93 Difference]: Finished difference Result 2055 states and 2972 transitions. [2019-09-16 17:05:51,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:51,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-09-16 17:05:51,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:51,976 INFO L225 Difference]: With dead ends: 2055 [2019-09-16 17:05:51,976 INFO L226 Difference]: Without dead ends: 2055 [2019-09-16 17:05:51,977 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:51,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2019-09-16 17:05:51,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1845. [2019-09-16 17:05:51,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-09-16 17:05:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2693 transitions. [2019-09-16 17:05:52,000 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2693 transitions. Word has length 232 [2019-09-16 17:05:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:52,000 INFO L475 AbstractCegarLoop]: Abstraction has 1845 states and 2693 transitions. [2019-09-16 17:05:52,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:52,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2693 transitions. [2019-09-16 17:05:52,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-16 17:05:52,004 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:52,004 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:52,005 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:52,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:52,005 INFO L82 PathProgramCache]: Analyzing trace with hash 12492308, now seen corresponding path program 1 times [2019-09-16 17:05:52,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:52,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:52,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-16 17:05:52,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:52,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:52,096 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:52,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:52,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:52,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:52,097 INFO L87 Difference]: Start difference. First operand 1845 states and 2693 transitions. Second operand 4 states. [2019-09-16 17:05:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:52,456 INFO L93 Difference]: Finished difference Result 2049 states and 2960 transitions. [2019-09-16 17:05:52,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:52,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2019-09-16 17:05:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:52,459 INFO L225 Difference]: With dead ends: 2049 [2019-09-16 17:05:52,459 INFO L226 Difference]: Without dead ends: 2049 [2019-09-16 17:05:52,459 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:52,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2019-09-16 17:05:52,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1845. [2019-09-16 17:05:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-09-16 17:05:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2687 transitions. [2019-09-16 17:05:52,492 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2687 transitions. Word has length 233 [2019-09-16 17:05:52,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:52,492 INFO L475 AbstractCegarLoop]: Abstraction has 1845 states and 2687 transitions. [2019-09-16 17:05:52,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2687 transitions. [2019-09-16 17:05:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-16 17:05:52,495 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:52,495 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:52,495 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:52,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:52,496 INFO L82 PathProgramCache]: Analyzing trace with hash -971388525, now seen corresponding path program 1 times [2019-09-16 17:05:52,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:52,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:52,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-16 17:05:52,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:52,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:52,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:52,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:52,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:52,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:52,597 INFO L87 Difference]: Start difference. First operand 1845 states and 2687 transitions. Second operand 4 states. [2019-09-16 17:05:52,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:52,938 INFO L93 Difference]: Finished difference Result 2037 states and 2942 transitions. [2019-09-16 17:05:52,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:52,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2019-09-16 17:05:52,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:52,940 INFO L225 Difference]: With dead ends: 2037 [2019-09-16 17:05:52,940 INFO L226 Difference]: Without dead ends: 2037 [2019-09-16 17:05:52,941 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:52,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2019-09-16 17:05:52,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 1845. [2019-09-16 17:05:52,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-09-16 17:05:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2681 transitions. [2019-09-16 17:05:52,955 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2681 transitions. Word has length 233 [2019-09-16 17:05:52,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:52,955 INFO L475 AbstractCegarLoop]: Abstraction has 1845 states and 2681 transitions. [2019-09-16 17:05:52,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2681 transitions. [2019-09-16 17:05:52,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-16 17:05:52,958 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:52,958 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:52,958 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:52,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:52,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1667065919, now seen corresponding path program 1 times [2019-09-16 17:05:52,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:52,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:52,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:53,048 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-09-16 17:05:53,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:53,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:53,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:53,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:53,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:53,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:53,049 INFO L87 Difference]: Start difference. First operand 1845 states and 2681 transitions. Second operand 4 states. [2019-09-16 17:05:53,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:53,417 INFO L93 Difference]: Finished difference Result 1917 states and 2767 transitions. [2019-09-16 17:05:53,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:53,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2019-09-16 17:05:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:53,421 INFO L225 Difference]: With dead ends: 1917 [2019-09-16 17:05:53,422 INFO L226 Difference]: Without dead ends: 1917 [2019-09-16 17:05:53,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:05:53,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2019-09-16 17:05:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1845. [2019-09-16 17:05:53,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-09-16 17:05:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2675 transitions. [2019-09-16 17:05:53,445 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2675 transitions. Word has length 234 [2019-09-16 17:05:53,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:53,445 INFO L475 AbstractCegarLoop]: Abstraction has 1845 states and 2675 transitions. [2019-09-16 17:05:53,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2675 transitions. [2019-09-16 17:05:53,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-16 17:05:53,449 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:53,449 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,449 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:53,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:53,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1262788273, now seen corresponding path program 1 times [2019-09-16 17:05:53,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:53,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:53,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-16 17:05:53,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:53,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:53,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:53,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:53,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:53,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:53,574 INFO L87 Difference]: Start difference. First operand 1845 states and 2675 transitions. Second operand 4 states. [2019-09-16 17:05:53,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:53,896 INFO L93 Difference]: Finished difference Result 2037 states and 2930 transitions. [2019-09-16 17:05:53,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:53,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2019-09-16 17:05:53,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:53,899 INFO L225 Difference]: With dead ends: 2037 [2019-09-16 17:05:53,899 INFO L226 Difference]: Without dead ends: 2037 [2019-09-16 17:05:53,899 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:53,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2019-09-16 17:05:53,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 1845. [2019-09-16 17:05:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-09-16 17:05:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2669 transitions. [2019-09-16 17:05:53,914 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2669 transitions. Word has length 234 [2019-09-16 17:05:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:53,914 INFO L475 AbstractCegarLoop]: Abstraction has 1845 states and 2669 transitions. [2019-09-16 17:05:53,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2669 transitions. [2019-09-16 17:05:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-16 17:05:53,917 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:53,917 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:53,917 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:53,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:53,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1023254022, now seen corresponding path program 1 times [2019-09-16 17:05:53,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:53,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:53,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-09-16 17:05:54,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:54,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:54,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:54,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:54,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:54,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:54,042 INFO L87 Difference]: Start difference. First operand 1845 states and 2669 transitions. Second operand 4 states. [2019-09-16 17:05:54,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:54,322 INFO L93 Difference]: Finished difference Result 1893 states and 2722 transitions. [2019-09-16 17:05:54,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:54,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2019-09-16 17:05:54,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:54,324 INFO L225 Difference]: With dead ends: 1893 [2019-09-16 17:05:54,325 INFO L226 Difference]: Without dead ends: 1893 [2019-09-16 17:05:54,325 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,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2019-09-16 17:05:54,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1845. [2019-09-16 17:05:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-09-16 17:05:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2663 transitions. [2019-09-16 17:05:54,345 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2663 transitions. Word has length 235 [2019-09-16 17:05:54,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:54,345 INFO L475 AbstractCegarLoop]: Abstraction has 1845 states and 2663 transitions. [2019-09-16 17:05:54,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2663 transitions. [2019-09-16 17:05:54,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-16 17:05:54,348 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:54,349 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,349 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:54,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:54,349 INFO L82 PathProgramCache]: Analyzing trace with hash -425871408, now seen corresponding path program 1 times [2019-09-16 17:05:54,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:54,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:54,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:54,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:54,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-16 17:05:54,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:54,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:54,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:54,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:54,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:54,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:54,453 INFO L87 Difference]: Start difference. First operand 1845 states and 2663 transitions. Second operand 4 states. [2019-09-16 17:05:54,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:54,927 INFO L93 Difference]: Finished difference Result 2037 states and 2918 transitions. [2019-09-16 17:05:54,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:54,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2019-09-16 17:05:54,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:54,929 INFO L225 Difference]: With dead ends: 2037 [2019-09-16 17:05:54,929 INFO L226 Difference]: Without dead ends: 2037 [2019-09-16 17:05:54,930 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:54,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2019-09-16 17:05:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 1845. [2019-09-16 17:05:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-09-16 17:05:54,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2657 transitions. [2019-09-16 17:05:54,944 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2657 transitions. Word has length 235 [2019-09-16 17:05:54,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:54,945 INFO L475 AbstractCegarLoop]: Abstraction has 1845 states and 2657 transitions. [2019-09-16 17:05:54,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2657 transitions. [2019-09-16 17:05:54,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-16 17:05:54,947 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:54,948 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,948 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:54,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:54,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1986107564, now seen corresponding path program 1 times [2019-09-16 17:05:54,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:54,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:54,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:54,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:54,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-16 17:05:55,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:55,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:55,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:55,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:55,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:55,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:55,068 INFO L87 Difference]: Start difference. First operand 1845 states and 2657 transitions. Second operand 4 states. [2019-09-16 17:05:55,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:55,399 INFO L93 Difference]: Finished difference Result 2037 states and 2912 transitions. [2019-09-16 17:05:55,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:55,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-09-16 17:05:55,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:55,403 INFO L225 Difference]: With dead ends: 2037 [2019-09-16 17:05:55,403 INFO L226 Difference]: Without dead ends: 2037 [2019-09-16 17:05:55,404 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:55,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2019-09-16 17:05:55,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 1845. [2019-09-16 17:05:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-09-16 17:05:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2651 transitions. [2019-09-16 17:05:55,417 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2651 transitions. Word has length 236 [2019-09-16 17:05:55,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:55,417 INFO L475 AbstractCegarLoop]: Abstraction has 1845 states and 2651 transitions. [2019-09-16 17:05:55,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:55,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2651 transitions. [2019-09-16 17:05:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-16 17:05:55,419 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:55,420 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,420 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:55,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:55,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1626101397, now seen corresponding path program 1 times [2019-09-16 17:05:55,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:55,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:55,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:55,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:55,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-16 17:05:55,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:55,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:55,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:55,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:55,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:55,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:55,557 INFO L87 Difference]: Start difference. First operand 1845 states and 2651 transitions. Second operand 4 states. [2019-09-16 17:05:55,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:55,980 INFO L93 Difference]: Finished difference Result 1977 states and 2834 transitions. [2019-09-16 17:05:55,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:55,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-09-16 17:05:55,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:55,983 INFO L225 Difference]: With dead ends: 1977 [2019-09-16 17:05:55,983 INFO L226 Difference]: Without dead ends: 1977 [2019-09-16 17:05:55,983 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:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2019-09-16 17:05:55,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1845. [2019-09-16 17:05:55,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-09-16 17:05:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2645 transitions. [2019-09-16 17:05:55,996 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2645 transitions. Word has length 237 [2019-09-16 17:05:55,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:55,996 INFO L475 AbstractCegarLoop]: Abstraction has 1845 states and 2645 transitions. [2019-09-16 17:05:55,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2645 transitions. [2019-09-16 17:05:55,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-16 17:05:55,999 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:55,999 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:55,999 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:55,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:56,000 INFO L82 PathProgramCache]: Analyzing trace with hash -217991611, now seen corresponding path program 1 times [2019-09-16 17:05:56,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:56,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:56,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:56,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:56,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-16 17:05:56,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:56,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:56,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:56,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:56,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:56,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:56,132 INFO L87 Difference]: Start difference. First operand 1845 states and 2645 transitions. Second operand 4 states. [2019-09-16 17:05:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:56,430 INFO L93 Difference]: Finished difference Result 1977 states and 2828 transitions. [2019-09-16 17:05:56,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:56,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-09-16 17:05:56,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:56,433 INFO L225 Difference]: With dead ends: 1977 [2019-09-16 17:05:56,433 INFO L226 Difference]: Without dead ends: 1977 [2019-09-16 17:05:56,433 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,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2019-09-16 17:05:56,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1845. [2019-09-16 17:05:56,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-09-16 17:05:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2639 transitions. [2019-09-16 17:05:56,447 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2639 transitions. Word has length 241 [2019-09-16 17:05:56,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:56,447 INFO L475 AbstractCegarLoop]: Abstraction has 1845 states and 2639 transitions. [2019-09-16 17:05:56,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:56,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2639 transitions. [2019-09-16 17:05:56,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-16 17:05:56,449 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:56,449 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,450 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:56,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:56,450 INFO L82 PathProgramCache]: Analyzing trace with hash -597306223, now seen corresponding path program 1 times [2019-09-16 17:05:56,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:56,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:56,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:56,555 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-16 17:05:56,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:56,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:56,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:56,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:56,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:56,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:56,557 INFO L87 Difference]: Start difference. First operand 1845 states and 2639 transitions. Second operand 4 states. [2019-09-16 17:05:56,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:56,854 INFO L93 Difference]: Finished difference Result 1977 states and 2822 transitions. [2019-09-16 17:05:56,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:56,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-09-16 17:05:56,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:56,860 INFO L225 Difference]: With dead ends: 1977 [2019-09-16 17:05:56,860 INFO L226 Difference]: Without dead ends: 1977 [2019-09-16 17:05:56,860 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,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2019-09-16 17:05:56,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1845. [2019-09-16 17:05:56,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-09-16 17:05:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2633 transitions. [2019-09-16 17:05:56,874 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2633 transitions. Word has length 241 [2019-09-16 17:05:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:56,875 INFO L475 AbstractCegarLoop]: Abstraction has 1845 states and 2633 transitions. [2019-09-16 17:05:56,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:56,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2633 transitions. [2019-09-16 17:05:56,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-16 17:05:56,878 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:56,878 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,878 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:56,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:56,878 INFO L82 PathProgramCache]: Analyzing trace with hash 548747110, now seen corresponding path program 1 times [2019-09-16 17:05:56,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:56,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:56,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:56,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:56,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-16 17:05:56,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:56,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:56,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:56,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:56,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:56,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:56,963 INFO L87 Difference]: Start difference. First operand 1845 states and 2633 transitions. Second operand 4 states. [2019-09-16 17:05:57,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:57,261 INFO L93 Difference]: Finished difference Result 1953 states and 2783 transitions. [2019-09-16 17:05:57,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:57,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2019-09-16 17:05:57,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:57,263 INFO L225 Difference]: With dead ends: 1953 [2019-09-16 17:05:57,263 INFO L226 Difference]: Without dead ends: 1953 [2019-09-16 17:05:57,264 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,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2019-09-16 17:05:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1845. [2019-09-16 17:05:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-09-16 17:05:57,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2627 transitions. [2019-09-16 17:05:57,279 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2627 transitions. Word has length 242 [2019-09-16 17:05:57,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:57,279 INFO L475 AbstractCegarLoop]: Abstraction has 1845 states and 2627 transitions. [2019-09-16 17:05:57,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2627 transitions. [2019-09-16 17:05:57,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-16 17:05:57,282 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:57,282 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,282 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:57,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:57,283 INFO L82 PathProgramCache]: Analyzing trace with hash 558495314, now seen corresponding path program 1 times [2019-09-16 17:05:57,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:57,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:57,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:57,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:57,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:57,388 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-16 17:05:57,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:57,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:57,389 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:57,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:57,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:57,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:57,390 INFO L87 Difference]: Start difference. First operand 1845 states and 2627 transitions. Second operand 4 states. [2019-09-16 17:05:57,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:57,672 INFO L93 Difference]: Finished difference Result 1923 states and 2738 transitions. [2019-09-16 17:05:57,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:57,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2019-09-16 17:05:57,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:57,674 INFO L225 Difference]: With dead ends: 1923 [2019-09-16 17:05:57,675 INFO L226 Difference]: Without dead ends: 1923 [2019-09-16 17:05:57,675 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,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2019-09-16 17:05:57,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1845. [2019-09-16 17:05:57,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-09-16 17:05:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2621 transitions. [2019-09-16 17:05:57,688 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2621 transitions. Word has length 242 [2019-09-16 17:05:57,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:57,689 INFO L475 AbstractCegarLoop]: Abstraction has 1845 states and 2621 transitions. [2019-09-16 17:05:57,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2621 transitions. [2019-09-16 17:05:57,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-16 17:05:57,691 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:57,691 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:57,692 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:57,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:57,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2033193422, now seen corresponding path program 1 times [2019-09-16 17:05:57,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:57,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:57,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:57,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:57,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-09-16 17:05:57,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:57,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:57,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:57,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:57,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:57,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:57,818 INFO L87 Difference]: Start difference. First operand 1845 states and 2621 transitions. Second operand 4 states. [2019-09-16 17:05:58,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:58,171 INFO L93 Difference]: Finished difference Result 2247 states and 3230 transitions. [2019-09-16 17:05:58,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:58,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2019-09-16 17:05:58,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:58,174 INFO L225 Difference]: With dead ends: 2247 [2019-09-16 17:05:58,175 INFO L226 Difference]: Without dead ends: 2247 [2019-09-16 17:05:58,175 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,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2019-09-16 17:05:58,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 2025. [2019-09-16 17:05:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2025 states. [2019-09-16 17:05:58,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 2939 transitions. [2019-09-16 17:05:58,191 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 2939 transitions. Word has length 244 [2019-09-16 17:05:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:58,191 INFO L475 AbstractCegarLoop]: Abstraction has 2025 states and 2939 transitions. [2019-09-16 17:05:58,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 2939 transitions. [2019-09-16 17:05:58,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-16 17:05:58,193 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:58,193 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,193 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:58,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:58,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1945514927, now seen corresponding path program 1 times [2019-09-16 17:05:58,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:58,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:58,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:58,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:58,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:58,349 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-09-16 17:05:58,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:58,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:05:58,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:58,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:05:58,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:05:58,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:58,350 INFO L87 Difference]: Start difference. First operand 2025 states and 2939 transitions. Second operand 5 states. [2019-09-16 17:05:58,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:58,969 INFO L93 Difference]: Finished difference Result 2487 states and 3638 transitions. [2019-09-16 17:05:58,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:05:58,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 250 [2019-09-16 17:05:58,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:58,971 INFO L225 Difference]: With dead ends: 2487 [2019-09-16 17:05:58,971 INFO L226 Difference]: Without dead ends: 2487 [2019-09-16 17:05:58,972 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:05:58,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2019-09-16 17:05:58,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2223. [2019-09-16 17:05:58,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2019-09-16 17:05:58,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3293 transitions. [2019-09-16 17:05:58,988 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3293 transitions. Word has length 250 [2019-09-16 17:05:58,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:58,988 INFO L475 AbstractCegarLoop]: Abstraction has 2223 states and 3293 transitions. [2019-09-16 17:05:58,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:05:58,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3293 transitions. [2019-09-16 17:05:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-16 17:05:58,991 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:58,991 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:58,992 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:58,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:58,992 INFO L82 PathProgramCache]: Analyzing trace with hash -502398052, now seen corresponding path program 1 times [2019-09-16 17:05:58,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:58,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:58,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:58,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:58,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-09-16 17:05:59,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:59,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:59,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:59,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:59,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:59,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:59,085 INFO L87 Difference]: Start difference. First operand 2223 states and 3293 transitions. Second operand 4 states. [2019-09-16 17:05:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:59,366 INFO L93 Difference]: Finished difference Result 2271 states and 3346 transitions. [2019-09-16 17:05:59,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:59,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2019-09-16 17:05:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:59,368 INFO L225 Difference]: With dead ends: 2271 [2019-09-16 17:05:59,368 INFO L226 Difference]: Without dead ends: 2271 [2019-09-16 17:05:59,369 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,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2019-09-16 17:05:59,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 2223. [2019-09-16 17:05:59,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2019-09-16 17:05:59,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3287 transitions. [2019-09-16 17:05:59,390 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3287 transitions. Word has length 251 [2019-09-16 17:05:59,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:59,390 INFO L475 AbstractCegarLoop]: Abstraction has 2223 states and 3287 transitions. [2019-09-16 17:05:59,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3287 transitions. [2019-09-16 17:05:59,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-16 17:05:59,393 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:59,394 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:59,394 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:59,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:59,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1160183260, now seen corresponding path program 1 times [2019-09-16 17:05:59,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:59,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:59,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:59,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:59,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-09-16 17:05:59,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:59,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:59,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:59,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:59,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:59,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:59,501 INFO L87 Difference]: Start difference. First operand 2223 states and 3287 transitions. Second operand 4 states. [2019-09-16 17:05:59,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:59,816 INFO L93 Difference]: Finished difference Result 2271 states and 3340 transitions. [2019-09-16 17:05:59,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:59,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-09-16 17:05:59,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:59,820 INFO L225 Difference]: With dead ends: 2271 [2019-09-16 17:05:59,820 INFO L226 Difference]: Without dead ends: 2271 [2019-09-16 17:05:59,820 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,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2019-09-16 17:05:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 2223. [2019-09-16 17:05:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2019-09-16 17:05:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3281 transitions. [2019-09-16 17:05:59,844 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3281 transitions. Word has length 252 [2019-09-16 17:05:59,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:59,844 INFO L475 AbstractCegarLoop]: Abstraction has 2223 states and 3281 transitions. [2019-09-16 17:05:59,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:59,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3281 transitions. [2019-09-16 17:05:59,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-16 17:05:59,847 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:59,848 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:59,848 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:59,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:59,849 INFO L82 PathProgramCache]: Analyzing trace with hash 498977655, now seen corresponding path program 1 times [2019-09-16 17:05:59,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:59,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:59,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:59,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:59,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-09-16 17:05:59,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:59,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:59,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:59,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:59,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:59,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:59,954 INFO L87 Difference]: Start difference. First operand 2223 states and 3281 transitions. Second operand 4 states. [2019-09-16 17:06:00,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:00,224 INFO L93 Difference]: Finished difference Result 2253 states and 3313 transitions. [2019-09-16 17:06:00,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:00,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 253 [2019-09-16 17:06:00,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:00,227 INFO L225 Difference]: With dead ends: 2253 [2019-09-16 17:06:00,228 INFO L226 Difference]: Without dead ends: 2253 [2019-09-16 17:06:00,228 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,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2019-09-16 17:06:00,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 2223. [2019-09-16 17:06:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2019-09-16 17:06:00,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3275 transitions. [2019-09-16 17:06:00,244 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3275 transitions. Word has length 253 [2019-09-16 17:06:00,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:00,245 INFO L475 AbstractCegarLoop]: Abstraction has 2223 states and 3275 transitions. [2019-09-16 17:06:00,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:00,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3275 transitions. [2019-09-16 17:06:00,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-16 17:06:00,246 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:00,247 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:00,247 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:00,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:00,247 INFO L82 PathProgramCache]: Analyzing trace with hash 2037491268, now seen corresponding path program 1 times [2019-09-16 17:06:00,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:00,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:00,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:00,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:00,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:00,536 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 372 proven. 68 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:00,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:06:00,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:06:00,538 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2019-09-16 17:06:00,540 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], [552], [555], [568], [573], [575], [578], [580], [586], [589], [593], [614], [648], [650], [662], [665], [666], [678], [686], [687], [688] [2019-09-16 17:06:00,595 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:06:00,596 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:06:00,659 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:06:00,661 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:00,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:00,666 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:06:00,759 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-16 17:06:00,760 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:06:00,770 INFO L420 sIntCurrentIteration]: We unified 254 AI predicates to 254 [2019-09-16 17:06:00,770 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:06:00,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:06:00,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2019-09-16 17:06:00,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:00,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 17:06:00,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 17:06:00,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:06:00,773 INFO L87 Difference]: Start difference. First operand 2223 states and 3275 transitions. Second operand 2 states. [2019-09-16 17:06:00,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:00,774 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-16 17:06:00,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 17:06:00,774 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 255 [2019-09-16 17:06:00,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:00,774 INFO L225 Difference]: With dead ends: 2 [2019-09-16 17:06:00,774 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:06:00,775 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 254 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:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:06:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:06:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:06:00,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:06:00,775 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 255 [2019-09-16 17:06:00,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:00,776 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:06:00,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 17:06:00,776 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:06:00,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:06:00,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:06:00 BoogieIcfgContainer [2019-09-16 17:06:00,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:06:00,784 INFO L168 Benchmark]: Toolchain (without parser) took 43580.55 ms. Allocated memory was 140.0 MB in the beginning and 726.1 MB in the end (delta: 586.2 MB). Free memory was 85.4 MB in the beginning and 301.9 MB in the end (delta: -216.5 MB). Peak memory consumption was 369.7 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:00,784 INFO L168 Benchmark]: CDTParser took 0.92 ms. Allocated memory is still 140.0 MB. Free memory was 106.1 MB in the beginning and 105.9 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:00,786 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1041.58 ms. Allocated memory was 140.0 MB in the beginning and 199.8 MB in the end (delta: 59.8 MB). Free memory was 85.2 MB in the beginning and 156.1 MB in the end (delta: -70.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:00,791 INFO L168 Benchmark]: Boogie Preprocessor took 180.35 ms. Allocated memory is still 199.8 MB. Free memory was 156.1 MB in the beginning and 148.5 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:00,793 INFO L168 Benchmark]: RCFGBuilder took 1385.07 ms. Allocated memory was 199.8 MB in the beginning and 224.9 MB in the end (delta: 25.2 MB). Free memory was 148.5 MB in the beginning and 166.6 MB in the end (delta: -18.1 MB). Peak memory consumption was 81.1 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:00,796 INFO L168 Benchmark]: TraceAbstraction took 40968.66 ms. Allocated memory was 224.9 MB in the beginning and 726.1 MB in the end (delta: 501.2 MB). Free memory was 165.3 MB in the beginning and 301.9 MB in the end (delta: -136.6 MB). Peak memory consumption was 364.6 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:00,801 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.92 ms. Allocated memory is still 140.0 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1041.58 ms. Allocated memory was 140.0 MB in the beginning and 199.8 MB in the end (delta: 59.8 MB). Free memory was 85.2 MB in the beginning and 156.1 MB in the end (delta: -70.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 180.35 ms. Allocated memory is still 199.8 MB. Free memory was 156.1 MB in the beginning and 148.5 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1385.07 ms. Allocated memory was 199.8 MB in the beginning and 224.9 MB in the end (delta: 25.2 MB). Free memory was 148.5 MB in the beginning and 166.6 MB in the end (delta: -18.1 MB). Peak memory consumption was 81.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 40968.66 ms. Allocated memory was 224.9 MB in the beginning and 726.1 MB in the end (delta: 501.2 MB). Free memory was 165.3 MB in the beginning and 301.9 MB in the end (delta: -136.6 MB). Peak memory consumption was 364.6 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, 40.9s OverallTime, 89 OverallIterations, 8 TraceHistogramMax, 30.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20414 SDtfs, 5589 SDslu, 28412 SDs, 0 SdLazy, 17306 SolverSat, 643 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 733 GetRequests, 444 SyntacticMatches, 38 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2223occurred in iteration=85, 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.1968503937007875 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 89 MinimizatonAttempts, 9198 StatesRemovedByMinimization, 86 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 12399 NumberOfCodeBlocks, 12399 NumberOfCodeBlocksAsserted, 89 NumberOfCheckSat, 12310 ConstructedInterpolants, 0 QuantifiedInterpolants, 4337711 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 89 InterpolantComputations, 88 PerfectInterpolantSequences, 16055/16123 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...