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.16.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:28:04,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:28:04,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:28:04,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:28:04,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:28:04,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:28:04,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:28:04,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:28:04,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:28:04,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:28:04,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:28:04,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:28:04,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:28:04,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:28:04,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:28:04,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:28:04,865 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:28:04,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:28:04,868 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:28:04,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:28:04,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:28:04,872 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:28:04,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:28:04,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:28:04,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:28:04,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:28:04,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:28:04,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:28:04,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:28:04,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:28:04,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:28:04,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:28:04,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:28:04,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:28:04,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:28:04,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:28:04,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:28:04,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:28:04,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:28:04,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:28:04,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:28:04,888 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:28:04,902 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:28:04,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:28:04,903 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:28:04,903 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:28:04,904 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:28:04,904 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:28:04,904 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:28:04,904 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:28:04,905 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:28:04,905 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:28:04,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:28:04,906 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:28:04,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:28:04,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:28:04,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:28:04,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:28:04,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:28:04,907 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:28:04,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:28:04,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:28:04,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:28:04,908 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:28:04,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:28:04,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:28:04,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:28:04,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:28:04,909 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:28:04,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:28:04,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:28:04,909 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:28:04,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:28:04,951 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:28:04,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:28:04,956 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:28:04,956 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:28:04,957 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.16.i.cil-2.c [2019-09-20 13:28:05,019 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/434059df6/a682afb27d05496497835ccb870805c5/FLAG5518380fc [2019-09-20 13:28:05,617 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:28:05,618 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.16.i.cil-2.c [2019-09-20 13:28:05,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/434059df6/a682afb27d05496497835ccb870805c5/FLAG5518380fc [2019-09-20 13:28:05,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/434059df6/a682afb27d05496497835ccb870805c5 [2019-09-20 13:28:05,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:28:05,879 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:28:05,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:28:05,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:28:05,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:28:05,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:28:05" (1/1) ... [2019-09-20 13:28:05,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a62140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:05, skipping insertion in model container [2019-09-20 13:28:05,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:28:05" (1/1) ... [2019-09-20 13:28:05,897 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:28:05,979 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:28:06,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:28:06,641 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:28:06,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:28:06,875 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:28:06,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:06 WrapperNode [2019-09-20 13:28:06,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:28:06,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:28:06,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:28:06,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:28:06,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:06" (1/1) ... [2019-09-20 13:28:06,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:06" (1/1) ... [2019-09-20 13:28:06,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:06" (1/1) ... [2019-09-20 13:28:06,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:06" (1/1) ... [2019-09-20 13:28:07,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:06" (1/1) ... [2019-09-20 13:28:07,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:06" (1/1) ... [2019-09-20 13:28:07,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:06" (1/1) ... [2019-09-20 13:28:07,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:28:07,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:28:07,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:28:07,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:28:07,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:06" (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:28:07,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:28:07,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:28:07,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:28:07,156 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:28:07,156 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:28:07,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:28:07,157 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:28:07,157 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:28:07,157 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:28:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:28:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:28:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:28:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:28:07,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:28:07,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:28:07,160 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:28:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:28:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:28:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:28:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:28:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:28:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:28:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:28:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:28:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:28:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:28:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:28:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:28:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:28:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:28:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:28:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:28:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:28:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:28:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:28:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:28:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:28:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:28:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:28:07,691 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:28:08,529 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:28:08,530 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:28:08,552 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:28:08,552 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:28:08,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:28:08 BoogieIcfgContainer [2019-09-20 13:28:08,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:28:08,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:28:08,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:28:08,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:28:08,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:28:05" (1/3) ... [2019-09-20 13:28:08,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1284c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:28:08, skipping insertion in model container [2019-09-20 13:28:08,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:06" (2/3) ... [2019-09-20 13:28:08,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1284c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:28:08, skipping insertion in model container [2019-09-20 13:28:08,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:28:08" (3/3) ... [2019-09-20 13:28:08,563 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16.i.cil-2.c [2019-09-20 13:28:08,573 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:28:08,586 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:28:08,603 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:28:08,637 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:28:08,637 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:28:08,637 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:28:08,638 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:28:08,638 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:28:08,638 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:28:08,638 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:28:08,638 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:28:08,669 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-09-20 13:28:08,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:28:08,685 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,686 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] [2019-09-20 13:28:08,688 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,694 INFO L82 PathProgramCache]: Analyzing trace with hash -779464605, now seen corresponding path program 1 times [2019-09-20 13:28:08,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,108 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:28:09,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,138 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 4 states. [2019-09-20 13:28:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,615 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2019-09-20 13:28:09,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-09-20 13:28:09,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,630 INFO L225 Difference]: With dead ends: 199 [2019-09-20 13:28:09,630 INFO L226 Difference]: Without dead ends: 178 [2019-09-20 13:28:09,632 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:09,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-20 13:28:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 161. [2019-09-20 13:28:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-20 13:28:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 250 transitions. [2019-09-20 13:28:09,686 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 250 transitions. Word has length 50 [2019-09-20 13:28:09,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,687 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 250 transitions. [2019-09-20 13:28:09,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 250 transitions. [2019-09-20 13:28:09,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:28:09,690 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,690 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] [2019-09-20 13:28:09,691 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,691 INFO L82 PathProgramCache]: Analyzing trace with hash 347342234, now seen corresponding path program 1 times [2019-09-20 13:28:09,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,882 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:28:09,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,889 INFO L87 Difference]: Start difference. First operand 161 states and 250 transitions. Second operand 4 states. [2019-09-20 13:28:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,293 INFO L93 Difference]: Finished difference Result 178 states and 270 transitions. [2019-09-20 13:28:10,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:28:10,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,296 INFO L225 Difference]: With dead ends: 178 [2019-09-20 13:28:10,297 INFO L226 Difference]: Without dead ends: 178 [2019-09-20 13:28:10,298 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-20 13:28:10,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 161. [2019-09-20 13:28:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-20 13:28:10,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 249 transitions. [2019-09-20 13:28:10,310 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 249 transitions. Word has length 63 [2019-09-20 13:28:10,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,310 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 249 transitions. [2019-09-20 13:28:10,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,311 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 249 transitions. [2019-09-20 13:28:10,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:28:10,313 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,314 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] [2019-09-20 13:28:10,314 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1036215606, now seen corresponding path program 1 times [2019-09-20 13:28:10,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,395 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:28:10,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,397 INFO L87 Difference]: Start difference. First operand 161 states and 249 transitions. Second operand 4 states. [2019-09-20 13:28:10,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,724 INFO L93 Difference]: Finished difference Result 177 states and 268 transitions. [2019-09-20 13:28:10,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:28:10,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,727 INFO L225 Difference]: With dead ends: 177 [2019-09-20 13:28:10,727 INFO L226 Difference]: Without dead ends: 177 [2019-09-20 13:28:10,727 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-20 13:28:10,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 161. [2019-09-20 13:28:10,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-20 13:28:10,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 248 transitions. [2019-09-20 13:28:10,738 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 248 transitions. Word has length 64 [2019-09-20 13:28:10,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,738 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 248 transitions. [2019-09-20 13:28:10,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,738 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 248 transitions. [2019-09-20 13:28:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:28:10,741 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,741 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] [2019-09-20 13:28:10,742 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,742 INFO L82 PathProgramCache]: Analyzing trace with hash -599319774, now seen corresponding path program 1 times [2019-09-20 13:28:10,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:10,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:28:10,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:28:10,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:28:10,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:10,860 INFO L87 Difference]: Start difference. First operand 161 states and 248 transitions. Second operand 5 states. [2019-09-20 13:28:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,376 INFO L93 Difference]: Finished difference Result 182 states and 276 transitions. [2019-09-20 13:28:11,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:28:11,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-20 13:28:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,380 INFO L225 Difference]: With dead ends: 182 [2019-09-20 13:28:11,380 INFO L226 Difference]: Without dead ends: 182 [2019-09-20 13:28:11,381 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:28:11,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-20 13:28:11,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-09-20 13:28:11,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-20 13:28:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 275 transitions. [2019-09-20 13:28:11,391 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 275 transitions. Word has length 64 [2019-09-20 13:28:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,392 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 275 transitions. [2019-09-20 13:28:11,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:28:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 275 transitions. [2019-09-20 13:28:11,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:28:11,394 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,394 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] [2019-09-20 13:28:11,395 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1700513898, now seen corresponding path program 1 times [2019-09-20 13:28:11,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:11,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,503 INFO L87 Difference]: Start difference. First operand 181 states and 275 transitions. Second operand 4 states. [2019-09-20 13:28:11,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,834 INFO L93 Difference]: Finished difference Result 196 states and 292 transitions. [2019-09-20 13:28:11,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:28:11,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,836 INFO L225 Difference]: With dead ends: 196 [2019-09-20 13:28:11,836 INFO L226 Difference]: Without dead ends: 196 [2019-09-20 13:28:11,837 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-20 13:28:11,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 181. [2019-09-20 13:28:11,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-20 13:28:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 274 transitions. [2019-09-20 13:28:11,845 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 274 transitions. Word has length 64 [2019-09-20 13:28:11,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,845 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 274 transitions. [2019-09-20 13:28:11,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,846 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 274 transitions. [2019-09-20 13:28:11,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:28:11,847 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,847 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] [2019-09-20 13:28:11,848 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,848 INFO L82 PathProgramCache]: Analyzing trace with hash -393846133, now seen corresponding path program 1 times [2019-09-20 13:28:11,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:11,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,968 INFO L87 Difference]: Start difference. First operand 181 states and 274 transitions. Second operand 4 states. [2019-09-20 13:28:12,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:12,285 INFO L93 Difference]: Finished difference Result 194 states and 289 transitions. [2019-09-20 13:28:12,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:12,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:28:12,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:12,288 INFO L225 Difference]: With dead ends: 194 [2019-09-20 13:28:12,288 INFO L226 Difference]: Without dead ends: 194 [2019-09-20 13:28:12,289 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:12,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-20 13:28:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2019-09-20 13:28:12,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-20 13:28:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 273 transitions. [2019-09-20 13:28:12,297 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 273 transitions. Word has length 64 [2019-09-20 13:28:12,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:12,297 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 273 transitions. [2019-09-20 13:28:12,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 273 transitions. [2019-09-20 13:28:12,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:28:12,299 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:12,299 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:28:12,299 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:12,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:12,300 INFO L82 PathProgramCache]: Analyzing trace with hash -242998339, now seen corresponding path program 1 times [2019-09-20 13:28:12,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:12,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:12,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:12,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:12,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:12,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:12,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:12,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:12,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:12,383 INFO L87 Difference]: Start difference. First operand 181 states and 273 transitions. Second operand 4 states. [2019-09-20 13:28:12,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:12,642 INFO L93 Difference]: Finished difference Result 194 states and 288 transitions. [2019-09-20 13:28:12,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:12,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:28:12,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:12,644 INFO L225 Difference]: With dead ends: 194 [2019-09-20 13:28:12,644 INFO L226 Difference]: Without dead ends: 194 [2019-09-20 13:28:12,644 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:12,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-20 13:28:12,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2019-09-20 13:28:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-20 13:28:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 272 transitions. [2019-09-20 13:28:12,650 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 272 transitions. Word has length 65 [2019-09-20 13:28:12,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:12,651 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 272 transitions. [2019-09-20 13:28:12,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:12,651 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 272 transitions. [2019-09-20 13:28:12,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:28:12,652 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:12,653 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] [2019-09-20 13:28:12,653 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:12,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:12,653 INFO L82 PathProgramCache]: Analyzing trace with hash 157388590, now seen corresponding path program 1 times [2019-09-20 13:28:12,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:12,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:12,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:12,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:12,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:12,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:12,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:12,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:12,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:12,736 INFO L87 Difference]: Start difference. First operand 181 states and 272 transitions. Second operand 4 states. [2019-09-20 13:28:13,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,009 INFO L93 Difference]: Finished difference Result 194 states and 287 transitions. [2019-09-20 13:28:13,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:13,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:28:13,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,012 INFO L225 Difference]: With dead ends: 194 [2019-09-20 13:28:13,012 INFO L226 Difference]: Without dead ends: 194 [2019-09-20 13:28:13,013 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-20 13:28:13,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2019-09-20 13:28:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-20 13:28:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 271 transitions. [2019-09-20 13:28:13,020 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 271 transitions. Word has length 66 [2019-09-20 13:28:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,020 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 271 transitions. [2019-09-20 13:28:13,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 271 transitions. [2019-09-20 13:28:13,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:28:13,021 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,022 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] [2019-09-20 13:28:13,022 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,022 INFO L82 PathProgramCache]: Analyzing trace with hash -354315294, now seen corresponding path program 1 times [2019-09-20 13:28:13,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:13,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:13,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:13,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:13,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:13,084 INFO L87 Difference]: Start difference. First operand 181 states and 271 transitions. Second operand 4 states. [2019-09-20 13:28:13,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,365 INFO L93 Difference]: Finished difference Result 194 states and 286 transitions. [2019-09-20 13:28:13,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:13,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-20 13:28:13,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,368 INFO L225 Difference]: With dead ends: 194 [2019-09-20 13:28:13,368 INFO L226 Difference]: Without dead ends: 194 [2019-09-20 13:28:13,368 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:13,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-20 13:28:13,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2019-09-20 13:28:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-20 13:28:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 270 transitions. [2019-09-20 13:28:13,373 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 270 transitions. Word has length 67 [2019-09-20 13:28:13,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,374 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 270 transitions. [2019-09-20 13:28:13,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:13,374 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 270 transitions. [2019-09-20 13:28:13,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:28:13,375 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,375 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] [2019-09-20 13:28:13,376 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1474578787, now seen corresponding path program 1 times [2019-09-20 13:28:13,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:13,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:13,436 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:13,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:13,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:13,438 INFO L87 Difference]: Start difference. First operand 181 states and 270 transitions. Second operand 4 states. [2019-09-20 13:28:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,726 INFO L93 Difference]: Finished difference Result 223 states and 332 transitions. [2019-09-20 13:28:13,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:13,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-20 13:28:13,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,728 INFO L225 Difference]: With dead ends: 223 [2019-09-20 13:28:13,728 INFO L226 Difference]: Without dead ends: 223 [2019-09-20 13:28:13,728 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:13,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-20 13:28:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 203. [2019-09-20 13:28:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-20 13:28:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 307 transitions. [2019-09-20 13:28:13,743 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 307 transitions. Word has length 67 [2019-09-20 13:28:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,743 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 307 transitions. [2019-09-20 13:28:13,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:13,744 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 307 transitions. [2019-09-20 13:28:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-20 13:28:13,745 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,745 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] [2019-09-20 13:28:13,745 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,745 INFO L82 PathProgramCache]: Analyzing trace with hash 923936691, now seen corresponding path program 1 times [2019-09-20 13:28:13,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:13,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:13,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:13,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:13,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:13,806 INFO L87 Difference]: Start difference. First operand 203 states and 307 transitions. Second operand 4 states. [2019-09-20 13:28:14,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,052 INFO L93 Difference]: Finished difference Result 206 states and 310 transitions. [2019-09-20 13:28:14,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:14,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-20 13:28:14,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,055 INFO L225 Difference]: With dead ends: 206 [2019-09-20 13:28:14,056 INFO L226 Difference]: Without dead ends: 206 [2019-09-20 13:28:14,056 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:14,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-20 13:28:14,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2019-09-20 13:28:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-20 13:28:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 306 transitions. [2019-09-20 13:28:14,069 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 306 transitions. Word has length 68 [2019-09-20 13:28:14,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,070 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 306 transitions. [2019-09-20 13:28:14,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:14,073 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 306 transitions. [2019-09-20 13:28:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:28:14,074 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,074 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] [2019-09-20 13:28:14,075 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,075 INFO L82 PathProgramCache]: Analyzing trace with hash 538356890, now seen corresponding path program 1 times [2019-09-20 13:28:14,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:14,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,162 INFO L87 Difference]: Start difference. First operand 203 states and 306 transitions. Second operand 4 states. [2019-09-20 13:28:14,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,486 INFO L93 Difference]: Finished difference Result 223 states and 330 transitions. [2019-09-20 13:28:14,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:14,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:28:14,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,489 INFO L225 Difference]: With dead ends: 223 [2019-09-20 13:28:14,489 INFO L226 Difference]: Without dead ends: 223 [2019-09-20 13:28:14,489 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-20 13:28:14,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 203. [2019-09-20 13:28:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-20 13:28:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 305 transitions. [2019-09-20 13:28:14,495 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 305 transitions. Word has length 80 [2019-09-20 13:28:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,495 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 305 transitions. [2019-09-20 13:28:14,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 305 transitions. [2019-09-20 13:28:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:28:14,497 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,497 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] [2019-09-20 13:28:14,497 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,498 INFO L82 PathProgramCache]: Analyzing trace with hash -967966358, now seen corresponding path program 1 times [2019-09-20 13:28:14,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:14,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,563 INFO L87 Difference]: Start difference. First operand 203 states and 305 transitions. Second operand 4 states. [2019-09-20 13:28:14,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,854 INFO L93 Difference]: Finished difference Result 222 states and 328 transitions. [2019-09-20 13:28:14,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:14,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:28:14,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,857 INFO L225 Difference]: With dead ends: 222 [2019-09-20 13:28:14,857 INFO L226 Difference]: Without dead ends: 222 [2019-09-20 13:28:14,858 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-20 13:28:14,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 203. [2019-09-20 13:28:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-20 13:28:14,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 304 transitions. [2019-09-20 13:28:14,864 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 304 transitions. Word has length 81 [2019-09-20 13:28:14,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,865 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 304 transitions. [2019-09-20 13:28:14,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:14,865 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 304 transitions. [2019-09-20 13:28:14,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:28:14,866 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,866 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] [2019-09-20 13:28:14,867 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1232640907, now seen corresponding path program 1 times [2019-09-20 13:28:14,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:14,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,922 INFO L87 Difference]: Start difference. First operand 203 states and 304 transitions. Second operand 4 states. [2019-09-20 13:28:15,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:15,208 INFO L93 Difference]: Finished difference Result 220 states and 325 transitions. [2019-09-20 13:28:15,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:15,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:28:15,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:15,211 INFO L225 Difference]: With dead ends: 220 [2019-09-20 13:28:15,211 INFO L226 Difference]: Without dead ends: 220 [2019-09-20 13:28:15,211 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-20 13:28:15,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 203. [2019-09-20 13:28:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-20 13:28:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 303 transitions. [2019-09-20 13:28:15,218 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 303 transitions. Word has length 81 [2019-09-20 13:28:15,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:15,218 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 303 transitions. [2019-09-20 13:28:15,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 303 transitions. [2019-09-20 13:28:15,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:28:15,220 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:15,220 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] [2019-09-20 13:28:15,221 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:15,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:15,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1361507651, now seen corresponding path program 1 times [2019-09-20 13:28:15,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:15,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:15,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:15,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:15,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:15,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:15,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:15,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:15,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,288 INFO L87 Difference]: Start difference. First operand 203 states and 303 transitions. Second operand 4 states. [2019-09-20 13:28:15,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:15,556 INFO L93 Difference]: Finished difference Result 220 states and 324 transitions. [2019-09-20 13:28:15,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:15,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:28:15,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:15,559 INFO L225 Difference]: With dead ends: 220 [2019-09-20 13:28:15,559 INFO L226 Difference]: Without dead ends: 220 [2019-09-20 13:28:15,559 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-20 13:28:15,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 203. [2019-09-20 13:28:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-20 13:28:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 302 transitions. [2019-09-20 13:28:15,565 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 302 transitions. Word has length 82 [2019-09-20 13:28:15,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:15,565 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 302 transitions. [2019-09-20 13:28:15,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:15,566 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 302 transitions. [2019-09-20 13:28:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:28:15,567 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:15,567 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] [2019-09-20 13:28:15,567 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:15,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:15,568 INFO L82 PathProgramCache]: Analyzing trace with hash -156661714, now seen corresponding path program 1 times [2019-09-20 13:28:15,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:15,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:15,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:15,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:15,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:15,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:15,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:15,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:15,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,637 INFO L87 Difference]: Start difference. First operand 203 states and 302 transitions. Second operand 4 states. [2019-09-20 13:28:16,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,028 INFO L93 Difference]: Finished difference Result 220 states and 323 transitions. [2019-09-20 13:28:16,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-20 13:28:16,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,031 INFO L225 Difference]: With dead ends: 220 [2019-09-20 13:28:16,031 INFO L226 Difference]: Without dead ends: 220 [2019-09-20 13:28:16,032 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-20 13:28:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 203. [2019-09-20 13:28:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-20 13:28:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 301 transitions. [2019-09-20 13:28:16,041 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 301 transitions. Word has length 83 [2019-09-20 13:28:16,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,041 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 301 transitions. [2019-09-20 13:28:16,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 301 transitions. [2019-09-20 13:28:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-20 13:28:16,044 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,045 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] [2019-09-20 13:28:16,045 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1499940126, now seen corresponding path program 1 times [2019-09-20 13:28:16,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:16,136 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:16,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:16,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:16,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:16,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:16,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:16,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,138 INFO L87 Difference]: Start difference. First operand 203 states and 301 transitions. Second operand 4 states. [2019-09-20 13:28:16,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,447 INFO L93 Difference]: Finished difference Result 220 states and 322 transitions. [2019-09-20 13:28:16,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-20 13:28:16,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,449 INFO L225 Difference]: With dead ends: 220 [2019-09-20 13:28:16,449 INFO L226 Difference]: Without dead ends: 220 [2019-09-20 13:28:16,450 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:16,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-20 13:28:16,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 203. [2019-09-20 13:28:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-20 13:28:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 300 transitions. [2019-09-20 13:28:16,456 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 300 transitions. Word has length 84 [2019-09-20 13:28:16,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,457 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 300 transitions. [2019-09-20 13:28:16,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 300 transitions. [2019-09-20 13:28:16,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-20 13:28:16,458 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,458 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] [2019-09-20 13:28:16,459 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,459 INFO L82 PathProgramCache]: Analyzing trace with hash -230694733, now seen corresponding path program 1 times [2019-09-20 13:28:16,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:16,538 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:16,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:16,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:16,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:16,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:16,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:16,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,540 INFO L87 Difference]: Start difference. First operand 203 states and 300 transitions. Second operand 4 states. [2019-09-20 13:28:16,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,926 INFO L93 Difference]: Finished difference Result 210 states and 309 transitions. [2019-09-20 13:28:16,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-20 13:28:16,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,928 INFO L225 Difference]: With dead ends: 210 [2019-09-20 13:28:16,929 INFO L226 Difference]: Without dead ends: 210 [2019-09-20 13:28:16,929 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-20 13:28:16,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 203. [2019-09-20 13:28:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-20 13:28:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 299 transitions. [2019-09-20 13:28:16,935 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 299 transitions. Word has length 85 [2019-09-20 13:28:16,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,935 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 299 transitions. [2019-09-20 13:28:16,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 299 transitions. [2019-09-20 13:28:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-20 13:28:16,937 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,937 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] [2019-09-20 13:28:16,937 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,938 INFO L82 PathProgramCache]: Analyzing trace with hash -851043621, now seen corresponding path program 1 times [2019-09-20 13:28:16,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:17,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:17,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:17,022 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:17,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:17,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:17,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,023 INFO L87 Difference]: Start difference. First operand 203 states and 299 transitions. Second operand 4 states. [2019-09-20 13:28:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:17,454 INFO L93 Difference]: Finished difference Result 316 states and 474 transitions. [2019-09-20 13:28:17,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:17,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-20 13:28:17,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:17,457 INFO L225 Difference]: With dead ends: 316 [2019-09-20 13:28:17,457 INFO L226 Difference]: Without dead ends: 316 [2019-09-20 13:28:17,458 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:17,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-20 13:28:17,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 244. [2019-09-20 13:28:17,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-09-20 13:28:17,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 372 transitions. [2019-09-20 13:28:17,464 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 372 transitions. Word has length 89 [2019-09-20 13:28:17,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:17,465 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 372 transitions. [2019-09-20 13:28:17,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:17,465 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 372 transitions. [2019-09-20 13:28:17,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-20 13:28:17,466 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:17,467 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] [2019-09-20 13:28:17,467 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:17,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:17,467 INFO L82 PathProgramCache]: Analyzing trace with hash -602897127, now seen corresponding path program 1 times [2019-09-20 13:28:17,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:17,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:17,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:17,544 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:17,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:17,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:17,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:17,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:17,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:17,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,546 INFO L87 Difference]: Start difference. First operand 244 states and 372 transitions. Second operand 4 states. [2019-09-20 13:28:18,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,011 INFO L93 Difference]: Finished difference Result 293 states and 445 transitions. [2019-09-20 13:28:18,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:18,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-20 13:28:18,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:18,015 INFO L225 Difference]: With dead ends: 293 [2019-09-20 13:28:18,015 INFO L226 Difference]: Without dead ends: 293 [2019-09-20 13:28:18,016 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:18,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-20 13:28:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 268. [2019-09-20 13:28:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-20 13:28:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 413 transitions. [2019-09-20 13:28:18,029 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 413 transitions. Word has length 89 [2019-09-20 13:28:18,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:18,030 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 413 transitions. [2019-09-20 13:28:18,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:18,030 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 413 transitions. [2019-09-20 13:28:18,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-20 13:28:18,032 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:18,032 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:28:18,032 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:18,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:18,033 INFO L82 PathProgramCache]: Analyzing trace with hash 416809407, now seen corresponding path program 1 times [2019-09-20 13:28:18,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:18,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:18,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:18,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:18,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:18,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:18,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,177 INFO L87 Difference]: Start difference. First operand 268 states and 413 transitions. Second operand 4 states. [2019-09-20 13:28:18,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,648 INFO L93 Difference]: Finished difference Result 331 states and 501 transitions. [2019-09-20 13:28:18,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:18,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-20 13:28:18,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:18,650 INFO L225 Difference]: With dead ends: 331 [2019-09-20 13:28:18,651 INFO L226 Difference]: Without dead ends: 331 [2019-09-20 13:28:18,651 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:18,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-20 13:28:18,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 269. [2019-09-20 13:28:18,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-20 13:28:18,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 414 transitions. [2019-09-20 13:28:18,659 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 414 transitions. Word has length 90 [2019-09-20 13:28:18,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:18,660 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 414 transitions. [2019-09-20 13:28:18,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:18,660 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 414 transitions. [2019-09-20 13:28:18,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:18,661 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:18,662 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] [2019-09-20 13:28:18,662 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:18,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:18,663 INFO L82 PathProgramCache]: Analyzing trace with hash 568786466, now seen corresponding path program 1 times [2019-09-20 13:28:18,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:18,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:18,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:18,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:18,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:18,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:18,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,743 INFO L87 Difference]: Start difference. First operand 269 states and 414 transitions. Second operand 4 states. [2019-09-20 13:28:19,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,215 INFO L93 Difference]: Finished difference Result 331 states and 500 transitions. [2019-09-20 13:28:19,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:19,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:19,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,220 INFO L225 Difference]: With dead ends: 331 [2019-09-20 13:28:19,222 INFO L226 Difference]: Without dead ends: 331 [2019-09-20 13:28:19,222 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-20 13:28:19,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 269. [2019-09-20 13:28:19,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-20 13:28:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 413 transitions. [2019-09-20 13:28:19,229 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 413 transitions. Word has length 102 [2019-09-20 13:28:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,230 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 413 transitions. [2019-09-20 13:28:19,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 413 transitions. [2019-09-20 13:28:19,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:19,231 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,232 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] [2019-09-20 13:28:19,232 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1955571876, now seen corresponding path program 1 times [2019-09-20 13:28:19,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:19,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:19,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:19,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:19,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:19,317 INFO L87 Difference]: Start difference. First operand 269 states and 413 transitions. Second operand 4 states. [2019-09-20 13:28:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,641 INFO L93 Difference]: Finished difference Result 294 states and 444 transitions. [2019-09-20 13:28:19,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:19,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:19,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,644 INFO L225 Difference]: With dead ends: 294 [2019-09-20 13:28:19,644 INFO L226 Difference]: Without dead ends: 294 [2019-09-20 13:28:19,644 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:19,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-20 13:28:19,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 269. [2019-09-20 13:28:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-20 13:28:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 412 transitions. [2019-09-20 13:28:19,651 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 412 transitions. Word has length 102 [2019-09-20 13:28:19,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,652 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 412 transitions. [2019-09-20 13:28:19,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 412 transitions. [2019-09-20 13:28:19,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:19,654 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,654 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] [2019-09-20 13:28:19,654 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,655 INFO L82 PathProgramCache]: Analyzing trace with hash -24649502, now seen corresponding path program 1 times [2019-09-20 13:28:19,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:19,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:19,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:19,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:19,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:19,770 INFO L87 Difference]: Start difference. First operand 269 states and 412 transitions. Second operand 4 states. [2019-09-20 13:28:20,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:20,294 INFO L93 Difference]: Finished difference Result 330 states and 497 transitions. [2019-09-20 13:28:20,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:20,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:20,296 INFO L225 Difference]: With dead ends: 330 [2019-09-20 13:28:20,297 INFO L226 Difference]: Without dead ends: 330 [2019-09-20 13:28:20,297 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:20,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-20 13:28:20,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 269. [2019-09-20 13:28:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-20 13:28:20,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 411 transitions. [2019-09-20 13:28:20,304 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 411 transitions. Word has length 103 [2019-09-20 13:28:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:20,305 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 411 transitions. [2019-09-20 13:28:20,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 411 transitions. [2019-09-20 13:28:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:20,306 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:20,306 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] [2019-09-20 13:28:20,307 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:20,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:20,307 INFO L82 PathProgramCache]: Analyzing trace with hash -2119009533, now seen corresponding path program 1 times [2019-09-20 13:28:20,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:20,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:20,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:20,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:20,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:20,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:20,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:20,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:20,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:20,370 INFO L87 Difference]: Start difference. First operand 269 states and 411 transitions. Second operand 4 states. [2019-09-20 13:28:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:20,764 INFO L93 Difference]: Finished difference Result 328 states and 494 transitions. [2019-09-20 13:28:20,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:20,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:20,767 INFO L225 Difference]: With dead ends: 328 [2019-09-20 13:28:20,767 INFO L226 Difference]: Without dead ends: 328 [2019-09-20 13:28:20,767 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:20,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-20 13:28:20,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 269. [2019-09-20 13:28:20,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-20 13:28:20,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 410 transitions. [2019-09-20 13:28:20,775 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 410 transitions. Word has length 103 [2019-09-20 13:28:20,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:20,775 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 410 transitions. [2019-09-20 13:28:20,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:20,776 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 410 transitions. [2019-09-20 13:28:20,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:20,777 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:20,777 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] [2019-09-20 13:28:20,778 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:20,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:20,778 INFO L82 PathProgramCache]: Analyzing trace with hash 16025248, now seen corresponding path program 1 times [2019-09-20 13:28:20,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:20,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:20,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:20,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:20,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:20,845 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:20,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:20,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:20,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:20,846 INFO L87 Difference]: Start difference. First operand 269 states and 410 transitions. Second operand 4 states. [2019-09-20 13:28:21,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:21,165 INFO L93 Difference]: Finished difference Result 293 states and 440 transitions. [2019-09-20 13:28:21,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:21,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:21,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:21,167 INFO L225 Difference]: With dead ends: 293 [2019-09-20 13:28:21,168 INFO L226 Difference]: Without dead ends: 293 [2019-09-20 13:28:21,168 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:21,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-20 13:28:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 269. [2019-09-20 13:28:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-20 13:28:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 409 transitions. [2019-09-20 13:28:21,175 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 409 transitions. Word has length 103 [2019-09-20 13:28:21,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:21,175 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 409 transitions. [2019-09-20 13:28:21,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 409 transitions. [2019-09-20 13:28:21,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:21,177 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:21,177 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] [2019-09-20 13:28:21,177 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:21,178 INFO L82 PathProgramCache]: Analyzing trace with hash -2078334783, now seen corresponding path program 1 times [2019-09-20 13:28:21,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:21,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:21,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:21,255 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:21,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:21,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:21,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:21,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:21,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:21,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:21,256 INFO L87 Difference]: Start difference. First operand 269 states and 409 transitions. Second operand 4 states. [2019-09-20 13:28:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:21,526 INFO L93 Difference]: Finished difference Result 291 states and 437 transitions. [2019-09-20 13:28:21,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:21,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:21,529 INFO L225 Difference]: With dead ends: 291 [2019-09-20 13:28:21,529 INFO L226 Difference]: Without dead ends: 291 [2019-09-20 13:28:21,530 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:21,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-20 13:28:21,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 269. [2019-09-20 13:28:21,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-20 13:28:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 408 transitions. [2019-09-20 13:28:21,537 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 408 transitions. Word has length 103 [2019-09-20 13:28:21,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:21,537 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 408 transitions. [2019-09-20 13:28:21,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:21,537 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 408 transitions. [2019-09-20 13:28:21,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:28:21,538 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:21,539 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] [2019-09-20 13:28:21,539 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:21,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:21,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2111511109, now seen corresponding path program 1 times [2019-09-20 13:28:21,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:21,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:21,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:21,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:21,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:21,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:21,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:21,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:21,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:21,607 INFO L87 Difference]: Start difference. First operand 269 states and 408 transitions. Second operand 4 states. [2019-09-20 13:28:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:22,026 INFO L93 Difference]: Finished difference Result 328 states and 491 transitions. [2019-09-20 13:28:22,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:22,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:28:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:22,030 INFO L225 Difference]: With dead ends: 328 [2019-09-20 13:28:22,031 INFO L226 Difference]: Without dead ends: 328 [2019-09-20 13:28:22,031 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:22,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-20 13:28:22,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 269. [2019-09-20 13:28:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-20 13:28:22,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 407 transitions. [2019-09-20 13:28:22,038 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 407 transitions. Word has length 104 [2019-09-20 13:28:22,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:22,038 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 407 transitions. [2019-09-20 13:28:22,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 407 transitions. [2019-09-20 13:28:22,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:28:22,039 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:22,040 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:22,040 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:22,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:22,040 INFO L82 PathProgramCache]: Analyzing trace with hash -922538937, now seen corresponding path program 1 times [2019-09-20 13:28:22,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:22,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:22,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:22,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:22,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:22,096 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:22,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:22,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:22,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:22,098 INFO L87 Difference]: Start difference. First operand 269 states and 407 transitions. Second operand 4 states. [2019-09-20 13:28:22,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:22,446 INFO L93 Difference]: Finished difference Result 291 states and 435 transitions. [2019-09-20 13:28:22,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:22,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:28:22,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:22,449 INFO L225 Difference]: With dead ends: 291 [2019-09-20 13:28:22,449 INFO L226 Difference]: Without dead ends: 291 [2019-09-20 13:28:22,450 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-20 13:28:22,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 269. [2019-09-20 13:28:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-20 13:28:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 406 transitions. [2019-09-20 13:28:22,456 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 406 transitions. Word has length 104 [2019-09-20 13:28:22,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:22,457 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 406 transitions. [2019-09-20 13:28:22,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:22,457 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 406 transitions. [2019-09-20 13:28:22,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:28:22,458 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:22,458 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] [2019-09-20 13:28:22,458 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:22,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:22,459 INFO L82 PathProgramCache]: Analyzing trace with hash 132737446, now seen corresponding path program 1 times [2019-09-20 13:28:22,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:22,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:22,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:22,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:22,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:22,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:22,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:22,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:22,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:22,530 INFO L87 Difference]: Start difference. First operand 269 states and 406 transitions. Second operand 4 states. [2019-09-20 13:28:22,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:22,931 INFO L93 Difference]: Finished difference Result 328 states and 489 transitions. [2019-09-20 13:28:22,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:22,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:28:22,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:22,933 INFO L225 Difference]: With dead ends: 328 [2019-09-20 13:28:22,934 INFO L226 Difference]: Without dead ends: 328 [2019-09-20 13:28:22,934 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:22,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-20 13:28:22,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 269. [2019-09-20 13:28:22,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-20 13:28:22,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 405 transitions. [2019-09-20 13:28:22,942 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 405 transitions. Word has length 105 [2019-09-20 13:28:22,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:22,942 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 405 transitions. [2019-09-20 13:28:22,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:22,942 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 405 transitions. [2019-09-20 13:28:22,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:28:22,943 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:22,943 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] [2019-09-20 13:28:22,944 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:22,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:22,944 INFO L82 PathProgramCache]: Analyzing trace with hash 566466532, now seen corresponding path program 1 times [2019-09-20 13:28:22,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:22,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:22,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:23,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:23,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:23,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:23,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:23,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:23,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:23,008 INFO L87 Difference]: Start difference. First operand 269 states and 405 transitions. Second operand 4 states. [2019-09-20 13:28:23,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:23,279 INFO L93 Difference]: Finished difference Result 291 states and 433 transitions. [2019-09-20 13:28:23,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:23,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:28:23,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:23,284 INFO L225 Difference]: With dead ends: 291 [2019-09-20 13:28:23,284 INFO L226 Difference]: Without dead ends: 291 [2019-09-20 13:28:23,285 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:23,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-20 13:28:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 269. [2019-09-20 13:28:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-20 13:28:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 404 transitions. [2019-09-20 13:28:23,291 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 404 transitions. Word has length 105 [2019-09-20 13:28:23,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:23,291 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 404 transitions. [2019-09-20 13:28:23,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 404 transitions. [2019-09-20 13:28:23,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:28:23,292 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:23,293 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] [2019-09-20 13:28:23,293 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:23,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:23,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1118500758, now seen corresponding path program 1 times [2019-09-20 13:28:23,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:23,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:23,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:23,364 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:23,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:23,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:23,365 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:23,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:23,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:23,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:23,366 INFO L87 Difference]: Start difference. First operand 269 states and 404 transitions. Second operand 4 states. [2019-09-20 13:28:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:23,754 INFO L93 Difference]: Finished difference Result 328 states and 487 transitions. [2019-09-20 13:28:23,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:23,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:28:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:23,758 INFO L225 Difference]: With dead ends: 328 [2019-09-20 13:28:23,758 INFO L226 Difference]: Without dead ends: 328 [2019-09-20 13:28:23,759 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:23,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-20 13:28:23,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 269. [2019-09-20 13:28:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-20 13:28:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 403 transitions. [2019-09-20 13:28:23,766 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 403 transitions. Word has length 106 [2019-09-20 13:28:23,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:23,766 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 403 transitions. [2019-09-20 13:28:23,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 403 transitions. [2019-09-20 13:28:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:28:23,767 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:23,768 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:23,768 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:23,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:23,768 INFO L82 PathProgramCache]: Analyzing trace with hash -557800980, now seen corresponding path program 1 times [2019-09-20 13:28:23,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:23,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:23,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:23,837 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:23,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:23,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:23,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:23,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:23,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:23,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:23,838 INFO L87 Difference]: Start difference. First operand 269 states and 403 transitions. Second operand 4 states. [2019-09-20 13:28:24,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:24,170 INFO L93 Difference]: Finished difference Result 291 states and 431 transitions. [2019-09-20 13:28:24,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:24,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:28:24,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:24,173 INFO L225 Difference]: With dead ends: 291 [2019-09-20 13:28:24,173 INFO L226 Difference]: Without dead ends: 291 [2019-09-20 13:28:24,173 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:24,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-20 13:28:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 269. [2019-09-20 13:28:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-20 13:28:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 402 transitions. [2019-09-20 13:28:24,181 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 402 transitions. Word has length 106 [2019-09-20 13:28:24,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:24,181 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 402 transitions. [2019-09-20 13:28:24,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 402 transitions. [2019-09-20 13:28:24,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-20 13:28:24,183 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:24,183 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] [2019-09-20 13:28:24,183 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:24,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:24,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1290976213, now seen corresponding path program 1 times [2019-09-20 13:28:24,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:24,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:24,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:24,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:24,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:24,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:24,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:24,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:24,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:24,249 INFO L87 Difference]: Start difference. First operand 269 states and 402 transitions. Second operand 4 states. [2019-09-20 13:28:24,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:24,606 INFO L93 Difference]: Finished difference Result 318 states and 473 transitions. [2019-09-20 13:28:24,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:24,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-20 13:28:24,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:24,609 INFO L225 Difference]: With dead ends: 318 [2019-09-20 13:28:24,609 INFO L226 Difference]: Without dead ends: 318 [2019-09-20 13:28:24,610 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:24,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-20 13:28:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 269. [2019-09-20 13:28:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-20 13:28:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 401 transitions. [2019-09-20 13:28:24,618 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 401 transitions. Word has length 107 [2019-09-20 13:28:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:24,619 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 401 transitions. [2019-09-20 13:28:24,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 401 transitions. [2019-09-20 13:28:24,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-20 13:28:24,620 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:24,620 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] [2019-09-20 13:28:24,620 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:24,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:24,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1089152279, now seen corresponding path program 1 times [2019-09-20 13:28:24,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:24,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:24,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:24,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:24,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:24,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:24,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:24,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:24,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:24,692 INFO L87 Difference]: Start difference. First operand 269 states and 401 transitions. Second operand 4 states. [2019-09-20 13:28:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:24,959 INFO L93 Difference]: Finished difference Result 281 states and 417 transitions. [2019-09-20 13:28:24,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:24,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-20 13:28:24,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:24,961 INFO L225 Difference]: With dead ends: 281 [2019-09-20 13:28:24,961 INFO L226 Difference]: Without dead ends: 281 [2019-09-20 13:28:24,962 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:24,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-20 13:28:24,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 269. [2019-09-20 13:28:24,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-20 13:28:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 400 transitions. [2019-09-20 13:28:24,968 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 400 transitions. Word has length 107 [2019-09-20 13:28:24,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:24,968 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 400 transitions. [2019-09-20 13:28:24,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:24,969 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 400 transitions. [2019-09-20 13:28:24,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-20 13:28:24,970 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:24,970 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:24,970 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:24,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:24,971 INFO L82 PathProgramCache]: Analyzing trace with hash 406195013, now seen corresponding path program 1 times [2019-09-20 13:28:24,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:24,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:24,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,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:28:25,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:25,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:25,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:25,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:25,051 INFO L87 Difference]: Start difference. First operand 269 states and 400 transitions. Second operand 4 states. [2019-09-20 13:28:25,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:25,466 INFO L93 Difference]: Finished difference Result 318 states and 471 transitions. [2019-09-20 13:28:25,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:25,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-20 13:28:25,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:25,469 INFO L225 Difference]: With dead ends: 318 [2019-09-20 13:28:25,470 INFO L226 Difference]: Without dead ends: 318 [2019-09-20 13:28:25,470 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:25,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-20 13:28:25,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 269. [2019-09-20 13:28:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-20 13:28:25,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 399 transitions. [2019-09-20 13:28:25,478 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 399 transitions. Word has length 111 [2019-09-20 13:28:25,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:25,479 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 399 transitions. [2019-09-20 13:28:25,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:25,479 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 399 transitions. [2019-09-20 13:28:25,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-20 13:28:25,481 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:25,481 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:25,481 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:25,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:25,482 INFO L82 PathProgramCache]: Analyzing trace with hash 351802115, now seen corresponding path program 1 times [2019-09-20 13:28:25,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:25,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:25,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-20 13:28:25,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:25,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:25,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:25,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:25,579 INFO L87 Difference]: Start difference. First operand 269 states and 399 transitions. Second operand 3 states. [2019-09-20 13:28:25,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:25,678 INFO L93 Difference]: Finished difference Result 511 states and 753 transitions. [2019-09-20 13:28:25,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:25,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-20 13:28:25,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:25,681 INFO L225 Difference]: With dead ends: 511 [2019-09-20 13:28:25,681 INFO L226 Difference]: Without dead ends: 511 [2019-09-20 13:28:25,682 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-20 13:28:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2019-09-20 13:28:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-09-20 13:28:25,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 753 transitions. [2019-09-20 13:28:25,694 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 753 transitions. Word has length 111 [2019-09-20 13:28:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:25,696 INFO L475 AbstractCegarLoop]: Abstraction has 511 states and 753 transitions. [2019-09-20 13:28:25,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:25,697 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 753 transitions. [2019-09-20 13:28:25,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-20 13:28:25,698 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:25,699 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, 1] [2019-09-20 13:28:25,699 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:25,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:25,699 INFO L82 PathProgramCache]: Analyzing trace with hash -458839463, now seen corresponding path program 1 times [2019-09-20 13:28:25,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:25,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:25,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:25,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:25,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:25,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:25,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:25,763 INFO L87 Difference]: Start difference. First operand 511 states and 753 transitions. Second operand 3 states. [2019-09-20 13:28:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:25,849 INFO L93 Difference]: Finished difference Result 753 states and 1108 transitions. [2019-09-20 13:28:25,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:25,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-20 13:28:25,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:25,853 INFO L225 Difference]: With dead ends: 753 [2019-09-20 13:28:25,853 INFO L226 Difference]: Without dead ends: 753 [2019-09-20 13:28:25,853 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:25,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-09-20 13:28:25,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 753. [2019-09-20 13:28:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-09-20 13:28:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1108 transitions. [2019-09-20 13:28:25,866 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1108 transitions. Word has length 113 [2019-09-20 13:28:25,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:25,866 INFO L475 AbstractCegarLoop]: Abstraction has 753 states and 1108 transitions. [2019-09-20 13:28:25,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1108 transitions. [2019-09-20 13:28:25,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-20 13:28:25,869 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:25,869 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:25,869 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:25,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:25,869 INFO L82 PathProgramCache]: Analyzing trace with hash -89101365, now seen corresponding path program 1 times [2019-09-20 13:28:25,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:25,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:25,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:25,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:25,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:25,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:25,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:25,990 INFO L87 Difference]: Start difference. First operand 753 states and 1108 transitions. Second operand 4 states. [2019-09-20 13:28:26,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:26,347 INFO L93 Difference]: Finished difference Result 942 states and 1399 transitions. [2019-09-20 13:28:26,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:26,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-20 13:28:26,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:26,354 INFO L225 Difference]: With dead ends: 942 [2019-09-20 13:28:26,354 INFO L226 Difference]: Without dead ends: 942 [2019-09-20 13:28:26,354 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:26,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-20 13:28:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 837. [2019-09-20 13:28:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-20 13:28:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1255 transitions. [2019-09-20 13:28:26,369 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1255 transitions. Word has length 142 [2019-09-20 13:28:26,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:26,370 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1255 transitions. [2019-09-20 13:28:26,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1255 transitions. [2019-09-20 13:28:26,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-20 13:28:26,372 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:26,373 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:26,373 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:26,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:26,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1616137422, now seen corresponding path program 1 times [2019-09-20 13:28:26,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:26,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:26,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:26,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:26,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:26,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:26,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:26,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:26,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:26,455 INFO L87 Difference]: Start difference. First operand 837 states and 1255 transitions. Second operand 4 states. [2019-09-20 13:28:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:26,894 INFO L93 Difference]: Finished difference Result 942 states and 1396 transitions. [2019-09-20 13:28:26,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:26,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-20 13:28:26,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:26,901 INFO L225 Difference]: With dead ends: 942 [2019-09-20 13:28:26,901 INFO L226 Difference]: Without dead ends: 942 [2019-09-20 13:28:26,901 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-20 13:28:26,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 837. [2019-09-20 13:28:26,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-20 13:28:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1252 transitions. [2019-09-20 13:28:26,919 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1252 transitions. Word has length 155 [2019-09-20 13:28:26,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:26,920 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1252 transitions. [2019-09-20 13:28:26,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1252 transitions. [2019-09-20 13:28:26,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-20 13:28:26,922 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:26,922 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:26,922 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:26,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:26,923 INFO L82 PathProgramCache]: Analyzing trace with hash 962186706, now seen corresponding path program 1 times [2019-09-20 13:28:26,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:26,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:26,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:27,001 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:27,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:27,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:27,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:27,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:27,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:27,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:27,003 INFO L87 Difference]: Start difference. First operand 837 states and 1252 transitions. Second operand 4 states. [2019-09-20 13:28:27,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:27,353 INFO L93 Difference]: Finished difference Result 939 states and 1390 transitions. [2019-09-20 13:28:27,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:27,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-20 13:28:27,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:27,357 INFO L225 Difference]: With dead ends: 939 [2019-09-20 13:28:27,357 INFO L226 Difference]: Without dead ends: 939 [2019-09-20 13:28:27,357 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:27,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2019-09-20 13:28:27,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 837. [2019-09-20 13:28:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-20 13:28:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1249 transitions. [2019-09-20 13:28:27,376 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1249 transitions. Word has length 156 [2019-09-20 13:28:27,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:27,376 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1249 transitions. [2019-09-20 13:28:27,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:27,376 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1249 transitions. [2019-09-20 13:28:27,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-20 13:28:27,379 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:27,379 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:27,379 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:27,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:27,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1132173325, now seen corresponding path program 1 times [2019-09-20 13:28:27,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:27,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:27,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:27,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:27,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:27,458 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:27,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:27,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:27,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:27,459 INFO L87 Difference]: Start difference. First operand 837 states and 1249 transitions. Second operand 4 states. [2019-09-20 13:28:27,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:27,809 INFO L93 Difference]: Finished difference Result 933 states and 1381 transitions. [2019-09-20 13:28:27,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:27,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-20 13:28:27,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:27,813 INFO L225 Difference]: With dead ends: 933 [2019-09-20 13:28:27,813 INFO L226 Difference]: Without dead ends: 933 [2019-09-20 13:28:27,813 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:27,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-09-20 13:28:27,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 837. [2019-09-20 13:28:27,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-20 13:28:27,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1246 transitions. [2019-09-20 13:28:27,828 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1246 transitions. Word has length 156 [2019-09-20 13:28:27,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:27,829 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1246 transitions. [2019-09-20 13:28:27,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:27,829 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1246 transitions. [2019-09-20 13:28:27,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-20 13:28:27,831 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:27,832 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:27,832 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:27,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:27,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1656304811, now seen corresponding path program 1 times [2019-09-20 13:28:27,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:27,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:27,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:27,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:27,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:27,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:27,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:27,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:27,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:27,949 INFO L87 Difference]: Start difference. First operand 837 states and 1246 transitions. Second operand 4 states. [2019-09-20 13:28:28,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:28,290 INFO L93 Difference]: Finished difference Result 933 states and 1378 transitions. [2019-09-20 13:28:28,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:28,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-20 13:28:28,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:28,295 INFO L225 Difference]: With dead ends: 933 [2019-09-20 13:28:28,296 INFO L226 Difference]: Without dead ends: 933 [2019-09-20 13:28:28,296 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:28,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-09-20 13:28:28,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 837. [2019-09-20 13:28:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-20 13:28:28,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1243 transitions. [2019-09-20 13:28:28,313 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1243 transitions. Word has length 157 [2019-09-20 13:28:28,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:28,314 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1243 transitions. [2019-09-20 13:28:28,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:28,314 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1243 transitions. [2019-09-20 13:28:28,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-20 13:28:28,316 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:28,316 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:28,316 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:28,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:28,317 INFO L82 PathProgramCache]: Analyzing trace with hash -705439082, now seen corresponding path program 1 times [2019-09-20 13:28:28,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:28,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:28,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:28,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:28,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:28,405 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:28,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:28,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:28,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:28,406 INFO L87 Difference]: Start difference. First operand 837 states and 1243 transitions. Second operand 4 states. [2019-09-20 13:28:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:28,717 INFO L93 Difference]: Finished difference Result 933 states and 1375 transitions. [2019-09-20 13:28:28,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:28,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-20 13:28:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:28,721 INFO L225 Difference]: With dead ends: 933 [2019-09-20 13:28:28,721 INFO L226 Difference]: Without dead ends: 933 [2019-09-20 13:28:28,722 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:28,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-09-20 13:28:28,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 837. [2019-09-20 13:28:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-20 13:28:28,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1240 transitions. [2019-09-20 13:28:28,744 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1240 transitions. Word has length 158 [2019-09-20 13:28:28,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:28,745 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1240 transitions. [2019-09-20 13:28:28,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:28,745 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1240 transitions. [2019-09-20 13:28:28,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-20 13:28:28,748 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:28,748 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:28,748 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:28,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:28,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1332169350, now seen corresponding path program 1 times [2019-09-20 13:28:28,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:28,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:28,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:28,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:28,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:28,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:28,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:28,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:28,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:28,861 INFO L87 Difference]: Start difference. First operand 837 states and 1240 transitions. Second operand 4 states. [2019-09-20 13:28:29,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:29,195 INFO L93 Difference]: Finished difference Result 933 states and 1372 transitions. [2019-09-20 13:28:29,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:29,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-20 13:28:29,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:29,201 INFO L225 Difference]: With dead ends: 933 [2019-09-20 13:28:29,201 INFO L226 Difference]: Without dead ends: 933 [2019-09-20 13:28:29,201 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:29,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-09-20 13:28:29,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 837. [2019-09-20 13:28:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-20 13:28:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1237 transitions. [2019-09-20 13:28:29,217 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1237 transitions. Word has length 159 [2019-09-20 13:28:29,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:29,217 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1237 transitions. [2019-09-20 13:28:29,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1237 transitions. [2019-09-20 13:28:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-20 13:28:29,220 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:29,220 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:29,220 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:29,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:29,221 INFO L82 PathProgramCache]: Analyzing trace with hash 675232027, now seen corresponding path program 1 times [2019-09-20 13:28:29,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:29,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:29,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:29,311 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:29,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:29,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:29,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:29,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:29,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:29,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:29,314 INFO L87 Difference]: Start difference. First operand 837 states and 1237 transitions. Second operand 4 states. [2019-09-20 13:28:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:29,611 INFO L93 Difference]: Finished difference Result 903 states and 1333 transitions. [2019-09-20 13:28:29,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:29,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-20 13:28:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:29,617 INFO L225 Difference]: With dead ends: 903 [2019-09-20 13:28:29,617 INFO L226 Difference]: Without dead ends: 903 [2019-09-20 13:28:29,617 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:29,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-09-20 13:28:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 837. [2019-09-20 13:28:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-20 13:28:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1234 transitions. [2019-09-20 13:28:29,629 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1234 transitions. Word has length 160 [2019-09-20 13:28:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:29,630 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1234 transitions. [2019-09-20 13:28:29,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:29,630 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1234 transitions. [2019-09-20 13:28:29,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-20 13:28:29,632 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:29,632 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:29,632 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:29,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:29,633 INFO L82 PathProgramCache]: Analyzing trace with hash 142870581, now seen corresponding path program 1 times [2019-09-20 13:28:29,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:29,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:29,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:29,718 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:29,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:29,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:29,719 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:29,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:29,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:29,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:29,720 INFO L87 Difference]: Start difference. First operand 837 states and 1234 transitions. Second operand 4 states. [2019-09-20 13:28:30,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:30,085 INFO L93 Difference]: Finished difference Result 903 states and 1330 transitions. [2019-09-20 13:28:30,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:30,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-20 13:28:30,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:30,091 INFO L225 Difference]: With dead ends: 903 [2019-09-20 13:28:30,091 INFO L226 Difference]: Without dead ends: 903 [2019-09-20 13:28:30,092 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:30,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-09-20 13:28:30,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 837. [2019-09-20 13:28:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-20 13:28:30,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1231 transitions. [2019-09-20 13:28:30,105 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1231 transitions. Word has length 164 [2019-09-20 13:28:30,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:30,106 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1231 transitions. [2019-09-20 13:28:30,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:30,106 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1231 transitions. [2019-09-20 13:28:30,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-20 13:28:30,108 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:30,108 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:30,108 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:30,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:30,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1799652844, now seen corresponding path program 1 times [2019-09-20 13:28:30,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:30,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:30,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:30,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:30,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:30,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:30,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:30,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:30,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:30,193 INFO L87 Difference]: Start difference. First operand 837 states and 1231 transitions. Second operand 4 states. [2019-09-20 13:28:30,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:30,508 INFO L93 Difference]: Finished difference Result 888 states and 1306 transitions. [2019-09-20 13:28:30,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:30,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-20 13:28:30,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:30,513 INFO L225 Difference]: With dead ends: 888 [2019-09-20 13:28:30,514 INFO L226 Difference]: Without dead ends: 888 [2019-09-20 13:28:30,514 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-09-20 13:28:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 837. [2019-09-20 13:28:30,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-20 13:28:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1228 transitions. [2019-09-20 13:28:30,526 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1228 transitions. Word has length 165 [2019-09-20 13:28:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:30,526 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1228 transitions. [2019-09-20 13:28:30,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:30,526 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1228 transitions. [2019-09-20 13:28:30,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-20 13:28:30,528 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:30,529 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:30,529 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:30,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:30,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1234843957, now seen corresponding path program 1 times [2019-09-20 13:28:30,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:30,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:30,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:30,620 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-20 13:28:30,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:30,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:30,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:30,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:30,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:30,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:30,621 INFO L87 Difference]: Start difference. First operand 837 states and 1228 transitions. Second operand 3 states. [2019-09-20 13:28:30,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:30,699 INFO L93 Difference]: Finished difference Result 1107 states and 1624 transitions. [2019-09-20 13:28:30,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:30,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-20 13:28:30,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:30,704 INFO L225 Difference]: With dead ends: 1107 [2019-09-20 13:28:30,704 INFO L226 Difference]: Without dead ends: 1107 [2019-09-20 13:28:30,705 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:30,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-09-20 13:28:30,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1107. [2019-09-20 13:28:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1107 states. [2019-09-20 13:28:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1624 transitions. [2019-09-20 13:28:30,721 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1624 transitions. Word has length 167 [2019-09-20 13:28:30,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:30,722 INFO L475 AbstractCegarLoop]: Abstraction has 1107 states and 1624 transitions. [2019-09-20 13:28:30,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1624 transitions. [2019-09-20 13:28:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-20 13:28:30,724 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:30,725 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:30,725 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:30,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:30,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1296530854, now seen corresponding path program 1 times [2019-09-20 13:28:30,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:30,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:30,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-20 13:28:30,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:30,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:30,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:30,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:30,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:30,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:30,812 INFO L87 Difference]: Start difference. First operand 1107 states and 1624 transitions. Second operand 3 states. [2019-09-20 13:28:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:30,905 INFO L93 Difference]: Finished difference Result 1377 states and 2021 transitions. [2019-09-20 13:28:30,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:30,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-20 13:28:30,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:30,911 INFO L225 Difference]: With dead ends: 1377 [2019-09-20 13:28:30,911 INFO L226 Difference]: Without dead ends: 1377 [2019-09-20 13:28:30,914 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:30,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2019-09-20 13:28:30,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1377. [2019-09-20 13:28:30,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2019-09-20 13:28:30,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 2021 transitions. [2019-09-20 13:28:30,934 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 2021 transitions. Word has length 173 [2019-09-20 13:28:30,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:30,934 INFO L475 AbstractCegarLoop]: Abstraction has 1377 states and 2021 transitions. [2019-09-20 13:28:30,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:30,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2021 transitions. [2019-09-20 13:28:30,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-20 13:28:30,937 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:30,938 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:30,938 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:30,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:30,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1052214699, now seen corresponding path program 1 times [2019-09-20 13:28:30,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:30,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:30,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-20 13:28:31,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:31,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:31,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:31,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:31,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:31,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:31,035 INFO L87 Difference]: Start difference. First operand 1377 states and 2021 transitions. Second operand 3 states. [2019-09-20 13:28:31,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:31,116 INFO L93 Difference]: Finished difference Result 1647 states and 2419 transitions. [2019-09-20 13:28:31,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:31,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-09-20 13:28:31,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:31,124 INFO L225 Difference]: With dead ends: 1647 [2019-09-20 13:28:31,125 INFO L226 Difference]: Without dead ends: 1647 [2019-09-20 13:28:31,125 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:31,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2019-09-20 13:28:31,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2019-09-20 13:28:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1647 states. [2019-09-20 13:28:31,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2419 transitions. [2019-09-20 13:28:31,148 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2419 transitions. Word has length 205 [2019-09-20 13:28:31,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:31,148 INFO L475 AbstractCegarLoop]: Abstraction has 1647 states and 2419 transitions. [2019-09-20 13:28:31,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:31,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2419 transitions. [2019-09-20 13:28:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-20 13:28:31,154 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:31,154 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:31,154 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:31,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:31,155 INFO L82 PathProgramCache]: Analyzing trace with hash -596392427, now seen corresponding path program 1 times [2019-09-20 13:28:31,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:31,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:31,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-20 13:28:31,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:31,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:31,290 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:31,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:31,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:31,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:31,291 INFO L87 Difference]: Start difference. First operand 1647 states and 2419 transitions. Second operand 3 states. [2019-09-20 13:28:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:31,381 INFO L93 Difference]: Finished difference Result 1917 states and 2818 transitions. [2019-09-20 13:28:31,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:31,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-09-20 13:28:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:31,390 INFO L225 Difference]: With dead ends: 1917 [2019-09-20 13:28:31,391 INFO L226 Difference]: Without dead ends: 1917 [2019-09-20 13:28:31,391 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:31,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2019-09-20 13:28:31,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1917. [2019-09-20 13:28:31,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1917 states. [2019-09-20 13:28:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2818 transitions. [2019-09-20 13:28:31,417 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 2818 transitions. Word has length 207 [2019-09-20 13:28:31,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:31,418 INFO L475 AbstractCegarLoop]: Abstraction has 1917 states and 2818 transitions. [2019-09-20 13:28:31,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2818 transitions. [2019-09-20 13:28:31,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-20 13:28:31,422 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:31,422 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:31,423 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:31,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:31,423 INFO L82 PathProgramCache]: Analyzing trace with hash -347653797, now seen corresponding path program 1 times [2019-09-20 13:28:31,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:31,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:31,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:31,543 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-20 13:28:31,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:31,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:31,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:31,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:31,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:31,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:31,545 INFO L87 Difference]: Start difference. First operand 1917 states and 2818 transitions. Second operand 3 states. [2019-09-20 13:28:31,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:31,635 INFO L93 Difference]: Finished difference Result 2187 states and 3218 transitions. [2019-09-20 13:28:31,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:31,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-09-20 13:28:31,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:31,642 INFO L225 Difference]: With dead ends: 2187 [2019-09-20 13:28:31,642 INFO L226 Difference]: Without dead ends: 2187 [2019-09-20 13:28:31,642 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:31,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2019-09-20 13:28:31,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2187. [2019-09-20 13:28:31,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2187 states. [2019-09-20 13:28:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 3218 transitions. [2019-09-20 13:28:31,671 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 3218 transitions. Word has length 240 [2019-09-20 13:28:31,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:31,672 INFO L475 AbstractCegarLoop]: Abstraction has 2187 states and 3218 transitions. [2019-09-20 13:28:31,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 3218 transitions. [2019-09-20 13:28:31,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-09-20 13:28:31,677 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:31,677 INFO L407 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:31,677 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:31,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:31,678 INFO L82 PathProgramCache]: Analyzing trace with hash -869870947, now seen corresponding path program 1 times [2019-09-20 13:28:31,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:31,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:31,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-20 13:28:31,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:31,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:31,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:31,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:31,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:31,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:31,798 INFO L87 Difference]: Start difference. First operand 2187 states and 3218 transitions. Second operand 3 states. [2019-09-20 13:28:31,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:31,881 INFO L93 Difference]: Finished difference Result 2450 states and 3601 transitions. [2019-09-20 13:28:31,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:31,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 275 [2019-09-20 13:28:31,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:31,887 INFO L225 Difference]: With dead ends: 2450 [2019-09-20 13:28:31,887 INFO L226 Difference]: Without dead ends: 2450 [2019-09-20 13:28:31,888 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:31,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2019-09-20 13:28:31,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450. [2019-09-20 13:28:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2019-09-20 13:28:31,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3601 transitions. [2019-09-20 13:28:31,917 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3601 transitions. Word has length 275 [2019-09-20 13:28:31,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:31,917 INFO L475 AbstractCegarLoop]: Abstraction has 2450 states and 3601 transitions. [2019-09-20 13:28:31,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:31,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3601 transitions. [2019-09-20 13:28:31,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-20 13:28:31,922 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:31,923 INFO L407 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:31,923 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:31,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:31,923 INFO L82 PathProgramCache]: Analyzing trace with hash -135036714, now seen corresponding path program 1 times [2019-09-20 13:28:31,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:31,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:31,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2019-09-20 13:28:32,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:32,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:32,086 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:32,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:32,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:32,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:32,087 INFO L87 Difference]: Start difference. First operand 2450 states and 3601 transitions. Second operand 3 states. [2019-09-20 13:28:32,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:32,229 INFO L93 Difference]: Finished difference Result 2720 states and 4003 transitions. [2019-09-20 13:28:32,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:32,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-20 13:28:32,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:32,236 INFO L225 Difference]: With dead ends: 2720 [2019-09-20 13:28:32,236 INFO L226 Difference]: Without dead ends: 2720 [2019-09-20 13:28:32,237 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-09-20 13:28:32,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2720. [2019-09-20 13:28:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2720 states. [2019-09-20 13:28:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 4003 transitions. [2019-09-20 13:28:32,267 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 4003 transitions. Word has length 314 [2019-09-20 13:28:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:32,267 INFO L475 AbstractCegarLoop]: Abstraction has 2720 states and 4003 transitions. [2019-09-20 13:28:32,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 4003 transitions. [2019-09-20 13:28:32,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-09-20 13:28:32,273 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:32,274 INFO L407 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:32,274 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:32,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:32,274 INFO L82 PathProgramCache]: Analyzing trace with hash -210562296, now seen corresponding path program 1 times [2019-09-20 13:28:32,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:32,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:32,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:32,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:32,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2019-09-20 13:28:32,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:32,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:32,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:32,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:32,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:32,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:32,451 INFO L87 Difference]: Start difference. First operand 2720 states and 4003 transitions. Second operand 3 states. [2019-09-20 13:28:32,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:32,533 INFO L93 Difference]: Finished difference Result 2990 states and 4406 transitions. [2019-09-20 13:28:32,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:32,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 355 [2019-09-20 13:28:32,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:32,540 INFO L225 Difference]: With dead ends: 2990 [2019-09-20 13:28:32,540 INFO L226 Difference]: Without dead ends: 2990 [2019-09-20 13:28:32,540 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:32,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2019-09-20 13:28:32,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 2990. [2019-09-20 13:28:32,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2990 states. [2019-09-20 13:28:32,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 4406 transitions. [2019-09-20 13:28:32,572 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 4406 transitions. Word has length 355 [2019-09-20 13:28:32,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:32,573 INFO L475 AbstractCegarLoop]: Abstraction has 2990 states and 4406 transitions. [2019-09-20 13:28:32,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 4406 transitions. [2019-09-20 13:28:32,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-20 13:28:32,578 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:32,579 INFO L407 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:32,579 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:32,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:32,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1213458592, now seen corresponding path program 1 times [2019-09-20 13:28:32,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:32,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:32,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:32,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:32,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-09-20 13:28:32,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:32,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:32,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:32,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:32,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:32,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:32,873 INFO L87 Difference]: Start difference. First operand 2990 states and 4406 transitions. Second operand 3 states. [2019-09-20 13:28:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:33,014 INFO L93 Difference]: Finished difference Result 3254 states and 4790 transitions. [2019-09-20 13:28:33,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:33,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-09-20 13:28:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:33,022 INFO L225 Difference]: With dead ends: 3254 [2019-09-20 13:28:33,022 INFO L226 Difference]: Without dead ends: 3254 [2019-09-20 13:28:33,022 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2019-09-20 13:28:33,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 3254. [2019-09-20 13:28:33,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3254 states. [2019-09-20 13:28:33,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 4790 transitions. [2019-09-20 13:28:33,058 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 4790 transitions. Word has length 398 [2019-09-20 13:28:33,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:33,059 INFO L475 AbstractCegarLoop]: Abstraction has 3254 states and 4790 transitions. [2019-09-20 13:28:33,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:33,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 4790 transitions. [2019-09-20 13:28:33,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-09-20 13:28:33,066 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:33,066 INFO L407 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:33,066 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:33,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:33,067 INFO L82 PathProgramCache]: Analyzing trace with hash 474023189, now seen corresponding path program 1 times [2019-09-20 13:28:33,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:33,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:33,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:33,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:33,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:33,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2019-09-20 13:28:33,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:33,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:33,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:33,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:33,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:33,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:33,307 INFO L87 Difference]: Start difference. First operand 3254 states and 4790 transitions. Second operand 3 states. [2019-09-20 13:28:33,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:33,404 INFO L93 Difference]: Finished difference Result 3524 states and 5195 transitions. [2019-09-20 13:28:33,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:33,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 438 [2019-09-20 13:28:33,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:33,411 INFO L225 Difference]: With dead ends: 3524 [2019-09-20 13:28:33,411 INFO L226 Difference]: Without dead ends: 3524 [2019-09-20 13:28:33,412 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:33,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3524 states. [2019-09-20 13:28:33,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3524 to 3524. [2019-09-20 13:28:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3524 states. [2019-09-20 13:28:33,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 5195 transitions. [2019-09-20 13:28:33,454 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 5195 transitions. Word has length 438 [2019-09-20 13:28:33,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:33,455 INFO L475 AbstractCegarLoop]: Abstraction has 3524 states and 5195 transitions. [2019-09-20 13:28:33,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:33,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 5195 transitions. [2019-09-20 13:28:33,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-09-20 13:28:33,463 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:33,463 INFO L407 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:33,463 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:33,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:33,464 INFO L82 PathProgramCache]: Analyzing trace with hash -501243775, now seen corresponding path program 1 times [2019-09-20 13:28:33,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:33,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:33,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:33,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:33,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:33,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2130 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 1772 trivial. 0 not checked. [2019-09-20 13:28:33,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:33,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:33,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:33,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:33,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:33,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:33,838 INFO L87 Difference]: Start difference. First operand 3524 states and 5195 transitions. Second operand 3 states. [2019-09-20 13:28:33,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:33,930 INFO L93 Difference]: Finished difference Result 3794 states and 5601 transitions. [2019-09-20 13:28:33,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:33,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 480 [2019-09-20 13:28:33,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:33,939 INFO L225 Difference]: With dead ends: 3794 [2019-09-20 13:28:33,939 INFO L226 Difference]: Without dead ends: 3794 [2019-09-20 13:28:33,939 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3794 states. [2019-09-20 13:28:33,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3794 to 3794. [2019-09-20 13:28:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3794 states. [2019-09-20 13:28:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 5601 transitions. [2019-09-20 13:28:33,982 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 5601 transitions. Word has length 480 [2019-09-20 13:28:33,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:33,983 INFO L475 AbstractCegarLoop]: Abstraction has 3794 states and 5601 transitions. [2019-09-20 13:28:33,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:33,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 5601 transitions. [2019-09-20 13:28:33,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-09-20 13:28:33,992 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:33,992 INFO L407 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:33,992 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:33,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:33,993 INFO L82 PathProgramCache]: Analyzing trace with hash 184524699, now seen corresponding path program 1 times [2019-09-20 13:28:33,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:33,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:33,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:33,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:33,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1047 proven. 0 refuted. 0 times theorem prover too weak. 1481 trivial. 0 not checked. [2019-09-20 13:28:34,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:34,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:34,379 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:34,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:34,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:34,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:34,380 INFO L87 Difference]: Start difference. First operand 3794 states and 5601 transitions. Second operand 4 states. [2019-09-20 13:28:34,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:34,887 INFO L93 Difference]: Finished difference Result 5313 states and 7886 transitions. [2019-09-20 13:28:34,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:34,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 524 [2019-09-20 13:28:34,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:34,898 INFO L225 Difference]: With dead ends: 5313 [2019-09-20 13:28:34,898 INFO L226 Difference]: Without dead ends: 5313 [2019-09-20 13:28:34,898 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:34,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2019-09-20 13:28:34,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 4368. [2019-09-20 13:28:34,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4368 states. [2019-09-20 13:28:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4368 states to 4368 states and 6651 transitions. [2019-09-20 13:28:34,957 INFO L78 Accepts]: Start accepts. Automaton has 4368 states and 6651 transitions. Word has length 524 [2019-09-20 13:28:34,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:34,957 INFO L475 AbstractCegarLoop]: Abstraction has 4368 states and 6651 transitions. [2019-09-20 13:28:34,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:34,958 INFO L276 IsEmpty]: Start isEmpty. Operand 4368 states and 6651 transitions. [2019-09-20 13:28:34,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-09-20 13:28:34,969 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:34,969 INFO L407 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:34,969 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:34,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:34,970 INFO L82 PathProgramCache]: Analyzing trace with hash -672301545, now seen corresponding path program 1 times [2019-09-20 13:28:34,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:34,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:34,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:34,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:34,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 2135 trivial. 0 not checked. [2019-09-20 13:28:35,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:35,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:35,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:35,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:35,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:35,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:35,272 INFO L87 Difference]: Start difference. First operand 4368 states and 6651 transitions. Second operand 3 states. [2019-09-20 13:28:35,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:35,377 INFO L93 Difference]: Finished difference Result 4674 states and 7111 transitions. [2019-09-20 13:28:35,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:35,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 524 [2019-09-20 13:28:35,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:35,383 INFO L225 Difference]: With dead ends: 4674 [2019-09-20 13:28:35,383 INFO L226 Difference]: Without dead ends: 4674 [2019-09-20 13:28:35,384 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:35,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4674 states. [2019-09-20 13:28:35,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4674 to 4674. [2019-09-20 13:28:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4674 states. [2019-09-20 13:28:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4674 states to 4674 states and 7111 transitions. [2019-09-20 13:28:35,437 INFO L78 Accepts]: Start accepts. Automaton has 4674 states and 7111 transitions. Word has length 524 [2019-09-20 13:28:35,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:35,438 INFO L475 AbstractCegarLoop]: Abstraction has 4674 states and 7111 transitions. [2019-09-20 13:28:35,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:35,438 INFO L276 IsEmpty]: Start isEmpty. Operand 4674 states and 7111 transitions. [2019-09-20 13:28:35,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2019-09-20 13:28:35,449 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:35,449 INFO L407 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:35,450 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:35,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:35,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1140866295, now seen corresponding path program 1 times [2019-09-20 13:28:35,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:35,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:35,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:35,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:35,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:35,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2962 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 2528 trivial. 0 not checked. [2019-09-20 13:28:35,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:35,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:35,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:35,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:35,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:35,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:35,916 INFO L87 Difference]: Start difference. First operand 4674 states and 7111 transitions. Second operand 3 states. [2019-09-20 13:28:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:36,051 INFO L93 Difference]: Finished difference Result 4985 states and 7594 transitions. [2019-09-20 13:28:36,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:36,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 565 [2019-09-20 13:28:36,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:36,059 INFO L225 Difference]: With dead ends: 4985 [2019-09-20 13:28:36,060 INFO L226 Difference]: Without dead ends: 4985 [2019-09-20 13:28:36,060 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:36,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4985 states. [2019-09-20 13:28:36,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4985 to 4985. [2019-09-20 13:28:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4985 states. [2019-09-20 13:28:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4985 states to 4985 states and 7594 transitions. [2019-09-20 13:28:36,130 INFO L78 Accepts]: Start accepts. Automaton has 4985 states and 7594 transitions. Word has length 565 [2019-09-20 13:28:36,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:36,131 INFO L475 AbstractCegarLoop]: Abstraction has 4985 states and 7594 transitions. [2019-09-20 13:28:36,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand 4985 states and 7594 transitions. [2019-09-20 13:28:36,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2019-09-20 13:28:36,143 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:36,143 INFO L407 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:36,143 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:36,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:36,144 INFO L82 PathProgramCache]: Analyzing trace with hash 219902030, now seen corresponding path program 1 times [2019-09-20 13:28:36,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:36,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:36,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:36,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:36,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:36,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3434 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 2968 trivial. 0 not checked. [2019-09-20 13:28:36,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:36,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:36,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:36,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:36,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:36,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:36,552 INFO L87 Difference]: Start difference. First operand 4985 states and 7594 transitions. Second operand 3 states. [2019-09-20 13:28:36,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:36,645 INFO L93 Difference]: Finished difference Result 5296 states and 8078 transitions. [2019-09-20 13:28:36,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:36,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 608 [2019-09-20 13:28:36,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:36,653 INFO L225 Difference]: With dead ends: 5296 [2019-09-20 13:28:36,653 INFO L226 Difference]: Without dead ends: 5296 [2019-09-20 13:28:36,653 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:36,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5296 states. [2019-09-20 13:28:36,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5296 to 5296. [2019-09-20 13:28:36,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5296 states. [2019-09-20 13:28:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5296 states to 5296 states and 8078 transitions. [2019-09-20 13:28:36,714 INFO L78 Accepts]: Start accepts. Automaton has 5296 states and 8078 transitions. Word has length 608 [2019-09-20 13:28:36,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:36,715 INFO L475 AbstractCegarLoop]: Abstraction has 5296 states and 8078 transitions. [2019-09-20 13:28:36,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 5296 states and 8078 transitions. [2019-09-20 13:28:36,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2019-09-20 13:28:36,726 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:36,727 INFO L407 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:36,727 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:36,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:36,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1338299445, now seen corresponding path program 1 times [2019-09-20 13:28:36,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:36,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:36,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:36,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:36,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)