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.02.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:16,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:16,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:16,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:16,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:16,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:16,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:16,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:16,212 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:16,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:16,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:16,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:16,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:16,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:16,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:16,219 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:16,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:16,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:16,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:16,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:16,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:16,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:16,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:16,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:16,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:16,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:16,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:16,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:16,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:16,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:16,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:16,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:16,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:16,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:16,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:16,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:16,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:16,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:16,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:16,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:16,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:16,251 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:27:16,267 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:16,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:16,268 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:16,268 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:16,269 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:16,269 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:16,269 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:16,270 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:16,270 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:16,270 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:16,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:16,271 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:16,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:16,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:16,272 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:16,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:16,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:16,272 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:16,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:16,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:16,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:16,273 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:16,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:16,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:16,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:16,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:16,274 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:16,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:16,274 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:16,275 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:16,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:16,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:16,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:16,322 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:16,322 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:16,323 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.02.i.cil-2.c [2019-09-20 13:27:16,396 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66fd01b02/df8b0b17f85f425c986896cb1ade636e/FLAGeb3ead24d [2019-09-20 13:27:17,058 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:17,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.02.i.cil-2.c [2019-09-20 13:27:17,094 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66fd01b02/df8b0b17f85f425c986896cb1ade636e/FLAGeb3ead24d [2019-09-20 13:27:17,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66fd01b02/df8b0b17f85f425c986896cb1ade636e [2019-09-20 13:27:17,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:17,252 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:17,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:17,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:17,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:17,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:17" (1/1) ... [2019-09-20 13:27:17,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e08c620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:17, skipping insertion in model container [2019-09-20 13:27:17,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:17" (1/1) ... [2019-09-20 13:27:17,269 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:17,344 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:17,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:18,008 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:18,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:18,198 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:18,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:18 WrapperNode [2019-09-20 13:27:18,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:18,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:18,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:18,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:18,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:18" (1/1) ... [2019-09-20 13:27:18,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:18" (1/1) ... [2019-09-20 13:27:18,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:18" (1/1) ... [2019-09-20 13:27:18,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:18" (1/1) ... [2019-09-20 13:27:18,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:18" (1/1) ... [2019-09-20 13:27:18,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:18" (1/1) ... [2019-09-20 13:27:18,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:18" (1/1) ... [2019-09-20 13:27:18,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:18,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:18,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:18,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:18,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27: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-20 13:27:18,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:18,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:18,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:27:18,479 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:27:18,479 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:18,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:27:18,480 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:18,480 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:18,480 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:18,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:18,481 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:18,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:18,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:18,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:18,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:27:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:27:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:27:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:18,485 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:18,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:18,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:18,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:18,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:18,486 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:18,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:18,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:18,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:18,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:18,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:18,981 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:19,725 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:27:19,725 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:27:19,749 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:19,750 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:19,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:19 BoogieIcfgContainer [2019-09-20 13:27:19,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:19,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:19,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:19,756 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:19,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:17" (1/3) ... [2019-09-20 13:27:19,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4c5c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:19, skipping insertion in model container [2019-09-20 13:27:19,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:18" (2/3) ... [2019-09-20 13:27:19,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4c5c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:19, skipping insertion in model container [2019-09-20 13:27:19,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:19" (3/3) ... [2019-09-20 13:27:19,760 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-2.c [2019-09-20 13:27:19,772 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:19,781 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:19,800 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:19,828 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:19,828 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:19,828 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:19,828 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:19,828 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:19,829 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:19,829 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:19,829 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-09-20 13:27:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:27:19,863 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:19,865 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:19,867 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:19,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:19,873 INFO L82 PathProgramCache]: Analyzing trace with hash -958109655, now seen corresponding path program 1 times [2019-09-20 13:27:19,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:19,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:19,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:20,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:20,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:20,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:20,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:20,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:20,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:20,344 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 4 states. [2019-09-20 13:27:20,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:20,861 INFO L93 Difference]: Finished difference Result 185 states and 300 transitions. [2019-09-20 13:27:20,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:20,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-09-20 13:27:20,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:20,877 INFO L225 Difference]: With dead ends: 185 [2019-09-20 13:27:20,877 INFO L226 Difference]: Without dead ends: 164 [2019-09-20 13:27:20,879 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:20,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-20 13:27:20,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2019-09-20 13:27:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-20 13:27:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 222 transitions. [2019-09-20 13:27:20,936 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 222 transitions. Word has length 51 [2019-09-20 13:27:20,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:20,936 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 222 transitions. [2019-09-20 13:27:20,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2019-09-20 13:27:20,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:20,940 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:20,940 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:20,941 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:20,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:20,941 INFO L82 PathProgramCache]: Analyzing trace with hash -479309281, now seen corresponding path program 1 times [2019-09-20 13:27:20,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:20,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:20,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:21,091 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:21,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:21,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:21,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:21,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:21,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:21,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:21,095 INFO L87 Difference]: Start difference. First operand 147 states and 222 transitions. Second operand 4 states. [2019-09-20 13:27:21,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:21,595 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2019-09-20 13:27:21,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:21,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:21,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:21,603 INFO L225 Difference]: With dead ends: 164 [2019-09-20 13:27:21,606 INFO L226 Difference]: Without dead ends: 164 [2019-09-20 13:27:21,607 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:21,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-20 13:27:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2019-09-20 13:27:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-20 13:27:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 221 transitions. [2019-09-20 13:27:21,619 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 221 transitions. Word has length 64 [2019-09-20 13:27:21,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:21,619 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 221 transitions. [2019-09-20 13:27:21,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 221 transitions. [2019-09-20 13:27:21,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:21,621 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:21,621 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:21,622 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:21,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:21,622 INFO L82 PathProgramCache]: Analyzing trace with hash 242258695, now seen corresponding path program 1 times [2019-09-20 13:27:21,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:21,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:21,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:21,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:21,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:21,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:21,726 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:21,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:21,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:21,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:21,727 INFO L87 Difference]: Start difference. First operand 147 states and 221 transitions. Second operand 4 states. [2019-09-20 13:27:22,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:22,051 INFO L93 Difference]: Finished difference Result 163 states and 240 transitions. [2019-09-20 13:27:22,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:22,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:22,053 INFO L225 Difference]: With dead ends: 163 [2019-09-20 13:27:22,053 INFO L226 Difference]: Without dead ends: 163 [2019-09-20 13:27:22,054 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-20 13:27:22,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 147. [2019-09-20 13:27:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-20 13:27:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 220 transitions. [2019-09-20 13:27:22,067 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 220 transitions. Word has length 65 [2019-09-20 13:27:22,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:22,067 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 220 transitions. [2019-09-20 13:27:22,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 220 transitions. [2019-09-20 13:27:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:22,075 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:22,075 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:22,076 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:22,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:22,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1080269467, now seen corresponding path program 1 times [2019-09-20 13:27:22,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:22,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:22,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:22,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:22,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:27:22,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:22,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:27:22,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:27:22,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:22,254 INFO L87 Difference]: Start difference. First operand 147 states and 220 transitions. Second operand 5 states. [2019-09-20 13:27:22,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:22,825 INFO L93 Difference]: Finished difference Result 168 states and 248 transitions. [2019-09-20 13:27:22,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:22,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-09-20 13:27:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:22,828 INFO L225 Difference]: With dead ends: 168 [2019-09-20 13:27:22,829 INFO L226 Difference]: Without dead ends: 168 [2019-09-20 13:27:22,829 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:27:22,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-20 13:27:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-09-20 13:27:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:22,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 247 transitions. [2019-09-20 13:27:22,841 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 247 transitions. Word has length 65 [2019-09-20 13:27:22,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:22,842 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 247 transitions. [2019-09-20 13:27:22,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:27:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2019-09-20 13:27:22,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:22,844 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:22,844 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:22,844 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:22,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:22,845 INFO L82 PathProgramCache]: Analyzing trace with hash -639330733, now seen corresponding path program 1 times [2019-09-20 13:27:22,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:22,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:22,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:22,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:22,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:22,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:22,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:22,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:22,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:22,997 INFO L87 Difference]: Start difference. First operand 167 states and 247 transitions. Second operand 4 states. [2019-09-20 13:27:23,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:23,316 INFO L93 Difference]: Finished difference Result 182 states and 264 transitions. [2019-09-20 13:27:23,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:23,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:23,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:23,319 INFO L225 Difference]: With dead ends: 182 [2019-09-20 13:27:23,319 INFO L226 Difference]: Without dead ends: 182 [2019-09-20 13:27:23,319 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:23,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-20 13:27:23,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 167. [2019-09-20 13:27:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:23,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 246 transitions. [2019-09-20 13:27:23,327 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 246 transitions. Word has length 65 [2019-09-20 13:27:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:23,328 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 246 transitions. [2019-09-20 13:27:23,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 246 transitions. [2019-09-20 13:27:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:23,329 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:23,329 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:23,329 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:23,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:23,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1139982254, now seen corresponding path program 1 times [2019-09-20 13:27:23,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:23,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:23,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:23,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:23,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:23,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:23,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:23,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:23,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:23,451 INFO L87 Difference]: Start difference. First operand 167 states and 246 transitions. Second operand 4 states. [2019-09-20 13:27:23,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:23,753 INFO L93 Difference]: Finished difference Result 180 states and 261 transitions. [2019-09-20 13:27:23,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:23,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:23,757 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:27:23,757 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:27:23,757 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:27:23,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-20 13:27:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:23,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 245 transitions. [2019-09-20 13:27:23,765 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 245 transitions. Word has length 65 [2019-09-20 13:27:23,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:23,765 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 245 transitions. [2019-09-20 13:27:23,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:23,765 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2019-09-20 13:27:23,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:27:23,766 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:23,766 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:23,767 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:23,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:23,767 INFO L82 PathProgramCache]: Analyzing trace with hash -447244068, now seen corresponding path program 1 times [2019-09-20 13:27:23,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:23,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:23,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:23,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:23,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:23,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:23,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:23,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:23,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:23,831 INFO L87 Difference]: Start difference. First operand 167 states and 245 transitions. Second operand 4 states. [2019-09-20 13:27:24,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:24,153 INFO L93 Difference]: Finished difference Result 180 states and 260 transitions. [2019-09-20 13:27:24,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:24,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:27:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:24,156 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:27:24,156 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:27:24,157 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:24,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:27:24,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-20 13:27:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:24,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 244 transitions. [2019-09-20 13:27:24,182 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 244 transitions. Word has length 66 [2019-09-20 13:27:24,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:24,183 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 244 transitions. [2019-09-20 13:27:24,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 244 transitions. [2019-09-20 13:27:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:27:24,184 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:24,184 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:24,185 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:24,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:24,185 INFO L82 PathProgramCache]: Analyzing trace with hash 144054159, now seen corresponding path program 1 times [2019-09-20 13:27:24,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:24,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:24,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:24,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:24,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:24,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:24,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:24,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:24,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:24,256 INFO L87 Difference]: Start difference. First operand 167 states and 244 transitions. Second operand 4 states. [2019-09-20 13:27:24,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:24,564 INFO L93 Difference]: Finished difference Result 180 states and 259 transitions. [2019-09-20 13:27:24,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:24,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-20 13:27:24,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:24,567 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:27:24,567 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:27:24,567 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:24,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:27:24,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-20 13:27:24,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:24,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 243 transitions. [2019-09-20 13:27:24,574 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 243 transitions. Word has length 67 [2019-09-20 13:27:24,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:24,574 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 243 transitions. [2019-09-20 13:27:24,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:24,575 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 243 transitions. [2019-09-20 13:27:24,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-20 13:27:24,575 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:24,576 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:24,576 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:24,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:24,576 INFO L82 PathProgramCache]: Analyzing trace with hash 91729367, now seen corresponding path program 1 times [2019-09-20 13:27:24,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:24,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:24,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:24,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:24,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:24,672 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:24,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:24,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:24,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:24,673 INFO L87 Difference]: Start difference. First operand 167 states and 243 transitions. Second operand 4 states. [2019-09-20 13:27:24,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:24,960 INFO L93 Difference]: Finished difference Result 180 states and 258 transitions. [2019-09-20 13:27:24,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:24,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-20 13:27:24,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:24,962 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:27:24,963 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:27:24,963 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:24,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:27:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-20 13:27:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 242 transitions. [2019-09-20 13:27:24,972 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 242 transitions. Word has length 68 [2019-09-20 13:27:24,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:24,973 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 242 transitions. [2019-09-20 13:27:24,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:24,978 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 242 transitions. [2019-09-20 13:27:24,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-20 13:27:24,979 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:24,980 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:24,980 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:24,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:24,983 INFO L82 PathProgramCache]: Analyzing trace with hash 952871030, now seen corresponding path program 1 times [2019-09-20 13:27:24,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:24,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:24,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:25,070 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:25,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:25,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:25,071 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:25,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:25,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:25,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:25,072 INFO L87 Difference]: Start difference. First operand 167 states and 242 transitions. Second operand 4 states. [2019-09-20 13:27:25,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:25,390 INFO L93 Difference]: Finished difference Result 210 states and 306 transitions. [2019-09-20 13:27:25,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:25,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-20 13:27:25,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:25,392 INFO L225 Difference]: With dead ends: 210 [2019-09-20 13:27:25,392 INFO L226 Difference]: Without dead ends: 210 [2019-09-20 13:27:25,393 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:25,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-20 13:27:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 189. [2019-09-20 13:27:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 279 transitions. [2019-09-20 13:27:25,399 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 279 transitions. Word has length 68 [2019-09-20 13:27:25,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:25,400 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 279 transitions. [2019-09-20 13:27:25,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 279 transitions. [2019-09-20 13:27:25,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-20 13:27:25,401 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:25,401 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:25,401 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:25,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:25,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1561927466, now seen corresponding path program 1 times [2019-09-20 13:27:25,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:25,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:25,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:25,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:25,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:25,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:25,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:25,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:25,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:25,467 INFO L87 Difference]: Start difference. First operand 189 states and 279 transitions. Second operand 4 states. [2019-09-20 13:27:25,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:25,782 INFO L93 Difference]: Finished difference Result 192 states and 282 transitions. [2019-09-20 13:27:25,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:25,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-20 13:27:25,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:25,785 INFO L225 Difference]: With dead ends: 192 [2019-09-20 13:27:25,785 INFO L226 Difference]: Without dead ends: 192 [2019-09-20 13:27:25,786 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-20 13:27:25,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2019-09-20 13:27:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 278 transitions. [2019-09-20 13:27:25,792 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 278 transitions. Word has length 69 [2019-09-20 13:27:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:25,792 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 278 transitions. [2019-09-20 13:27:25,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 278 transitions. [2019-09-20 13:27:25,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:25,793 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:25,793 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:25,793 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:25,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:25,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1661253362, now seen corresponding path program 1 times [2019-09-20 13:27:25,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:25,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:25,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:25,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:25,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:25,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:25,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:25,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:25,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:25,851 INFO L87 Difference]: Start difference. First operand 189 states and 278 transitions. Second operand 4 states. [2019-09-20 13:27:26,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,187 INFO L93 Difference]: Finished difference Result 210 states and 304 transitions. [2019-09-20 13:27:26,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:26,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:26,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,189 INFO L225 Difference]: With dead ends: 210 [2019-09-20 13:27:26,189 INFO L226 Difference]: Without dead ends: 210 [2019-09-20 13:27:26,190 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:26,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-20 13:27:26,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 189. [2019-09-20 13:27:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:26,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 277 transitions. [2019-09-20 13:27:26,195 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 277 transitions. Word has length 81 [2019-09-20 13:27:26,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,196 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 277 transitions. [2019-09-20 13:27:26,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:26,196 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 277 transitions. [2019-09-20 13:27:26,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:27:26,197 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:26,197 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:26,198 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:26,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1293601760, now seen corresponding path program 1 times [2019-09-20 13:27:26,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:26,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:26,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:26,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:26,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:26,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:26,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:26,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:26,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:26,256 INFO L87 Difference]: Start difference. First operand 189 states and 277 transitions. Second operand 4 states. [2019-09-20 13:27:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,593 INFO L93 Difference]: Finished difference Result 209 states and 302 transitions. [2019-09-20 13:27:26,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:26,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:27:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,596 INFO L225 Difference]: With dead ends: 209 [2019-09-20 13:27:26,597 INFO L226 Difference]: Without dead ends: 209 [2019-09-20 13:27:26,597 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-20 13:27:26,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 189. [2019-09-20 13:27:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 276 transitions. [2019-09-20 13:27:26,603 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 276 transitions. Word has length 82 [2019-09-20 13:27:26,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,603 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 276 transitions. [2019-09-20 13:27:26,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:26,603 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 276 transitions. [2019-09-20 13:27:26,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:27:26,604 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:26,604 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:26,605 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:26,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,605 INFO L82 PathProgramCache]: Analyzing trace with hash 792950239, now seen corresponding path program 1 times [2019-09-20 13:27:26,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:26,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:26,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:26,663 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:26,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:26,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:26,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:26,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:26,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:26,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:26,665 INFO L87 Difference]: Start difference. First operand 189 states and 276 transitions. Second operand 4 states. [2019-09-20 13:27:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,982 INFO L93 Difference]: Finished difference Result 207 states and 299 transitions. [2019-09-20 13:27:26,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:26,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:27:26,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,984 INFO L225 Difference]: With dead ends: 207 [2019-09-20 13:27:26,984 INFO L226 Difference]: Without dead ends: 207 [2019-09-20 13:27:26,985 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:26,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-20 13:27:26,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-09-20 13:27:26,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:26,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 275 transitions. [2019-09-20 13:27:26,990 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 275 transitions. Word has length 82 [2019-09-20 13:27:26,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,991 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 275 transitions. [2019-09-20 13:27:26,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:26,991 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 275 transitions. [2019-09-20 13:27:26,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:27:26,992 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:26,992 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:26,993 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:26,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,993 INFO L82 PathProgramCache]: Analyzing trace with hash -655878929, now seen corresponding path program 1 times [2019-09-20 13:27:26,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:26,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:26,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:27,056 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:27,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:27,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:27,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:27,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:27,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:27,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,058 INFO L87 Difference]: Start difference. First operand 189 states and 275 transitions. Second operand 4 states. [2019-09-20 13:27:27,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:27,385 INFO L93 Difference]: Finished difference Result 207 states and 298 transitions. [2019-09-20 13:27:27,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:27,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-20 13:27:27,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:27,387 INFO L225 Difference]: With dead ends: 207 [2019-09-20 13:27:27,387 INFO L226 Difference]: Without dead ends: 207 [2019-09-20 13:27:27,387 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-20 13:27:27,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-09-20 13:27:27,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 274 transitions. [2019-09-20 13:27:27,393 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 274 transitions. Word has length 83 [2019-09-20 13:27:27,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:27,393 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 274 transitions. [2019-09-20 13:27:27,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:27,394 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 274 transitions. [2019-09-20 13:27:27,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-20 13:27:27,395 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:27,395 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:27,395 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:27,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:27,395 INFO L82 PathProgramCache]: Analyzing trace with hash -2028659236, now seen corresponding path program 1 times [2019-09-20 13:27:27,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:27,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:27,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:27,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:27,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:27,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:27,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:27,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:27,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,469 INFO L87 Difference]: Start difference. First operand 189 states and 274 transitions. Second operand 4 states. [2019-09-20 13:27:27,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:27,903 INFO L93 Difference]: Finished difference Result 207 states and 297 transitions. [2019-09-20 13:27:27,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:27,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-20 13:27:27,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:27,906 INFO L225 Difference]: With dead ends: 207 [2019-09-20 13:27:27,906 INFO L226 Difference]: Without dead ends: 207 [2019-09-20 13:27:27,906 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-20 13:27:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-09-20 13:27:27,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 273 transitions. [2019-09-20 13:27:27,912 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 273 transitions. Word has length 84 [2019-09-20 13:27:27,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:27,912 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 273 transitions. [2019-09-20 13:27:27,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:27,913 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 273 transitions. [2019-09-20 13:27:27,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-20 13:27:27,915 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:27,915 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:27,915 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:27,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:27,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1457090858, now seen corresponding path program 1 times [2019-09-20 13:27:27,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:27,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:27,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:27,993 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:27,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:27,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:27,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:27,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:27,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:27,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,995 INFO L87 Difference]: Start difference. First operand 189 states and 273 transitions. Second operand 4 states. [2019-09-20 13:27:28,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:28,400 INFO L93 Difference]: Finished difference Result 207 states and 296 transitions. [2019-09-20 13:27:28,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:28,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-20 13:27:28,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:28,402 INFO L225 Difference]: With dead ends: 207 [2019-09-20 13:27:28,402 INFO L226 Difference]: Without dead ends: 207 [2019-09-20 13:27:28,403 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-20 13:27:28,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-09-20 13:27:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:28,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 272 transitions. [2019-09-20 13:27:28,408 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 272 transitions. Word has length 85 [2019-09-20 13:27:28,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:28,408 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 272 transitions. [2019-09-20 13:27:28,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:28,408 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 272 transitions. [2019-09-20 13:27:28,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-20 13:27:28,409 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:28,409 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:28,410 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:28,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:28,410 INFO L82 PathProgramCache]: Analyzing trace with hash 938460727, now seen corresponding path program 1 times [2019-09-20 13:27:28,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:28,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:28,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:28,488 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:28,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:28,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:28,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:28,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:28,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:28,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:28,490 INFO L87 Difference]: Start difference. First operand 189 states and 272 transitions. Second operand 4 states. [2019-09-20 13:27:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:28,772 INFO L93 Difference]: Finished difference Result 197 states and 283 transitions. [2019-09-20 13:27:28,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:28,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-20 13:27:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:28,774 INFO L225 Difference]: With dead ends: 197 [2019-09-20 13:27:28,774 INFO L226 Difference]: Without dead ends: 197 [2019-09-20 13:27:28,775 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:28,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-20 13:27:28,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 189. [2019-09-20 13:27:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 271 transitions. [2019-09-20 13:27:28,780 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 271 transitions. Word has length 86 [2019-09-20 13:27:28,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:28,781 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 271 transitions. [2019-09-20 13:27:28,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 271 transitions. [2019-09-20 13:27:28,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-20 13:27:28,782 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:28,783 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:28,783 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:28,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:28,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1406221366, now seen corresponding path program 1 times [2019-09-20 13:27:28,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:28,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:28,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:28,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:28,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:28,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:28,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:28,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:28,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:28,887 INFO L87 Difference]: Start difference. First operand 189 states and 271 transitions. Second operand 4 states. [2019-09-20 13:27:29,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:29,399 INFO L93 Difference]: Finished difference Result 284 states and 416 transitions. [2019-09-20 13:27:29,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:29,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-20 13:27:29,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:29,401 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:27:29,401 INFO L226 Difference]: Without dead ends: 284 [2019-09-20 13:27:29,402 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-20 13:27:29,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 232. [2019-09-20 13:27:29,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-20 13:27:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 348 transitions. [2019-09-20 13:27:29,409 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 348 transitions. Word has length 90 [2019-09-20 13:27:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:29,410 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 348 transitions. [2019-09-20 13:27:29,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 348 transitions. [2019-09-20 13:27:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-20 13:27:29,411 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:29,411 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:29,411 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:29,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:29,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1991352652, now seen corresponding path program 1 times [2019-09-20 13:27:29,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:29,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:29,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:29,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:29,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:29,491 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:29,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:29,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:29,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,492 INFO L87 Difference]: Start difference. First operand 232 states and 348 transitions. Second operand 4 states. [2019-09-20 13:27:29,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:29,843 INFO L93 Difference]: Finished difference Result 281 states and 421 transitions. [2019-09-20 13:27:29,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:29,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-20 13:27:29,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:29,846 INFO L225 Difference]: With dead ends: 281 [2019-09-20 13:27:29,847 INFO L226 Difference]: Without dead ends: 281 [2019-09-20 13:27:29,847 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:29,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-20 13:27:29,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 256. [2019-09-20 13:27:29,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 389 transitions. [2019-09-20 13:27:29,854 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 389 transitions. Word has length 90 [2019-09-20 13:27:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:29,854 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 389 transitions. [2019-09-20 13:27:29,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:29,855 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 389 transitions. [2019-09-20 13:27:29,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:29,856 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:29,856 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:29,856 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:29,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:29,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1233888286, now seen corresponding path program 1 times [2019-09-20 13:27:29,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:29,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:29,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:29,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:29,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:29,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:29,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:29,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:29,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,932 INFO L87 Difference]: Start difference. First operand 256 states and 389 transitions. Second operand 4 states. [2019-09-20 13:27:30,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:30,407 INFO L93 Difference]: Finished difference Result 308 states and 456 transitions. [2019-09-20 13:27:30,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:30,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:30,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:30,411 INFO L225 Difference]: With dead ends: 308 [2019-09-20 13:27:30,411 INFO L226 Difference]: Without dead ends: 308 [2019-09-20 13:27:30,412 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:30,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-20 13:27:30,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 256. [2019-09-20 13:27:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:30,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 388 transitions. [2019-09-20 13:27:30,422 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 388 transitions. Word has length 103 [2019-09-20 13:27:30,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:30,423 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 388 transitions. [2019-09-20 13:27:30,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:30,423 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 388 transitions. [2019-09-20 13:27:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:30,425 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:30,425 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:30,425 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:30,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1274563036, now seen corresponding path program 1 times [2019-09-20 13:27:30,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:30,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:30,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:30,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:30,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:30,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:30,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:30,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:30,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,518 INFO L87 Difference]: Start difference. First operand 256 states and 388 transitions. Second operand 4 states. [2019-09-20 13:27:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:31,014 INFO L93 Difference]: Finished difference Result 281 states and 419 transitions. [2019-09-20 13:27:31,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:31,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:31,017 INFO L225 Difference]: With dead ends: 281 [2019-09-20 13:27:31,017 INFO L226 Difference]: Without dead ends: 281 [2019-09-20 13:27:31,018 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:31,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-20 13:27:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 256. [2019-09-20 13:27:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 387 transitions. [2019-09-20 13:27:31,024 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 387 transitions. Word has length 103 [2019-09-20 13:27:31,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:31,024 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 387 transitions. [2019-09-20 13:27:31,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 387 transitions. [2019-09-20 13:27:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:31,026 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:31,026 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:31,027 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:31,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:31,028 INFO L82 PathProgramCache]: Analyzing trace with hash 930186292, now seen corresponding path program 1 times [2019-09-20 13:27:31,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:31,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:31,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:31,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:31,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:31,165 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:31,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:31,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:31,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:31,166 INFO L87 Difference]: Start difference. First operand 256 states and 387 transitions. Second operand 4 states. [2019-09-20 13:27:31,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:31,684 INFO L93 Difference]: Finished difference Result 307 states and 453 transitions. [2019-09-20 13:27:31,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:31,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:31,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:31,687 INFO L225 Difference]: With dead ends: 307 [2019-09-20 13:27:31,687 INFO L226 Difference]: Without dead ends: 307 [2019-09-20 13:27:31,687 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:31,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-20 13:27:31,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 256. [2019-09-20 13:27:31,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 386 transitions. [2019-09-20 13:27:31,696 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 386 transitions. Word has length 104 [2019-09-20 13:27:31,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:31,697 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 386 transitions. [2019-09-20 13:27:31,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:31,697 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 386 transitions. [2019-09-20 13:27:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:31,698 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:31,698 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:31,699 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:31,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:31,700 INFO L82 PathProgramCache]: Analyzing trace with hash 429534771, now seen corresponding path program 1 times [2019-09-20 13:27:31,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:31,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:31,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:31,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:31,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:31,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:31,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:31,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:31,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:31,777 INFO L87 Difference]: Start difference. First operand 256 states and 386 transitions. Second operand 4 states. [2019-09-20 13:27:32,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:32,229 INFO L93 Difference]: Finished difference Result 305 states and 450 transitions. [2019-09-20 13:27:32,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:32,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:32,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:32,233 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:27:32,233 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:27:32,234 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:32,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:27:32,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2019-09-20 13:27:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 385 transitions. [2019-09-20 13:27:32,244 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 385 transitions. Word has length 104 [2019-09-20 13:27:32,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:32,244 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 385 transitions. [2019-09-20 13:27:32,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:32,245 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 385 transitions. [2019-09-20 13:27:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:32,247 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:32,247 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:32,247 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:32,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:32,250 INFO L82 PathProgramCache]: Analyzing trace with hash -2103863754, now seen corresponding path program 1 times [2019-09-20 13:27:32,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:32,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:32,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:32,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:32,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:32,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:32,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:32,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:32,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:32,352 INFO L87 Difference]: Start difference. First operand 256 states and 385 transitions. Second operand 4 states. [2019-09-20 13:27:32,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:32,796 INFO L93 Difference]: Finished difference Result 280 states and 415 transitions. [2019-09-20 13:27:32,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:32,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:32,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:32,799 INFO L225 Difference]: With dead ends: 280 [2019-09-20 13:27:32,799 INFO L226 Difference]: Without dead ends: 280 [2019-09-20 13:27:32,799 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-20 13:27:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2019-09-20 13:27:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:32,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 384 transitions. [2019-09-20 13:27:32,806 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 384 transitions. Word has length 104 [2019-09-20 13:27:32,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:32,807 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 384 transitions. [2019-09-20 13:27:32,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:32,807 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 384 transitions. [2019-09-20 13:27:32,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:32,808 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:32,809 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:32,809 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:32,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:32,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1690452021, now seen corresponding path program 1 times [2019-09-20 13:27:32,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:32,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:32,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:32,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:32,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:32,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:32,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:32,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:32,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:32,890 INFO L87 Difference]: Start difference. First operand 256 states and 384 transitions. Second operand 4 states. [2019-09-20 13:27:33,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:33,247 INFO L93 Difference]: Finished difference Result 278 states and 412 transitions. [2019-09-20 13:27:33,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:33,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:33,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:33,249 INFO L225 Difference]: With dead ends: 278 [2019-09-20 13:27:33,249 INFO L226 Difference]: Without dead ends: 278 [2019-09-20 13:27:33,250 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:33,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-20 13:27:33,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2019-09-20 13:27:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 383 transitions. [2019-09-20 13:27:33,256 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 383 transitions. Word has length 104 [2019-09-20 13:27:33,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:33,256 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 383 transitions. [2019-09-20 13:27:33,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:33,257 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 383 transitions. [2019-09-20 13:27:33,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:33,258 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:33,258 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:33,258 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:33,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:33,259 INFO L82 PathProgramCache]: Analyzing trace with hash 963143451, now seen corresponding path program 1 times [2019-09-20 13:27:33,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:33,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:33,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:33,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:33,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:33,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:33,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:33,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:33,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:33,323 INFO L87 Difference]: Start difference. First operand 256 states and 383 transitions. Second operand 4 states. [2019-09-20 13:27:33,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:33,759 INFO L93 Difference]: Finished difference Result 305 states and 447 transitions. [2019-09-20 13:27:33,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:33,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:33,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:33,762 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:27:33,763 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:27:33,763 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:33,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:27:33,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2019-09-20 13:27:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:33,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 382 transitions. [2019-09-20 13:27:33,770 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 382 transitions. Word has length 105 [2019-09-20 13:27:33,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:33,770 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 382 transitions. [2019-09-20 13:27:33,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:33,771 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 382 transitions. [2019-09-20 13:27:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:33,772 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:33,772 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:33,772 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:33,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:33,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1396872537, now seen corresponding path program 1 times [2019-09-20 13:27:33,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:33,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:33,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:33,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:33,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:33,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:33,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:33,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:33,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:33,837 INFO L87 Difference]: Start difference. First operand 256 states and 382 transitions. Second operand 4 states. [2019-09-20 13:27:34,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,166 INFO L93 Difference]: Finished difference Result 278 states and 410 transitions. [2019-09-20 13:27:34,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:34,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,169 INFO L225 Difference]: With dead ends: 278 [2019-09-20 13:27:34,169 INFO L226 Difference]: Without dead ends: 278 [2019-09-20 13:27:34,170 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:34,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-20 13:27:34,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2019-09-20 13:27:34,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 381 transitions. [2019-09-20 13:27:34,177 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 381 transitions. Word has length 105 [2019-09-20 13:27:34,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,177 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 381 transitions. [2019-09-20 13:27:34,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,177 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 381 transitions. [2019-09-20 13:27:34,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:27:34,179 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,179 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:34,179 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,180 INFO L82 PathProgramCache]: Analyzing trace with hash 916394288, now seen corresponding path program 1 times [2019-09-20 13:27:34,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:34,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:34,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:34,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:34,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:34,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:34,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:34,254 INFO L87 Difference]: Start difference. First operand 256 states and 381 transitions. Second operand 4 states. [2019-09-20 13:27:34,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,689 INFO L93 Difference]: Finished difference Result 305 states and 445 transitions. [2019-09-20 13:27:34,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:34,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:27:34,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,691 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:27:34,691 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:27:34,691 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:34,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:27:34,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2019-09-20 13:27:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 380 transitions. [2019-09-20 13:27:34,697 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 380 transitions. Word has length 106 [2019-09-20 13:27:34,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,698 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 380 transitions. [2019-09-20 13:27:34,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 380 transitions. [2019-09-20 13:27:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:27:34,699 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,699 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:34,699 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1477094066, now seen corresponding path program 1 times [2019-09-20 13:27:34,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:34,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:34,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:34,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:34,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:34,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:34,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:34,759 INFO L87 Difference]: Start difference. First operand 256 states and 380 transitions. Second operand 4 states. [2019-09-20 13:27:35,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:35,117 INFO L93 Difference]: Finished difference Result 278 states and 408 transitions. [2019-09-20 13:27:35,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:35,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:27:35,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:35,119 INFO L225 Difference]: With dead ends: 278 [2019-09-20 13:27:35,119 INFO L226 Difference]: Without dead ends: 278 [2019-09-20 13:27:35,120 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:35,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-20 13:27:35,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2019-09-20 13:27:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:35,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2019-09-20 13:27:35,126 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 106 [2019-09-20 13:27:35,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:35,126 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2019-09-20 13:27:35,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:35,126 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2019-09-20 13:27:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-20 13:27:35,127 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:35,128 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:35,128 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:35,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:35,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1735530410, now seen corresponding path program 1 times [2019-09-20 13:27:35,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:35,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:35,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:35,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:35,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:35,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:35,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:35,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:35,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:35,193 INFO L87 Difference]: Start difference. First operand 256 states and 379 transitions. Second operand 4 states. [2019-09-20 13:27:35,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:35,622 INFO L93 Difference]: Finished difference Result 305 states and 443 transitions. [2019-09-20 13:27:35,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:35,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-20 13:27:35,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:35,625 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:27:35,625 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:27:35,625 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:35,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:27:35,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2019-09-20 13:27:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:35,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 378 transitions. [2019-09-20 13:27:35,631 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 378 transitions. Word has length 107 [2019-09-20 13:27:35,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:35,631 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 378 transitions. [2019-09-20 13:27:35,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 378 transitions. [2019-09-20 13:27:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-20 13:27:35,633 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:35,633 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:35,633 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:35,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:35,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1533706476, now seen corresponding path program 1 times [2019-09-20 13:27:35,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:35,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:35,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:35,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:35,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:35,702 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:35,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:35,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:35,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:35,703 INFO L87 Difference]: Start difference. First operand 256 states and 378 transitions. Second operand 4 states. [2019-09-20 13:27:36,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:36,031 INFO L93 Difference]: Finished difference Result 278 states and 406 transitions. [2019-09-20 13:27:36,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:36,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-20 13:27:36,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:36,033 INFO L225 Difference]: With dead ends: 278 [2019-09-20 13:27:36,033 INFO L226 Difference]: Without dead ends: 278 [2019-09-20 13:27:36,034 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:36,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-20 13:27:36,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2019-09-20 13:27:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 377 transitions. [2019-09-20 13:27:36,042 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 377 transitions. Word has length 107 [2019-09-20 13:27:36,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:36,043 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 377 transitions. [2019-09-20 13:27:36,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 377 transitions. [2019-09-20 13:27:36,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:27:36,044 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:36,044 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:36,045 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:36,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:36,045 INFO L82 PathProgramCache]: Analyzing trace with hash 751449227, now seen corresponding path program 1 times [2019-09-20 13:27:36,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:36,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:36,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:36,126 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:36,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:36,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:36,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:36,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:36,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:36,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:36,131 INFO L87 Difference]: Start difference. First operand 256 states and 377 transitions. Second operand 4 states. [2019-09-20 13:27:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:36,535 INFO L93 Difference]: Finished difference Result 295 states and 429 transitions. [2019-09-20 13:27:36,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:36,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-20 13:27:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:36,539 INFO L225 Difference]: With dead ends: 295 [2019-09-20 13:27:36,539 INFO L226 Difference]: Without dead ends: 295 [2019-09-20 13:27:36,539 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:36,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-20 13:27:36,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 256. [2019-09-20 13:27:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 376 transitions. [2019-09-20 13:27:36,545 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 376 transitions. Word has length 108 [2019-09-20 13:27:36,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:36,546 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 376 transitions. [2019-09-20 13:27:36,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:36,546 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 376 transitions. [2019-09-20 13:27:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:27:36,547 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:36,547 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:36,547 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:36,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:36,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1581943411, now seen corresponding path program 1 times [2019-09-20 13:27:36,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:36,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:36,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:36,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:36,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:36,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:36,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:36,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:36,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:36,621 INFO L87 Difference]: Start difference. First operand 256 states and 376 transitions. Second operand 4 states. [2019-09-20 13:27:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:36,940 INFO L93 Difference]: Finished difference Result 268 states and 392 transitions. [2019-09-20 13:27:36,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:36,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-20 13:27:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:36,943 INFO L225 Difference]: With dead ends: 268 [2019-09-20 13:27:36,943 INFO L226 Difference]: Without dead ends: 268 [2019-09-20 13:27:36,944 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-09-20 13:27:36,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 256. [2019-09-20 13:27:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 375 transitions. [2019-09-20 13:27:36,950 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 375 transitions. Word has length 108 [2019-09-20 13:27:36,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:36,950 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 375 transitions. [2019-09-20 13:27:36,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:36,950 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 375 transitions. [2019-09-20 13:27:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-20 13:27:36,951 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:36,952 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:36,952 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:36,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:36,952 INFO L82 PathProgramCache]: Analyzing trace with hash 697482930, now seen corresponding path program 1 times [2019-09-20 13:27:36,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:36,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:36,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,049 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:37,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:37,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:37,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:37,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:37,051 INFO L87 Difference]: Start difference. First operand 256 states and 375 transitions. Second operand 4 states. [2019-09-20 13:27:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:37,458 INFO L93 Difference]: Finished difference Result 295 states and 427 transitions. [2019-09-20 13:27:37,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:37,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-20 13:27:37,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:37,461 INFO L225 Difference]: With dead ends: 295 [2019-09-20 13:27:37,461 INFO L226 Difference]: Without dead ends: 295 [2019-09-20 13:27:37,461 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:37,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-20 13:27:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 256. [2019-09-20 13:27:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:37,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 374 transitions. [2019-09-20 13:27:37,467 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 374 transitions. Word has length 112 [2019-09-20 13:27:37,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:37,467 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 374 transitions. [2019-09-20 13:27:37,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:37,468 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 374 transitions. [2019-09-20 13:27:37,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-20 13:27:37,469 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:37,469 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:37,469 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:37,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:37,469 INFO L82 PathProgramCache]: Analyzing trace with hash -988696908, now seen corresponding path program 1 times [2019-09-20 13:27:37,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:37,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:37,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-20 13:27:37,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:37,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:37,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:37,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:37,544 INFO L87 Difference]: Start difference. First operand 256 states and 374 transitions. Second operand 3 states. [2019-09-20 13:27:37,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:37,570 INFO L93 Difference]: Finished difference Result 485 states and 717 transitions. [2019-09-20 13:27:37,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:37,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-20 13:27:37,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:37,573 INFO L225 Difference]: With dead ends: 485 [2019-09-20 13:27:37,574 INFO L226 Difference]: Without dead ends: 485 [2019-09-20 13:27:37,574 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:37,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-09-20 13:27:37,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2019-09-20 13:27:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-09-20 13:27:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 717 transitions. [2019-09-20 13:27:37,582 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 717 transitions. Word has length 112 [2019-09-20 13:27:37,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:37,583 INFO L475 AbstractCegarLoop]: Abstraction has 485 states and 717 transitions. [2019-09-20 13:27:37,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 717 transitions. [2019-09-20 13:27:37,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-20 13:27:37,584 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27: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, 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-20 13:27:37,585 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:37,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:37,585 INFO L82 PathProgramCache]: Analyzing trace with hash 250169335, now seen corresponding path program 1 times [2019-09-20 13:27:37,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:37,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:37,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:37,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:37,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:37,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:37,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:37,655 INFO L87 Difference]: Start difference. First operand 485 states and 717 transitions. Second operand 3 states. [2019-09-20 13:27:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:37,684 INFO L93 Difference]: Finished difference Result 714 states and 1061 transitions. [2019-09-20 13:27:37,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:37,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-20 13:27:37,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:37,687 INFO L225 Difference]: With dead ends: 714 [2019-09-20 13:27:37,688 INFO L226 Difference]: Without dead ends: 714 [2019-09-20 13:27: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-20 13:27:37,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-20 13:27:37,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2019-09-20 13:27:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-09-20 13:27:37,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1061 transitions. [2019-09-20 13:27:37,706 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1061 transitions. Word has length 131 [2019-09-20 13:27:37,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:37,708 INFO L475 AbstractCegarLoop]: Abstraction has 714 states and 1061 transitions. [2019-09-20 13:27:37,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:37,709 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1061 transitions. [2019-09-20 13:27:37,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-20 13:27:37,711 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:37,711 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 2, 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] [2019-09-20 13:27:37,712 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:37,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:37,712 INFO L82 PathProgramCache]: Analyzing trace with hash 266552896, now seen corresponding path program 1 times [2019-09-20 13:27:37,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:37,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:37,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-20 13:27:37,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:37,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:37,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:37,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:37,806 INFO L87 Difference]: Start difference. First operand 714 states and 1061 transitions. Second operand 4 states. [2019-09-20 13:27:38,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:38,301 INFO L93 Difference]: Finished difference Result 1013 states and 1515 transitions. [2019-09-20 13:27:38,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:38,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-20 13:27:38,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:38,309 INFO L225 Difference]: With dead ends: 1013 [2019-09-20 13:27:38,309 INFO L226 Difference]: Without dead ends: 1013 [2019-09-20 13:27:38,310 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-09-20 13:27:38,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 780. [2019-09-20 13:27:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-09-20 13:27:38,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1172 transitions. [2019-09-20 13:27:38,324 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1172 transitions. Word has length 176 [2019-09-20 13:27:38,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:38,325 INFO L475 AbstractCegarLoop]: Abstraction has 780 states and 1172 transitions. [2019-09-20 13:27:38,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:38,325 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1172 transitions. [2019-09-20 13:27:38,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-20 13:27:38,327 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:38,327 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 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] [2019-09-20 13:27:38,328 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:38,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:38,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1805534481, now seen corresponding path program 1 times [2019-09-20 13:27:38,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:38,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:38,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:38,435 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-20 13:27:38,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:38,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:38,436 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:38,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:38,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:38,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:38,437 INFO L87 Difference]: Start difference. First operand 780 states and 1172 transitions. Second operand 4 states. [2019-09-20 13:27:38,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:38,936 INFO L93 Difference]: Finished difference Result 998 states and 1489 transitions. [2019-09-20 13:27:38,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:38,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-09-20 13:27:38,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:38,941 INFO L225 Difference]: With dead ends: 998 [2019-09-20 13:27:38,942 INFO L226 Difference]: Without dead ends: 998 [2019-09-20 13:27:38,942 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:38,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-09-20 13:27:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 783. [2019-09-20 13:27:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-20 13:27:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1175 transitions. [2019-09-20 13:27:38,957 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1175 transitions. Word has length 177 [2019-09-20 13:27:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:38,957 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1175 transitions. [2019-09-20 13:27:38,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1175 transitions. [2019-09-20 13:27:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-20 13:27:38,959 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:38,960 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 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] [2019-09-20 13:27:38,960 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:38,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:38,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1080000358, now seen corresponding path program 1 times [2019-09-20 13:27:38,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:38,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:38,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:39,045 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-20 13:27:39,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:39,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:39,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:39,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:39,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:39,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:39,047 INFO L87 Difference]: Start difference. First operand 783 states and 1175 transitions. Second operand 4 states. [2019-09-20 13:27:39,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:39,537 INFO L93 Difference]: Finished difference Result 998 states and 1486 transitions. [2019-09-20 13:27:39,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:39,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-09-20 13:27:39,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:39,543 INFO L225 Difference]: With dead ends: 998 [2019-09-20 13:27:39,543 INFO L226 Difference]: Without dead ends: 998 [2019-09-20 13:27:39,543 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:39,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-09-20 13:27:39,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 783. [2019-09-20 13:27:39,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-20 13:27:39,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1172 transitions. [2019-09-20 13:27:39,559 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1172 transitions. Word has length 189 [2019-09-20 13:27:39,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:39,560 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1172 transitions. [2019-09-20 13:27:39,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:39,560 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1172 transitions. [2019-09-20 13:27:39,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-20 13:27:39,563 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:39,563 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 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] [2019-09-20 13:27:39,563 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:39,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2140603606, now seen corresponding path program 1 times [2019-09-20 13:27:39,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:39,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:39,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-20 13:27:39,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:39,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:39,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:39,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:39,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:39,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:39,646 INFO L87 Difference]: Start difference. First operand 783 states and 1172 transitions. Second operand 4 states. [2019-09-20 13:27:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:40,119 INFO L93 Difference]: Finished difference Result 995 states and 1480 transitions. [2019-09-20 13:27:40,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:40,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-09-20 13:27:40,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:40,124 INFO L225 Difference]: With dead ends: 995 [2019-09-20 13:27:40,124 INFO L226 Difference]: Without dead ends: 995 [2019-09-20 13:27:40,125 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2019-09-20 13:27:40,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 783. [2019-09-20 13:27:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-20 13:27:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1169 transitions. [2019-09-20 13:27:40,139 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1169 transitions. Word has length 190 [2019-09-20 13:27:40,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:40,140 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1169 transitions. [2019-09-20 13:27:40,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1169 transitions. [2019-09-20 13:27:40,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-20 13:27:40,142 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:40,142 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 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] [2019-09-20 13:27:40,143 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:40,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:40,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1459417801, now seen corresponding path program 1 times [2019-09-20 13:27:40,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:40,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:40,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:40,264 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-20 13:27:40,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:40,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:40,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:40,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:40,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:40,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:40,266 INFO L87 Difference]: Start difference. First operand 783 states and 1169 transitions. Second operand 4 states. [2019-09-20 13:27:40,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:40,735 INFO L93 Difference]: Finished difference Result 989 states and 1471 transitions. [2019-09-20 13:27:40,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:40,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-09-20 13:27:40,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:40,739 INFO L225 Difference]: With dead ends: 989 [2019-09-20 13:27:40,739 INFO L226 Difference]: Without dead ends: 989 [2019-09-20 13:27:40,740 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:40,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-09-20 13:27:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 783. [2019-09-20 13:27:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-20 13:27:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1166 transitions. [2019-09-20 13:27:40,754 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1166 transitions. Word has length 190 [2019-09-20 13:27:40,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:40,754 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1166 transitions. [2019-09-20 13:27:40,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:40,754 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1166 transitions. [2019-09-20 13:27:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-20 13:27:40,757 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:40,757 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 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] [2019-09-20 13:27:40,757 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:40,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:40,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1675897929, now seen corresponding path program 1 times [2019-09-20 13:27:40,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:40,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:40,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-20 13:27:40,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:40,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:40,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:40,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:40,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:40,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:40,847 INFO L87 Difference]: Start difference. First operand 783 states and 1166 transitions. Second operand 4 states. [2019-09-20 13:27:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:41,306 INFO L93 Difference]: Finished difference Result 989 states and 1468 transitions. [2019-09-20 13:27:41,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:41,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-09-20 13:27:41,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:41,311 INFO L225 Difference]: With dead ends: 989 [2019-09-20 13:27:41,311 INFO L226 Difference]: Without dead ends: 989 [2019-09-20 13:27:41,311 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:41,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-09-20 13:27:41,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 783. [2019-09-20 13:27:41,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-20 13:27:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1163 transitions. [2019-09-20 13:27:41,325 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1163 transitions. Word has length 191 [2019-09-20 13:27:41,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:41,325 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1163 transitions. [2019-09-20 13:27:41,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:41,326 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1163 transitions. [2019-09-20 13:27:41,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-20 13:27:41,328 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:41,328 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 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] [2019-09-20 13:27:41,328 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:41,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:41,329 INFO L82 PathProgramCache]: Analyzing trace with hash -869515110, now seen corresponding path program 1 times [2019-09-20 13:27:41,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:41,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:41,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-20 13:27:41,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:41,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:41,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:41,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:41,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:41,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:41,411 INFO L87 Difference]: Start difference. First operand 783 states and 1163 transitions. Second operand 4 states. [2019-09-20 13:27:42,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:42,017 INFO L93 Difference]: Finished difference Result 989 states and 1465 transitions. [2019-09-20 13:27:42,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:42,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-09-20 13:27:42,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:42,022 INFO L225 Difference]: With dead ends: 989 [2019-09-20 13:27:42,023 INFO L226 Difference]: Without dead ends: 989 [2019-09-20 13:27:42,023 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:42,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-09-20 13:27:42,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 783. [2019-09-20 13:27:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-20 13:27:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1160 transitions. [2019-09-20 13:27:42,051 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1160 transitions. Word has length 192 [2019-09-20 13:27:42,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:42,052 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1160 transitions. [2019-09-20 13:27:42,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:42,052 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1160 transitions. [2019-09-20 13:27:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-20 13:27:42,056 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:42,057 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 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] [2019-09-20 13:27:42,058 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:42,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:42,058 INFO L82 PathProgramCache]: Analyzing trace with hash 910555054, now seen corresponding path program 1 times [2019-09-20 13:27:42,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:42,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:42,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-20 13:27:42,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:42,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:42,148 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:42,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:42,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:42,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:42,149 INFO L87 Difference]: Start difference. First operand 783 states and 1160 transitions. Second operand 4 states. [2019-09-20 13:27:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:42,650 INFO L93 Difference]: Finished difference Result 989 states and 1462 transitions. [2019-09-20 13:27:42,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:42,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-09-20 13:27:42,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:42,655 INFO L225 Difference]: With dead ends: 989 [2019-09-20 13:27:42,656 INFO L226 Difference]: Without dead ends: 989 [2019-09-20 13:27:42,656 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:42,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-09-20 13:27:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 783. [2019-09-20 13:27:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-20 13:27:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1157 transitions. [2019-09-20 13:27:42,669 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1157 transitions. Word has length 193 [2019-09-20 13:27:42,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:42,670 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1157 transitions. [2019-09-20 13:27:42,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1157 transitions. [2019-09-20 13:27:42,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-20 13:27:42,672 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:42,673 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 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] [2019-09-20 13:27:42,673 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:42,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:42,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2078842579, now seen corresponding path program 1 times [2019-09-20 13:27:42,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:42,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:42,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-20 13:27:42,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:42,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:42,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:42,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:42,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:42,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:42,756 INFO L87 Difference]: Start difference. First operand 783 states and 1157 transitions. Second operand 4 states. [2019-09-20 13:27:43,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:43,199 INFO L93 Difference]: Finished difference Result 989 states and 1459 transitions. [2019-09-20 13:27:43,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:43,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-09-20 13:27:43,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:43,205 INFO L225 Difference]: With dead ends: 989 [2019-09-20 13:27:43,205 INFO L226 Difference]: Without dead ends: 989 [2019-09-20 13:27:43,206 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:43,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-09-20 13:27:43,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 783. [2019-09-20 13:27:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-20 13:27:43,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1154 transitions. [2019-09-20 13:27:43,218 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1154 transitions. Word has length 193 [2019-09-20 13:27:43,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:43,219 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1154 transitions. [2019-09-20 13:27:43,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:43,219 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1154 transitions. [2019-09-20 13:27:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-20 13:27:43,221 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:43,221 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 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] [2019-09-20 13:27:43,222 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:43,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:43,222 INFO L82 PathProgramCache]: Analyzing trace with hash -658348961, now seen corresponding path program 1 times [2019-09-20 13:27:43,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:43,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:43,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-20 13:27:43,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:43,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:43,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:43,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:43,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:43,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:43,318 INFO L87 Difference]: Start difference. First operand 783 states and 1154 transitions. Second operand 4 states. [2019-09-20 13:27:43,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:43,780 INFO L93 Difference]: Finished difference Result 959 states and 1420 transitions. [2019-09-20 13:27:43,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:43,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-09-20 13:27:43,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:43,787 INFO L225 Difference]: With dead ends: 959 [2019-09-20 13:27:43,787 INFO L226 Difference]: Without dead ends: 959 [2019-09-20 13:27:43,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-20 13:27:43,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2019-09-20 13:27:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 783. [2019-09-20 13:27:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-20 13:27:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1151 transitions. [2019-09-20 13:27:43,802 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1151 transitions. Word has length 194 [2019-09-20 13:27:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:43,802 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1151 transitions. [2019-09-20 13:27:43,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1151 transitions. [2019-09-20 13:27:43,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-20 13:27:43,805 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:43,805 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 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] [2019-09-20 13:27:43,805 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:43,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:43,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1544069447, now seen corresponding path program 1 times [2019-09-20 13:27:43,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:43,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:43,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-20 13:27:43,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:43,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:43,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:43,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:43,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:43,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:43,912 INFO L87 Difference]: Start difference. First operand 783 states and 1151 transitions. Second operand 4 states. [2019-09-20 13:27:44,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:44,351 INFO L93 Difference]: Finished difference Result 959 states and 1417 transitions. [2019-09-20 13:27:44,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:44,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-09-20 13:27:44,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:44,357 INFO L225 Difference]: With dead ends: 959 [2019-09-20 13:27:44,357 INFO L226 Difference]: Without dead ends: 959 [2019-09-20 13:27:44,358 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:44,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2019-09-20 13:27:44,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 783. [2019-09-20 13:27:44,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-20 13:27:44,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1148 transitions. [2019-09-20 13:27:44,395 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1148 transitions. Word has length 194 [2019-09-20 13:27:44,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:44,396 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1148 transitions. [2019-09-20 13:27:44,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1148 transitions. [2019-09-20 13:27:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-20 13:27:44,398 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:44,398 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 3, 3, 2, 2, 2, 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] [2019-09-20 13:27:44,398 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:44,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:44,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1748280760, now seen corresponding path program 1 times [2019-09-20 13:27:44,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:44,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:44,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-20 13:27:44,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:44,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:44,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:44,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:44,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:44,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:44,481 INFO L87 Difference]: Start difference. First operand 783 states and 1148 transitions. Second operand 4 states. [2019-09-20 13:27:44,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:44,913 INFO L93 Difference]: Finished difference Result 950 states and 1402 transitions. [2019-09-20 13:27:44,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:44,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-09-20 13:27:44,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:44,919 INFO L225 Difference]: With dead ends: 950 [2019-09-20 13:27:44,919 INFO L226 Difference]: Without dead ends: 950 [2019-09-20 13:27:44,920 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-09-20 13:27:44,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 783. [2019-09-20 13:27:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-20 13:27:44,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1145 transitions. [2019-09-20 13:27:44,931 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1145 transitions. Word has length 195 [2019-09-20 13:27:44,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:44,931 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1145 transitions. [2019-09-20 13:27:44,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1145 transitions. [2019-09-20 13:27:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-20 13:27:44,933 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:44,934 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 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] [2019-09-20 13:27:44,934 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:44,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:44,934 INFO L82 PathProgramCache]: Analyzing trace with hash 972184600, now seen corresponding path program 2 times [2019-09-20 13:27:44,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:44,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:44,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:45,027 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-20 13:27:45,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:45,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:45,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:45,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:45,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:45,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:45,032 INFO L87 Difference]: Start difference. First operand 783 states and 1145 transitions. Second operand 4 states. [2019-09-20 13:27:45,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:45,472 INFO L93 Difference]: Finished difference Result 950 states and 1399 transitions. [2019-09-20 13:27:45,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:45,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-09-20 13:27:45,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:45,478 INFO L225 Difference]: With dead ends: 950 [2019-09-20 13:27:45,478 INFO L226 Difference]: Without dead ends: 950 [2019-09-20 13:27:45,479 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:45,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-09-20 13:27:45,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 786. [2019-09-20 13:27:45,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2019-09-20 13:27:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1148 transitions. [2019-09-20 13:27:45,487 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1148 transitions. Word has length 198 [2019-09-20 13:27:45,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:45,488 INFO L475 AbstractCegarLoop]: Abstraction has 786 states and 1148 transitions. [2019-09-20 13:27:45,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:45,488 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1148 transitions. [2019-09-20 13:27:45,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-20 13:27:45,489 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:45,490 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 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] [2019-09-20 13:27:45,490 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:45,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:45,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1406306023, now seen corresponding path program 1 times [2019-09-20 13:27:45,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:45,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:27:45,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-20 13:27:45,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:45,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:45,579 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:45,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:45,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:45,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:45,580 INFO L87 Difference]: Start difference. First operand 786 states and 1148 transitions. Second operand 4 states. [2019-09-20 13:27:45,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:45,981 INFO L93 Difference]: Finished difference Result 938 states and 1381 transitions. [2019-09-20 13:27:45,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:45,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-09-20 13:27:45,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:45,988 INFO L225 Difference]: With dead ends: 938 [2019-09-20 13:27:45,989 INFO L226 Difference]: Without dead ends: 938 [2019-09-20 13:27:45,989 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2019-09-20 13:27:45,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 789. [2019-09-20 13:27:46,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-09-20 13:27:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1151 transitions. [2019-09-20 13:27:46,001 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1151 transitions. Word has length 199 [2019-09-20 13:27:46,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:46,002 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1151 transitions. [2019-09-20 13:27:46,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1151 transitions. [2019-09-20 13:27:46,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-20 13:27:46,006 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:46,008 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:46,008 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:46,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:46,009 INFO L82 PathProgramCache]: Analyzing trace with hash -328133693, now seen corresponding path program 1 times [2019-09-20 13:27:46,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:46,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:46,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-20 13:27:46,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:46,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:46,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:46,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:46,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:46,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:46,136 INFO L87 Difference]: Start difference. First operand 789 states and 1151 transitions. Second operand 4 states. [2019-09-20 13:27:46,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:46,545 INFO L93 Difference]: Finished difference Result 938 states and 1378 transitions. [2019-09-20 13:27:46,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:46,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-09-20 13:27:46,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:46,552 INFO L225 Difference]: With dead ends: 938 [2019-09-20 13:27:46,553 INFO L226 Difference]: Without dead ends: 938 [2019-09-20 13:27:46,553 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:46,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2019-09-20 13:27:46,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 798. [2019-09-20 13:27:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2019-09-20 13:27:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1166 transitions. [2019-09-20 13:27:46,569 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1166 transitions. Word has length 201 [2019-09-20 13:27:46,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:46,569 INFO L475 AbstractCegarLoop]: Abstraction has 798 states and 1166 transitions. [2019-09-20 13:27:46,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:46,569 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1166 transitions. [2019-09-20 13:27:46,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-20 13:27:46,571 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:46,575 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:46,575 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:46,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:46,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1720230956, now seen corresponding path program 1 times [2019-09-20 13:27:46,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:46,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:46,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:46,669 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-20 13:27:46,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:46,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:46,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:46,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:46,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:46,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:46,671 INFO L87 Difference]: Start difference. First operand 798 states and 1166 transitions. Second operand 4 states. [2019-09-20 13:27:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:47,113 INFO L93 Difference]: Finished difference Result 914 states and 1336 transitions. [2019-09-20 13:27:47,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:47,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-09-20 13:27:47,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:47,124 INFO L225 Difference]: With dead ends: 914 [2019-09-20 13:27:47,125 INFO L226 Difference]: Without dead ends: 914 [2019-09-20 13:27:47,125 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:47,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-09-20 13:27:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 801. [2019-09-20 13:27:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2019-09-20 13:27:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2019-09-20 13:27:47,144 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 202 [2019-09-20 13:27:47,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:47,144 INFO L475 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2019-09-20 13:27:47,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:47,145 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2019-09-20 13:27:47,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-20 13:27:47,147 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:47,147 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:47,147 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:47,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:47,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1971718935, now seen corresponding path program 1 times [2019-09-20 13:27:47,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:47,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:47,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-20 13:27:47,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:47,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:47,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:47,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:47,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:47,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:47,242 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 4 states. [2019-09-20 13:27:47,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:47,626 INFO L93 Difference]: Finished difference Result 914 states and 1333 transitions. [2019-09-20 13:27:47,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:47,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2019-09-20 13:27:47,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:47,629 INFO L225 Difference]: With dead ends: 914 [2019-09-20 13:27:47,630 INFO L226 Difference]: Without dead ends: 914 [2019-09-20 13:27:47,630 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-09-20 13:27:47,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 804. [2019-09-20 13:27:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2019-09-20 13:27:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1172 transitions. [2019-09-20 13:27:47,642 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1172 transitions. Word has length 203 [2019-09-20 13:27:47,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:47,642 INFO L475 AbstractCegarLoop]: Abstraction has 804 states and 1172 transitions. [2019-09-20 13:27:47,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:47,642 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1172 transitions. [2019-09-20 13:27:47,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-20 13:27:47,644 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:47,645 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 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] [2019-09-20 13:27:47,645 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:47,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:47,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1994072257, now seen corresponding path program 1 times [2019-09-20 13:27:47,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:47,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:47,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:47,750 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-20 13:27:47,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:47,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:47,751 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:47,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:47,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:47,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:47,752 INFO L87 Difference]: Start difference. First operand 804 states and 1172 transitions. Second operand 4 states. [2019-09-20 13:27:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:48,126 INFO L93 Difference]: Finished difference Result 914 states and 1330 transitions. [2019-09-20 13:27:48,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:48,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-09-20 13:27:48,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:48,129 INFO L225 Difference]: With dead ends: 914 [2019-09-20 13:27:48,129 INFO L226 Difference]: Without dead ends: 914 [2019-09-20 13:27:48,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-20 13:27:48,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-09-20 13:27:48,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 804. [2019-09-20 13:27:48,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2019-09-20 13:27:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1169 transitions. [2019-09-20 13:27:48,143 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1169 transitions. Word has length 204 [2019-09-20 13:27:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:48,144 INFO L475 AbstractCegarLoop]: Abstraction has 804 states and 1169 transitions. [2019-09-20 13:27:48,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1169 transitions. [2019-09-20 13:27:48,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-20 13:27:48,146 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:48,146 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:48,147 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:48,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:48,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1276535462, now seen corresponding path program 1 times [2019-09-20 13:27:48,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:48,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:48,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-20 13:27:48,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:48,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:48,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:48,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:48,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:48,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:48,255 INFO L87 Difference]: Start difference. First operand 804 states and 1169 transitions. Second operand 4 states. [2019-09-20 13:27:48,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:48,622 INFO L93 Difference]: Finished difference Result 908 states and 1321 transitions. [2019-09-20 13:27:48,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:48,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-09-20 13:27:48,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:48,625 INFO L225 Difference]: With dead ends: 908 [2019-09-20 13:27:48,625 INFO L226 Difference]: Without dead ends: 908 [2019-09-20 13:27:48,626 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:48,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-09-20 13:27:48,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 807. [2019-09-20 13:27:48,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-09-20 13:27:48,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1172 transitions. [2019-09-20 13:27:48,636 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1172 transitions. Word has length 204 [2019-09-20 13:27:48,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:48,637 INFO L475 AbstractCegarLoop]: Abstraction has 807 states and 1172 transitions. [2019-09-20 13:27:48,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:48,637 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1172 transitions. [2019-09-20 13:27:48,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-20 13:27:48,639 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:48,639 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:48,639 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:48,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:48,640 INFO L82 PathProgramCache]: Analyzing trace with hash 213776304, now seen corresponding path program 1 times [2019-09-20 13:27:48,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:48,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:48,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:48,734 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-20 13:27:48,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:48,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:48,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:48,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:48,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:48,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:48,736 INFO L87 Difference]: Start difference. First operand 807 states and 1172 transitions. Second operand 4 states. [2019-09-20 13:27:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,087 INFO L93 Difference]: Finished difference Result 902 states and 1309 transitions. [2019-09-20 13:27:49,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:49,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2019-09-20 13:27:49,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,093 INFO L225 Difference]: With dead ends: 902 [2019-09-20 13:27:49,093 INFO L226 Difference]: Without dead ends: 902 [2019-09-20 13:27:49,094 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2019-09-20 13:27:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 807. [2019-09-20 13:27:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-09-20 13:27:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1169 transitions. [2019-09-20 13:27:49,106 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1169 transitions. Word has length 205 [2019-09-20 13:27:49,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:49,106 INFO L475 AbstractCegarLoop]: Abstraction has 807 states and 1169 transitions. [2019-09-20 13:27:49,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1169 transitions. [2019-09-20 13:27:49,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-20 13:27:49,109 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:49,109 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:49,109 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:49,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:49,109 INFO L82 PathProgramCache]: Analyzing trace with hash 136522315, now seen corresponding path program 1 times [2019-09-20 13:27:49,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:49,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:49,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-20 13:27:49,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:49,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:49,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:49,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:49,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:49,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,204 INFO L87 Difference]: Start difference. First operand 807 states and 1169 transitions. Second operand 4 states. [2019-09-20 13:27:49,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,536 INFO L93 Difference]: Finished difference Result 893 states and 1294 transitions. [2019-09-20 13:27:49,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:49,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2019-09-20 13:27:49,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,540 INFO L225 Difference]: With dead ends: 893 [2019-09-20 13:27:49,540 INFO L226 Difference]: Without dead ends: 893 [2019-09-20 13:27:49,540 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:49,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-09-20 13:27:49,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 810. [2019-09-20 13:27:49,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2019-09-20 13:27:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1172 transitions. [2019-09-20 13:27:49,549 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1172 transitions. Word has length 205 [2019-09-20 13:27:49,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:49,549 INFO L475 AbstractCegarLoop]: Abstraction has 810 states and 1172 transitions. [2019-09-20 13:27:49,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1172 transitions. [2019-09-20 13:27:49,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-20 13:27:49,551 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:49,551 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:49,551 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:49,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:49,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1480087122, now seen corresponding path program 1 times [2019-09-20 13:27:49,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:49,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:49,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-20 13:27:49,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:49,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:49,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:49,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:49,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:49,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,644 INFO L87 Difference]: Start difference. First operand 810 states and 1172 transitions. Second operand 4 states. [2019-09-20 13:27:50,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:50,000 INFO L93 Difference]: Finished difference Result 893 states and 1291 transitions. [2019-09-20 13:27:50,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:50,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2019-09-20 13:27:50,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:50,003 INFO L225 Difference]: With dead ends: 893 [2019-09-20 13:27:50,004 INFO L226 Difference]: Without dead ends: 893 [2019-09-20 13:27:50,004 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:50,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-09-20 13:27:50,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 813. [2019-09-20 13:27:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-09-20 13:27:50,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1175 transitions. [2019-09-20 13:27:50,012 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1175 transitions. Word has length 207 [2019-09-20 13:27:50,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:50,012 INFO L475 AbstractCegarLoop]: Abstraction has 813 states and 1175 transitions. [2019-09-20 13:27:50,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:50,012 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1175 transitions. [2019-09-20 13:27:50,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-20 13:27:50,014 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:50,014 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2019-09-20 13:27:50,014 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:50,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:50,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1180339750, now seen corresponding path program 1 times [2019-09-20 13:27:50,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:50,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:50,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-20 13:27:50,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:50,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:50,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:50,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:50,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:50,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:50,100 INFO L87 Difference]: Start difference. First operand 813 states and 1175 transitions. Second operand 4 states. [2019-09-20 13:27:50,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:50,435 INFO L93 Difference]: Finished difference Result 881 states and 1273 transitions. [2019-09-20 13:27:50,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:50,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-09-20 13:27:50,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:50,438 INFO L225 Difference]: With dead ends: 881 [2019-09-20 13:27:50,438 INFO L226 Difference]: Without dead ends: 881 [2019-09-20 13:27:50,439 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:50,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-09-20 13:27:50,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 816. [2019-09-20 13:27:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2019-09-20 13:27:50,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1178 transitions. [2019-09-20 13:27:50,448 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1178 transitions. Word has length 208 [2019-09-20 13:27:50,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:50,449 INFO L475 AbstractCegarLoop]: Abstraction has 816 states and 1178 transitions. [2019-09-20 13:27:50,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1178 transitions. [2019-09-20 13:27:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-20 13:27:50,451 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:50,451 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1] [2019-09-20 13:27:50,451 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:50,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:50,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1818139356, now seen corresponding path program 1 times [2019-09-20 13:27:50,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:50,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:50,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat